Search arXivSearch

arXiv · 2502.07926

The free and parking quasi-symmetrizing actions

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adrien Segovia. 2025-02-11. The free and parking quasi-symmetrizing actions. https://arxiv.org/abs/2502.07926

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO