Related papers: Refining the bijections among ascent sequences, (2…
There is a natural bijection between permutations obtainable using a stack (those avoiding the pattern 312) and permutations obtainable using a queue (those avoiding 321). This bijection is equivalent to one described by Simion and Schmidt…
We present an equivariant bijection between two actions--promotion and rowmotion--on order ideals in certain posets. This bijection simultaneously generalizes a result of R. Stanley concerning promotion on the linear extensions of two…
The enumeration of inversion sequences avoiding a single pattern was initiated by Corteel--Martinez--Savage--Weselcouch and Mansour--Shattuck independently. Their work has sparked various investigations of generalized patterns in inversion…
Vincular and covincular patterns are generalizations of classical patterns allowing restrictions on the indices and values of the occurrences in a permutation. In this paper we study the integer sequences arising as the enumerations of…
A poset is {\it $(\3+\1)$-free} if it contains no induced subposet isomorphic to the disjoint union of a 3-element chain and a 1-element chain. These posets are of interest because of their connection with interval orders and their…
A poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Two elements in a poset are indistinguishable if they have the same strict up-set and the…
The purpose of this paper is twofold. First we answer to a question asked by Steingrimsson and Williams about certain permutation tableaux: we construct a bijection between binary trees and the so-called Catalan tableaux. These tableaux are…
We explore the enumeration of some natural classes of graded posets, including all graded posets, (2+2)- and (3+1)-avoiding graded posets, (2+2)-avoiding graded posets, and (3+1)-avoiding graded posets. We obtain enumerative and structural…
The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flattened partitions over [n] avoiding a single pattern, as well…
We introduce a new concept of permutation avoidance pattern called hatted pattern, which is a natural generalization of the barred pattern. We show the growth rate of the class of permutations avoiding a hatted pattern in comparison to…
The class of ranked tree-child networks, tree-child networks arising from an evolution process with a fixed embedding into the plane, has recently been introduced by Bienvenu, Lambert, and Steel. These authors derived counting results for…
We exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijection, it is shown that all the recently discovered results on generating functions for 132-avoiding permutations with a given number of occurrences of…
We construct an intriguing bijection between $021$-avoiding inversion sequences and $(2413,4213)$-avoiding permutations, which proves a sextuple equidistribution involving double Eulerian statistics. Two interesting applications of this…
Let $\mathcal{S}_n(\pi)$ (resp. $\mathcal{I}_n(\pi)$ and $\mathcal{AI}_n(\pi)$) denote the set of permutations (resp. involutions and alternating involutions) of length $n$ which avoid the permutation pattern $\pi$. For $k,m\geq 1$,…
In a recent preprint, Mike Cummings showed that the smooth components of suitably parametrized Springer fibers are in bijection with contracted, fully reduced Pl\"ucker degree-two $\mathfrak{sl}_r$-webs of standard type and that are…
In [S. Kitaev and J. Remmel: Classifying descents according to parity] the authors refine the well-known permutation statistic "descent" by fixing parity of (exactly) one of the descent's numbers. In this paper, we generalize the results of…
We introduce a notion of pattern occurrence that generalizes both classical permutation patterns as well as poset containment. Many questions about pattern statistics and avoidance generalize naturally to this setting, and we focus on…
Recently, Dokos et al. conjectured that for all $k, m\geq 1$, the patterns $ 12\ldots k(k+m+1)\ldots (k+2)(k+1) $ and $(m+1)(m+2)\ldots (k+m+1)m\ldots 21 $ are $maj$-Wilf-equivalent. In this paper, we confirm this conjecture for all $k\geq…
It is known that, when $n$ is even, the number of permutations of $\{1,2,\dots,n\}$ all of whose cycles have odd length equals the number of those all of whose cycles have even length. Adin, Heged\H{u}s and Roichman recently found a…
A permutation whose any prefix has no more descents than ascents is called a ballot permutation. In this paper, we present a decomposition of ballot permutations that enables us to construct a bijection between ballot permutations and odd…