Search arXivSearch

arXiv · 2311.02974

Joint distributions of statistics over permutations avoiding two patterns of length 3

Abstract

Finding distributions of permutation statistics over pattern-avoiding classes of permutations attracted much attention in the literature. In particular, Bukata et al. found distributions of ascents and descents on permutations avoiding any two patterns of length 3. In this paper, we generalize these results in two different ways: we find explicit formulas for the joint distribution of six statistics (asc, des, lrmax, lrmin, rlmax, rlmin), and also explicit formulas for the joint distribution of four statistics (asc, des, MNA, MND) on these permutations in all cases. The latter result also extends the recent studies by Kitaev and Zhang of the statistics MNA and MND (related to non-overlapping occurrences of ascents and descents) on stack-sortable permutations. All multivariate generating functions in our paper are rational, and we provide combinatorial proofs of five equidistribution results that can be derived from the generating functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tian Han, Sergey Kitaev. 2024-08-26. Joint distributions of statistics over permutations avoiding two patterns of length 3. https://doi.org/10.46298/dmtcs.12517

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