Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2510.18432

Operads and bialgebras of multi-indices, and Novikov algebras

Loïc Foissy
View original source ↗Read source document ↗Export metadata ↓

Abstract

Noncommutative multi-indices are noncommutative monomials in a $\mathbb{N}$-indexed family of indeterminates. We define on them a $\mathbb{Z}$-graded operadic structure, with the help of a shifting derivation. Multi-indices of degree 0 are called populated: they form a suboperad, isomorphic to the operad of Novikov algebras. This operadic structure, and the relation between pre-Lie and Novikov algebras, induces two bialgebraic structure in cointeraction on commutative multi-indices. We show how to combinatorially embed this double bialgebra into the Connes-Kreimer Hopf algebra of rooted trees, with its two coproducts based, firstly on cuts, secondly, on contraction of edges, and how this embedding can be characterized by a Dyson-Schwinger equation. We also study the unique polynomial invariant compatible with the two bialgebraic structures on multi-indices and use to describe the antipode for the first coproduct.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Loïc Foissy. 2025-10-21. Operads and bialgebras of multi-indices, and Novikov algebras. https://arxiv.org/abs/2510.18432

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗