English
Related papers

Related papers: A bijection between triangulations and $312$-avoid…

200 papers

We construct a bijection between $321$- and $213$-avoiding permutations that preserves the property of $t$-stack-sortability. Our bijection transforms natural statistics between these two classes of permutations and proves a refinement of…

Combinatorics · Mathematics 2025-07-15 Yang Li , Sergey Kitaev , Zhicong Lin , Jing Liu

We present a bijection between 321- and 132-avoiding permutations that preserves the number of fixed points and the number of excedances. This gives a simple combinatorial proof of recent results of Robertson, Saracino and Zeilberger, and…

Combinatorics · Mathematics 2007-05-23 Sergi Elizalde , Igor Pak

A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length…

Combinatorics · Mathematics 2007-05-23 Sergi Elizalde

We find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin paths, UH-free Schr{\"o}der paths and Schr{\"o}der paths without peaks at even height. We also give a direct bijection between 2-distant…

Combinatorics · Mathematics 2011-08-30 Jang Soo Kim

In this paper we give a bijective proof for a relation between uni- bi- and tricellular maps of certain topological genus. While this relation can formally be obtained using Matrix-theory as a result of the Schwinger-Dyson equation, we here…

Combinatorics · Mathematics 2019-08-13 Hillary S. W. Han , Christian M. Reidys

It is well-known, and was first established by Knuth in 1969, that the number of 321-avoiding permutations is equal to that of 132-avoiding permutations. In the literature one can find many subsequent bijective proofs of this fact. It turns…

Combinatorics · Mathematics 2008-05-12 Anders Claesson , Sergey Kitaev

We present a simple bijection between Baxter permutations of size $n$ and plane bipolar orientations with n edges. This bijection translates several classical parameters of permutations (number of ascents, right-to-left maxima,…

Combinatorics · Mathematics 2014-03-19 Nicolas Bonichon , Mireille Bousquet-Mélou , Eric Fusy

We construct a direct natural bijection between descending plane partitions without any special part and permutations. The directness is in the sense that the bijection avoids any reference to nonintersecting lattice paths. The advantage of…

Combinatorics · Mathematics 2020-06-16 Arvind Ayyer

This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific "transversal structures" on triangulations of the 4-gon with no separating 3-cycle, which are…

Combinatorics · Mathematics 2009-03-20 Eric Fusy

A $d$-angulation is a planar map with faces of degree $d$. We present for each integer $d\geq 3$ a bijection between the class of $d$-angulations of girth $d$ (i.e., with no cycle of length less than $d$) and a class of decorated plane…

Combinatorics · Mathematics 2012-06-13 Olivier Bernardi , Eric Fusy

A bijection between $(31245,32145,31254,32154)$-avoiding permutations and $(31425,32415,31524,32514)$-avoiding permutations is constructed, which preserves five classical set-valued statistics. Combining with two codings of permutations due…

Combinatorics · Mathematics 2022-12-23 Joanna N. Chen , Zhicong Lin

We give some results about a bijection associating each permutation with a subexcedant function. This function is related to a particular decomposition of the permutation as a product of transpositions and therefore it has been called…

Combinatorics · Mathematics 2022-08-17 Fufa Beyene , Roberto Mantaci

We show how a bijection due to Biane between involutions and labelled Motzkin paths yields bijections between Motzkin paths and two families of restricted involutions that are counted by Motzkin numbers, namely, involutions avoiding 4321…

Combinatorics · Mathematics 2008-12-17 M. Barnabei , F. Bonetti , M. Silimbani

A permutation is (1-23-4)-avoiding if it contains no four entries, increasing left to right, with the middle two adjacent in the permutation. Here we give a 2-variable recurrence for the number of such permutations, improving on the…

Combinatorics · Mathematics 2010-08-16 David Callan

A basic and an improved ear clipping based algorithm for triangulating simple polygons and polygons with holes are presented. In the basic version, the ear with smallest interior angle is always selected to be cut in order to create fewer…

Computational Geometry · Computer Science 2013-06-04 Gang Mei , John C. Tipper , Nengxiong Xu

We describe a special bijection between the indecomposable summands of two basic $\tau$-tilting modules.

Representation Theory · Mathematics 2025-04-10 Gabriella D'Este , H. Melis Tekin Akcin

In this note a bijection is constructed between the set of partitions of n simultaneously s-regular and t-distinct, and those simultaneously t-regular and s-distinct. Some implications of the map are discussed. As a generalized version of…

Combinatorics · Mathematics 2022-08-04 William J. Keith

An ear in a triangulation $T$ of a convex $n$-gon $P$ is a triangle of $T$ that shares two sides with $P$ itself. Certain enumerational and structural problems become easier when one considers only triangulations with few ears. We…

Combinatorics · Mathematics 2014-02-05 Andrei Asinowski , Alon Regev

Triangulations of a product of two simplices and, more generally, of root polytopes are closely related to Gelfand-Kapranov-Zelevinsky's theory of discriminants, to tropical geometry, tropical oriented matroids, and to generalized…

Combinatorics · Mathematics 2018-03-19 Pavel Galashin , Gleb Nenashev , Alexander Postnikov

A bijection between ternary trees with $n$ nodes and a subclass of Motzkin paths of length $3n$ is given. This bijection can then be generalized to $t$-ary trees.

Combinatorics · Mathematics 2018-08-17 Helmut Prodinger , Sarah J. Selkirk
‹ Prev 1 2 3 10 Next ›