Search arXivSearch

arXiv · 2405.05867

Quasisymmetric Schur $Q$-functions and peak Young quasisymmetric Schur functions

Abstract

In this paper, we explore the relationship between quasisymmetric Schur $Q$-functions and peak Young quasisymmetric Schur functions. We introduce a bijection on $\mathsf{SPIT}(α)$ such that $\{\mathrm{w}_{\rm c}(T) \mid T \in \mathsf{SPIT}(α)\}$ and $\{\mathrm{w}_{\rm r}(T) \mid T \in \mathsf{SPIT}(α)\}$ share identical descent distributions. Here, $\mathsf{SPIT}(α)$ is the set of standard peak immaculate tableaux of shape $α$, and $\mathrm{w}_{\rm c}$ and $\mathrm{w}_{\rm r}$ denote column reading and row reading, respectively. By combining this equidistribution with the algorithm developed by Allen, Hallam, and Mason, we demonstrate that the transition matrix from the basis of quasisymmetric Schur $Q$-functions to the basis of peak Young quasisymmetric Schur functions is upper triangular, with entries being non-negative integers. Furthermore, we provide explicit descriptions of the expansion of peak Young quasisymmetric Schur functions in specific cases, in terms of quasisymmetric Schur $Q$-functions. We also investigate the combinatorial properties of standard peak immaculate tableaux, standard Young composition tableaux, and standard peak Young composition tableaux. We provide a hook length formula for $\mathsf{SPIT}(α)$ and show that standard Young composition tableaux and standard peak Young composition tableaux can be bijectively mapped to specific words in a familiar form. Especially, cases of compositions with rectangular shape are examined in detail.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Seung-Il Choi, Sun-Young Nam, Young-Tak Oh. 2025-07-08. Quasisymmetric Schur $Q$-functions and peak Young quasisymmetric Schur functions. https://doi.org/10.1016/j.ejc.2025.104213

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