English
Related papers

Related papers: Lenart's bijection via bumpless pipe dreams

200 papers

We explore new connections between complete non-ambiguous trees (CNATs) and permutations. We give a bijection between tree-like tableaux and a specific subset of CNATs. This map is used to establish and solve a recurrence relation for the…

Combinatorics · Mathematics 2024-04-04 Daniel Chen , Sebastian Ohlig

We present a bijection between permutation matrices and descending plane partitions without special parts, which respects the quadruple of statistics considered by Behrend, Di Francesco and Zinn--Justin. This bijection involves the…

Combinatorics · Mathematics 2018-09-10 Markus Fulmek

Let F be a p-adic field and n a positive integer. The local Langlands conjecture asserts the existence of a bijection between irreducible admissible representations of GL(n,F) and n-dimensional admissible representations of the Weil-Deligne…

Number Theory · Mathematics 2008-02-03 Michael Harris

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…

Combinatorics · Mathematics 2018-10-08 Mark Dukes , Thomas Selig , Jason P. Smith , Einar Steingrimsson

In this paper we study alternative tableaux introduced by Viennot. These tableaux are in simple bijection with permutation tableaux, defined previously by Postnikov . We exhibit a simple recursive structure for alternative tableaux. From…

Combinatorics · Mathematics 2009-09-14 Philippe Nadeau

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

Generalized Tamari intervals have been recently introduced by Pr\'eville-Ratelle and Viennot, and have been proved to be in bijection with (rooted planar) non-separable maps by Fang and Pr\'eville-Ratelle. We present two new bijections…

Combinatorics · Mathematics 2023-04-25 Éric Fusy , Abel Humbert

We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…

Combinatorics · Mathematics 2022-12-12 Agnieszka Czyżewska-Jankowska , Piotr Śniady

We unify and extend previous bijections on plane quadrangulations to bipartite and quasibipartite plane maps. Starting from a bipartite plane map with a distinguished edge and two distinguished corners (in the same face or in two different…

Combinatorics · Mathematics 2018-12-21 Jérémie Bettinelli

In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux…

Combinatorics · Mathematics 2014-04-15 Jean-Christophe Aval , Adrien Boussicault , Philippe Nadeau

We recall the lower-upper varieties from [Knutson '05] and give a formula for their equivariant cohomology classes, as a sum over generic pipe dreams. We recover as limits the classic and bumpless pipe dream formulae for double Schubert…

Combinatorics · Mathematics 2024-11-19 Allen Knutson , Paul Zinn-Justin

We provide a bijective proof of the equidistribution of two pairs of vincular patterns in permutations, thereby resolving a recent open problem of Bitonti, Deb, and Sokal (arXiv:2412.10214). Since the bijection is involutive, we also…

Combinatorics · Mathematics 2025-09-17 Joanna N. Chen , Shishuo Fu , Jiang Zeng

The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…

Combinatorics · Mathematics 2010-03-26 Anders Claesson , Sergey Kitaev , Einar Steingrimsson

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 present a direct bijection between planar 3-connected triangulations and bridgeless planar maps, which were first enumerated by Tutte (1962) and Walsh and Lehman (1975) respectively. Previously known bijections by Wormald (1980) and Fusy…

Combinatorics · Mathematics 2018-01-16 Wenjie Fang

We give another bijective proof of a result of Corteel and Nadeau. We find a generating function related to unrestricted columns of permutation tableaux. As a consequence, we obtain a sign-imbalance formula for permutation tableaux. We…

Combinatorics · Mathematics 2011-08-30 Sylvie Corteel , Jang Soo Kim

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 develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…

Combinatorics · Mathematics 2017-04-12 Nikolaos Apostolakis , Kerry Ojakian

Involution Schubert polynomials represent cohomology classes of $K$-orbit closures in the complete flag variety, where $K$ is the orthogonal or symplectic group. We show they also represent $T$-equivariant cohomology classes of subvarieties…

Combinatorics · Mathematics 2022-11-09 Zachary Hamaker , Eric Marberg , Brendan Pawlowski

Schubert polynomials for the classical groups were defined by S.Billey and M.Haiman in 1995; they are polynomial representatives of Schubert classes in a full flag variety of a classical group. We provide a combinatorial description for…

Combinatorics · Mathematics 2022-09-15 Evgeny Smirnov , Anna Tutubalina