Table of Contents
Fetching ...

The free and parking quasi-symmetrizing actions

Adrien Segovia

TL;DR

This work constructs two invariant Hopf algebras, $FQSym^*$ and $PQSym^*$, via free and parking quasi-symmetrizing actions of the infinite symmetric group on words, and provides polynomial realizations, orbit-sum bases, and fundamental (co)product structures. It introduces a parameterized interpolation, generating a nested chain of Hopf subalgebras ${\textbf{PQSym}^*}^r$ that connect $PQSym^*$ to its limits, with explicit Hilbert series and bases indexed by $r$-bi-words. In the special case $r=\infty$, the dimensions of homogeneous components enumerate rooted labeled non-planar trees with maximal decreasing subtrees forming a chain, linking parking-function combinatorics to classical tree enumeration via bijections and known formulas. Overall, the paper furnishes invariant-based, combinatorially rich realizations of quasi-symmetric Hopf algebras and unveils deep connections between parking structures, $r$-interpolations, and tree enumerations.

Abstract

We define two actions of the infinite symmetric group on the set of words on positive integers, called the free and parking quasi-symmetrizing actions, whose invariants are respectively the elements of the Hopf algebras $\textbf{FQSym}^*$ and $\textbf{PQSym}^*$. We study in depth the parking quasi-symmetrizing action by generalizing it to actions with a parameter $r\in(\mathbb{N}\setminus \{0\} )\bigcup\{\infty\}$. We prove that the spaces of the invariants under these $r$-actions form an infinite chain of nested graded Hopf subalgebras of $\textbf{PQSym}^*$. We give some properties of these Hopf algebras including their Hilbert series, a basis, and formulas for their product and coproduct. Finally we look more closely at the case $r=\infty$, obtaining enumerative results related to trees with maximal decreasing subtrees of given sizes.

The free and parking quasi-symmetrizing actions

TL;DR

This work constructs two invariant Hopf algebras, and , via free and parking quasi-symmetrizing actions of the infinite symmetric group on words, and provides polynomial realizations, orbit-sum bases, and fundamental (co)product structures. It introduces a parameterized interpolation, generating a nested chain of Hopf subalgebras that connect to its limits, with explicit Hilbert series and bases indexed by -bi-words. In the special case , the dimensions of homogeneous components enumerate rooted labeled non-planar trees with maximal decreasing subtrees forming a chain, linking parking-function combinatorics to classical tree enumeration via bijections and known formulas. Overall, the paper furnishes invariant-based, combinatorially rich realizations of quasi-symmetric Hopf algebras and unveils deep connections between parking structures, -interpolations, and tree enumerations.

Abstract

We define two actions of the infinite symmetric group on the set of words on positive integers, called the free and parking quasi-symmetrizing actions, whose invariants are respectively the elements of the Hopf algebras and . We study in depth the parking quasi-symmetrizing action by generalizing it to actions with a parameter . We prove that the spaces of the invariants under these -actions form an infinite chain of nested graded Hopf subalgebras of . We give some properties of these Hopf algebras including their Hilbert series, a basis, and formulas for their product and coproduct. Finally we look more closely at the case , obtaining enumerative results related to trees with maximal decreasing subtrees of given sizes.

Paper Structure

This paper contains 7 sections, 26 theorems, 53 equations.

Key Result

Proposition 2

We have, for all $n> 1$, $|PPF_n|=(n-1)^{n-1}$.

Theorems & Definitions (71)

  • Definition 1: MalReu
  • Proposition 2: Stanley_2023, Exercise $49.(f)$
  • Example 3
  • Definition 4: articlePQSym
  • Example 5
  • Theorem 6: hivertlocal
  • Example 7
  • Definition 8
  • Example 9
  • Definition 10
  • ...and 61 more