English
Related papers

Related papers: Cycles and sorting index for matchings and restric…

200 papers

Let $\mathcal D_n$ denote the average number of iterations of West's stack-sorting map $s$ that are needed to sort a permutation in $S_n$ into the identity permutation $123\cdots n$. We prove that…

Combinatorics · Mathematics 2020-09-29 Colin Defant

A permutation is so-called two stack sortable if it (i) avoids the (scattered) pattern 2-3-4-1, and (ii) contains a 3-2-4-1 pattern only as part of a 3-5-2-4-1 pattern. Here we show that the permutations on [n] satisfying condition (ii)…

Combinatorics · Mathematics 2007-05-23 David Callan

We study cycle counts in permutations of $1,\dots,n$ drawn at random according to the Mallows distribution. Under this distribution, each permutation $\pi \in S_n$ is selected with probability proportional to $q^{\text{inv}(\pi)}$, where…

Probability · Mathematics 2022-06-02 Jimmy He , Tobias Müller , Teun Verstraaten

The Goulden$\unicode{x2013}$Jackson cluster method, adapted to permutations by Elizalde and Noy, reduces the problem of counting permutations by occurrences of a prescribed consecutive pattern to that of counting clusters, which are special…

Combinatorics · Mathematics 2023-05-19 Sergi Elizalde , Justin M. Troyka , Yan Zhuang

We construct bijections to show that two pairs of sextuple set-valued statistics of permutations are equidistributed on symmetric groups. This extends a recent result of Sokal and the second author valid for integer-valued statistics as…

Combinatorics · Mathematics 2019-11-13 Jianxi Mao , Jiang Zeng

In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…

Probability · Mathematics 2026-03-26 Aurélien Guerder

We prove several combinatorial properties of suffix arrays, including a characterization of suffix arrays through a bijection with a certain well-defined class of permutations. Our approach is based on the characterization of…

Data Structures and Algorithms · Computer Science 2012-06-19 Gregory Kucherov , Lilla Tóthmérész , Stéphane Vialette

Various statistics on wreath products are defined via canonical words, "colored" right to left minima and "colored" descents. It is shown that refined counts with respect to these statistics have nice recurrence formulas of…

Combinatorics · Mathematics 2007-05-23 Amitai Regev , Yuval Roichman

In 2010, B. Rhoades proved that promotion together with the fake-degree polynomial associated with rectangular standard Young tableaux give an instance of the cyclic sieving phenomenon. We extend this result to all skew standard Young…

Combinatorics · Mathematics 2023-10-04 Per Alexandersson , Stephan Pfannerer , Martin Rubey , Joakim Uhlin

Babson and Steingr\'{\i}msson introduced generalized permutation patterns and showed that most of the Mahonian statistics in the literature can be expressed by the combination of generalized pattern functions. Particularly, they defined a…

Combinatorics · Mathematics 2017-01-30 Joanna N. Chen , Shouxiao Li

We show that the bistatistic of right nestings and right crossings in matchings without left nestings is equidistributed with the number of occurrences of two certain patterns in permutations, and furthermore that this equidistribution…

Combinatorics · Mathematics 2011-12-12 Niklas Eriksen , Jonas Sjöstrand

We study relationships between permutation statistics and pattern-functions, counting the number of times particular patterns occur in a permutation. This allows us to write several familiar statistics as linear combinations of pattern…

Combinatorics · Mathematics 2022-11-22 Yosef Berman , Bridget Eileen Tenner

The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…

Combinatorics · Mathematics 2013-05-01 Kassie Archer , Sergi Elizalde

We introduce a lifting of West's stack-sorting map $s$ to partition diagrams, which are combinatorial objects indexing bases of partition algebras. Our lifting $\mathscr{S}$ of $s$ is such that $\mathscr{S}$ behaves in the same way as $s$…

Combinatorics · Mathematics 2023-07-26 John M. Campbell

In this paper, we study merging-free partitions with their canonical forms and run-sorted permutations. We give a combinatorial proof of the conjecture made by Nabawanda et al. We describe the distribution of the statistics of runs and…

Combinatorics · Mathematics 2022-04-06 Fufa Beyene , Roberto Mantaci

Permutation sorting, one of the fundamental steps in pre-processing data for the efficient application of other algorithms, has a long history in mathematical research literature and has numerous applications. Two special-purpose sorting…

Combinatorics · Mathematics 2017-08-22 K. L. M. Adamyk , E. Holmes , G. R. Mayfield , D. J. Moritz , M. Scheepers , B. E. Tenner , H. C. Wauck

In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…

Combinatorics · Mathematics 2009-11-19 Michael Lugo

In a recent paper, Goyt and Sagan studied distributions of certain set partition statistics over pattern restricted sets of set partitions that were counted by the Fibonacci numbers. Their study produced a class of $q$-Fibonacci numbers,…

Combinatorics · Mathematics 2009-09-30 Adam M. Goyt , David Mathisen

In the symmetric group on a set of size 2n, let P_{2n} denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as ``pairings'', since each disjoint cycle has length 2). Harer and Zagier explicitly…

Combinatorics · Mathematics 2008-03-06 I. P. Goulden , William Slofstra

The distribution of certain Mahonian statistic (called $\mathrm{BAST}$) introduced by Babson and Steingr\'{i}msson over the set of permutations that avoid vincular pattern $1\underline{32}$, is shown bijectively to match the distribution of…

Combinatorics · Mathematics 2019-02-19 Joanna N. Chen , Shishuo Fu