Search arXivSearch

arXiv · 2405.10983

Mahonian Statistics and Vincular Patterns on Permutations over Multisets

Abstract

Most Mahonian statistics can be expressed as a linear combination of vincular patterns. This is not only true with statistics on the permutation set, but it can also be applied for statistics on the permutation with repetition set. By following the method extending the vincular patterns combinations presented by Kitaev and Vajnovszki, we discover 8 vincular-patterns combinations of mad and madl extensions that are possible to be Mahonian. Some of these have been proved to be Mahonian on repetitive permutations by Clarke, Steingrimsson and Zeng, while the rest are new statistics extensions. In this thesis, we determine combinations of vincular pattern extension of mad and madl in Clarke, Steingrimsson and Zeng s paper, which have been proved to be Mahonian on the repetitive permutations. This result will be used to support the proof of Mahonity of the new statistics extensions. We show that these new statistics extensions are also Mahonian by constructing an involution Φ on repetitive permutations, which preserves the descents statistics and transforms new statistics extensions to Mahonian mad and madl extensions of Clarke.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lien T. P. Ta, Huong T. T. Tran. 2024-05-14. Mahonian Statistics and Vincular Patterns on Permutations over Multisets. https://arxiv.org/abs/2405.10983

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