English
Related papers

Related papers: A note on a bijection for Schr\"oder permutations

200 papers

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…

Combinatorics · Mathematics 2016-12-20 Zhicong Lin , Dongsu Kim

Pattern avoidance in the symmetric group $S_n$ has provided a number of useful connections between seemingly unrelated problems from stack-sorting to Schubert varieties. Recent work has generalized these results to $S_n\wr C_c$, the objects…

Combinatorics · Mathematics 2011-08-15 Adam M. Goyt , Lara K. Pudwell

In this paper, we investigate pattern avoidance of parity restricted (even or odd) Grassmannian permutations for patterns of sizes 3 and 4. We use a combination of direct counting and bijective techniques to provide recurrence relations,…

Combinatorics · Mathematics 2023-10-24 Juan B. Gil , Jessica A. Tomasko

We present various identities in the form of convolutions involving Stirling numbers of both kinds, Lah numbers, and binomial coefficients. Certain convolution polynomials are discussed also. The proofs are based on several series…

Combinatorics · Mathematics 2021-03-30 Khristo N. Boyadzhiev

In this note we continue the analysis of permutations that avoid substrings j(j+k), 1 <= j <= n-k, k < n, as well as substrings j(j+k) (mod n), 1 <= j <= n. In the first case the number of such permutations can be obtained from recursions…

Combinatorics · Mathematics 2017-03-09 Enrique Navarrete

We present a direct bijection between descending plane partitions with no special parts and permutation matrices. This bijection has the desirable property that the number of parts of the descending plane partition corresponds to the…

Combinatorics · Mathematics 2012-07-26 Jessica Striker

A permutation is called Grassmannian if it has at most one descent. The study of pattern avoidance in such permutations was initiated by Gil and Tomasko in 2021. We continue this work by studying Grassmannian permutations that avoid an…

Combinatorics · Mathematics 2023-10-13 Krishna Menon , Anurag Singh

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…

Combinatorics · Mathematics 2026-03-19 Jessica Striker , Bridget Eileen Tenner

Several authors have examined connections among restricted permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for involutions which avoid 3412. Our results…

Combinatorics · Mathematics 2007-05-23 Eric S. Egge

Let $r(n,k)$ (resp. $s(n,k)$) be the number of Schr\"oder paths (resp. little Schr\"oder paths) of length $2n$ with $k$ hills, and set $r(0,0)=s(0,0)=1$. We bijectively establish the following recurrence relations: \begin{align*}…

Combinatorics · Mathematics 2019-08-13 Shishuo Fu , Yaling Wang

Kim and Drake used generating functions to prove that the number of 2-distant noncrossing matchings, which are in bijection with little Schroeder paths, is the same as the weight of Dyck paths in which downsteps from even height have weight…

Combinatorics · Mathematics 2010-12-07 Dan Drake

We enumerate and characterize some classes of alternating and reverse alternating involutions avoiding a single pattern of length three or four. If on one hand the case of patterns of length three is trivial, on the other hand, the length…

Combinatorics · Mathematics 2022-09-20 Marilena Barnabei , Flavio Bonetti , Niccolò Castronuovo , Matteo Silimbani

Baxter permutations originally arose in studying common fixed points of two commuting continuous functions. In 2015, Dilks proposed a conjectured bijection between Baxter permutations and non-intersecting triples of lattice paths in terms…

Combinatorics · Mathematics 2021-12-23 Zhicong Lin , Jing Liu

We study the fine structure of the sets of involutions avoiding either 4312 (I(4321)) or 3412 (I(3412)), connecting the point of view of the decomposition theorems with the one of the associated labelled Motzkin paths. The algebraic…

Combinatorics · Mathematics 2011-02-17 Piera Manara , Claudio Perelli Cippo

We set up a new notion of local convergence for permutations and we prove a characterization in terms of proportions of \emph{consecutive} pattern occurrences. We also characterize random limiting objects for this new topology introducing a…

Probability · Mathematics 2020-03-20 Jacopo Borga

Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…

Discrete Mathematics · Computer Science 2024-06-25 Atli Fannar Franklín , Anders Claesson , Christian Bean , Henning Úlfarsson , Jay Pantone

As the case of free $\Bbbk$-algebras and $PBW$ algebras, given a bijective skew $PBW$ extension $A$, we will show that it is possible transfer Gr\"obner bases between $A$ and its associated graded ring.

Rings and Algebras · Mathematics 2015-11-27 Claudia Gallego

We discuss elliptic Pl\"ucker transformations of three-dimensional elliptic spaces. These are permutations on the set of lines such that any two related (orthogonally intersecting or identical) lines go over to related lines in both…

Algebraic Geometry · Mathematics 2024-02-13 Hans Havlicek

We describe an approach to finding a bijection between Alternating Sign Matrices and Totally Symmetric Self-Complementary Plane Partitions, which is based on the Schutzenberger involution. In particular we give an explicit bijection between…

Combinatorics · Mathematics 2011-05-26 Hayat Cheballah , Philippe Biane

We study $321$-avoiding affine permutations, and prove a formula for their enumeration with respect to the inversion number by using a combinatorial approach. This is done in two different ways, both related to Viennot's theory of heaps.…

Combinatorics · Mathematics 2017-10-11 Riccardo Biagioli , Frédéric Jouhet , Philippe Nadeau