Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0511200

Hopf algebras and dendriform structures arising from parking functions

Jean-Christophe Novelli·Jean-Yves Thibon
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce a graded Hopf algebra based on the set of parking functions (hence of dimension (n+1)^{n-1} in degree n). This algebra can be embedded into a noncommutative polynomial algebra in infinitely many variables. We determine its structure, and show that it admits natural quotients and subalgebras whose graded components have dimensions respectively given by the Schroder numbers (plane trees), the Catalan numbers, and powers of 3. These smaller algebras are always bialgebras and belong to some family of di- or tri-algebras occuring in the works of Loday and Ronco. Moreover, the fundamental notion of parkization allows one to endow the set of parking functions of fixed length with an associative multiplication (different from the one coming from the Shi arrangement), leading to a generalization of the internal product of symmetric functions. Several of the intermediate algebras are stable under this operation. Among them, one finds the Solomon descent algebra but also a new algebra based on a Catalan set, admitting the Solomon algebra as a left ideal.

Explore related subjects

math.COmath.RA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jean-Christophe Novelli, Jean-Yves Thibon. 2005-11-08. Hopf algebras and dendriform structures arising from parking functions. https://arxiv.org/abs/math/0511200

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↗