Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2501.07009

Species of Rota-Baxter algebras by rooted trees, twisted bialgebras and Fock functors

Loic Foissy·Li Guo·Xiao-Song Peng·Yunzhou Xie·Yi Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

As a fundamental and ubiquitous combinatorial notion, species has attracted sustained interest, generalizing from set-theoretical combinatorial to algebraic combinatorial and beyond. The Rota-Baxter algebra is one of the algebraic structures with broad applications from Renormalization of quantum field theory to integrable systems and multiple zeta values. Its interpretation in terms of monoidal categories has also recently appeared. This paper studies species of Rota-Baxter algebras, making use of the combinatorial construction of free Rota-Baxter algebras in terms of angularly decorated trees and forests. The notion of simple angularly decorated forests is introduced for this purpose and the resulting Rota-Baxter species is shown to be free. Furthermore, a twisted bialgebra structure, as the bialgebra for species, is established on this free Rota-Baxter species. Finally, through the Fock functor, another proof of the bialgebra structure on free Rota-Baxter algebras is obtained.

Explore related subjects

math.COmath.CTmath.RA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Loic Foissy, Li Guo, Xiao-Song Peng, Yunzhou Xie, Yi Zhang. 2025-01-13. Species of Rota-Baxter algebras by rooted trees, twisted bialgebras and Fock functors. https://arxiv.org/abs/2501.07009

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↗