Search arXivSearch

arXiv · 2510.17116

Pattern-Avoiding Peak Functions

Abstract

In 2020, Hamaker, Pawlowski, and Sagan introduced the \emph{pattern quasisymmetric functions}, which are quasisymmetric functions associated with pattern-avoidance classes of permutations, and defined via expansions in fundamental quasisymmetric functions. They determined which subsets of the symmetric group $\mathfrak{S}_3$ index pattern quasisymmetric functions that are symmetric, and showed that these symmetric pattern quasisymmetric functions are also Schur-positive. They then posed the question of when symmetry or Schur $P$-positivity occur for analogous quasisymmetric functions defined in terms of peak functions. In this work we answer this question, that is, we identify precisely which subsets of $\mathfrak{S}_3$ give a \emph{pattern-avoiding peak function} that is symmetric, and give explicit formulas for the positive expansion into the closely-related Schur $Q$-functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthew Slattery-Holmes. 2025-10-20. Pattern-Avoiding Peak Functions. https://arxiv.org/abs/2510.17116

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