English
Related papers

Related papers: A simple explicit bijection between (n,2) Gog and …

200 papers

We consider the problem of finding a bijection between the sets of alternating sign matrices and of totally symmetric self complementary plane partitions, which can be reformulated using Gog and Magog triangles. In a previous work we…

Combinatorics · Mathematics 2014-01-28 Philippe Biane , Hayat Cheballah

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 are interested in finding an explicit bijection between two families of combinatorial objects: Gog and Magog triangles. These two families are particular classes of Gelfand-Tsetlin triangles and are respectively in bijection with…

Combinatorics · Mathematics 2013-05-14 Philippe Biane , Hayat Cheballah

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

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 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

For each positive integer $n$, we construct a bijection between the odd partitions and the distinct partitions of $n$ which extends Bressoud's bijection between the odd-and-distinct partitions of $n$ and the splitting partitions of $n$. We…

Combinatorics · Mathematics 2018-03-30 John Murray

Plane partitions in the totally symmetric self-complementary symmetry class (TSSCPP) are known to be equinumerous with n x n alternating sign matrices, but no explicit bijection is known. In this paper, we give a bijection from these plane…

Combinatorics · Mathematics 2024-11-26 Vincent Holmlund , Jessica Striker

We construct weight-preserving bijections between column strict shifted plane partitions with one row and alternating sign trapezoids with exactly one column in the left half that sums to $1$. Amongst other things, they relate the number of…

Combinatorics · Mathematics 2022-09-12 Hans Höngesberg

We derive a simple bijection between geometric plane perfect matchings on $2n$ points in convex position and triangulations on $n+2$ points in convex position. We then extend this bijection to monochromatic plane perfect matchings on…

Combinatorics · Mathematics 2018-07-16 Oswin Aichholzer , Lukas Andritsch , Karin Baur , Birgit Vogtenhuber

We present a simple a bijection between permutations of $\{1,..., n\}$ with $k$ descents and permutation tableaux of length $n$ with $k$ columns.

Combinatorics · Mathematics 2007-05-23 Sylvie Corteel

We present a simple bijection between permutation matrices and descending plane partitions without special parts. This bijection is already mentioned in work of P. Lalonde (without giving the details); it involves the inversion words of…

Combinatorics · Mathematics 2017-03-08 Markus Fulmek

We settle a question of Bressoud concerning the existence of an explicit bijection from a class of oriented square-ice graphs to a class of tournaments. We give an algorithm constructing such a bijection.

Combinatorics · Mathematics 2007-05-23 Robin Chapman

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

We demonstrate a natural bijection between a subclass of alternating sign matrices (ASMs) defined by a condition on the corresponding monotone triangle which we call the gapless condition and a subclass of totally symmetric…

Combinatorics · Mathematics 2012-08-28 Arvind Ayyer , Robert Cori , Dominique Gouyou-Beauchamps

We say two posets are "doppelg\"angers" if they have the same number of $P$-partitions of each height $k$. We give a uniform framework for bijective proofs that posets are doppelg\"angers by synthesizing $K$-theoretic Schubert calculus…

Combinatorics · Mathematics 2022-03-25 Zachary Hamaker , Rebecca Patrias , Oliver Pechenik , Nathan Williams

The order ideal $B_{n,2}$ of the Boolean lattice $B_n$ consists of all subsets of size at most $2$. Let $F_{n,2}$ denote the poset refinement of $B_{n,2}$ induced by the rules: $i < j$ implies $\{i \} \prec \{ j \}$ and $\{i,k \} \prec…

Combinatorics · Mathematics 2020-06-08 Andrew Beveridge , Ian Calaway , Kristin Heysse

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

We define a bijection that transforms an alternating sign matrix A with one -1 into a pair (N,E) where N is a (so called) ``neutral'' alternating sign matrix (with one -1) and E is an integer. The bijection preserves the classical…

Combinatorics · Mathematics 2007-05-23 Pierre Lalonde

In this article, we describe an explicit bijection between the set of $(m,n)$-words as defined by Pilaud and Poliakova and the set of of two-toned tilings of a strip of length $m+n$.

Combinatorics · Mathematics 2025-10-02 Henri Mühle
‹ Prev 1 2 3 10 Next ›