Search arXivSearch

arXiv · 2506.12868

The peak algebra in noncommuting variables

Abstract

The well-known descent-to-peak map $Θ_{\mathrm{QSym}}$ for the Hopf algebra of quasisymmetric functions, $\mathrm{QSym}$, and the peak algebra $Π$ were originally defined by Stembridge in 1997. We introduce their noncommutative analogues, the labelled descent-to-peak map $Θ_{\mathrm{NCQSym}}$ for the Hopf algebra of quasisymmetric functions in noncommuting variables, $\mathrm{NCQSym}$, and the peak algebra in noncommuting variables $\mathrm{NC}Π$. Then, we define the Hopf algebra of Schur $Q$-functions in noncommuting variables. We show that our generalizations possess many properties analogous to their classical counterparts. Furthermore, we show that the coefficients in the expansion of certain elements of $\mathrm{NC}Π$ in the monomial basis of $\mathrm{NCQSym}$ satisfy the generalized Dehn-Sommerville equation of Bayer and Billera. In the end, we give representation-theoretic interpretations of the descent-to-peak map for the Hopf algebras of symmetric functions and noncommutative symmetric functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Farid Aliniaeifard, Shu Xiao Li. 2025-09-27. The peak algebra in noncommuting variables. https://arxiv.org/abs/2506.12868

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