English
Related papers

Related papers: Lenart's bijection via bumpless pipe dreams

200 papers

We give a new proof that three families of polynomials coincide: the double Schubert polynomials of Lascoux and Sch\"utzenberger defined by divided difference operators, the pipe dream polynomials of Bergeron and Billey, and the equivariant…

Combinatorics · Mathematics 2022-02-08 Allen Knutson

This paper investigates two involutions on binary trees. One is the mirror symmetry of binary trees which combined with the classical bijection $\varphi$ between binary trees and plane trees answers an open problem posed by Bai and Chen.…

Combinatorics · Mathematics 2023-09-13 Yang Li , Zhicong Lin , Tongyuan Zhao

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

We study representations of data from an arbitrary metric space $\mathcal{X}$ in the space of univariate Gaussian mixtures with a transport metric (Delon and Desolneux 2020). We derive embedding guarantees for feature maps implemented by…

Machine Learning · Computer Science 2023-10-17 Anastasis Kratsios , Valentin Debarnot , Ivan Dokmanić

We apply the recent results of Galkin et al. [GKMS15] to study some geometrical features of Keum's fake projective planes. Among other things, we show that the bicanonical map of Keum's fake projective planes is always an embedding.…

Algebraic Geometry · Mathematics 2017-10-25 Gennaro Di Brino , Luca F. Di Cerbo

As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we…

Combinatorics · Mathematics 2025-02-14 Yang Li , Zhicong Lin

In 2006, Chapoton defined a class of Tamari intervals called "new intervals" in his enumeration of Tamari intervals, and he found that these new intervals are equi-enumerated with bipartite planar maps. We present here a direct bijection…

Combinatorics · Mathematics 2021-06-18 Wenjie Fang

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 present a simplified variant of Biane's bijection between permutations and 3-colored Motzkin paths with weight that keeps track of the inversion number, excedance number and a statistic so-called depth of a permutation. This generalizes…

Combinatorics · Mathematics 2024-06-25 Sen-Peng Eu , Tung-Shan Fu , Yuan-Hsun Lo

For a finite simple graph $G$, the bunkbed graph $G^\pm$ is defined to be the product graph $G\square K_2$. We will label the two copies of a vertex $v\in V(G)$ as $v_-$ and $v_+$. The bunkbed conjecture, posed by Kasteleyn, states that for…

Combinatorics · Mathematics 2023-02-02 Lawrence Hollom

We prove some asymptotic results for the radius and the profile of large random bipartite planar maps. Using a bijection due to Bouttier, Di Francesco and Guitter between rooted bipartite planar maps and certain two-type trees with positive…

Probability · Mathematics 2007-05-23 Mathilde Weill

We study random permutations arising from reduced pipe dreams. Our main model is motivated by Grothendieck polynomials with parameter $\beta=1$ arising in K-theory of the flag variety. The probability weight of a permutation is proportional…

Probability · Mathematics 2025-04-17 Alejandro H. Morales , Greta Panova , Leonid Petrov , Damir Yeliussizov

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

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

A well-labelled positive path of size n is a pair (p,\sigma) made of a word p=p_1p_2...p_{n-1} on the alphabet {-1, 0,+1} such that the sum of the letters of any prefix is non-negative, together with a permutation \sigma of {1,2,...,n} such…

Combinatorics · Mathematics 2010-10-04 Olivier Bernardi , Bertrand Duplantier , Philippe Nadeau

The geometric naturality of Schubert polynomials and their combinatorial pipe dream representations was established by Knutson and Miller (2005) via antidiagonal Gr\"obner degeneration of matrix Schubert varieties. We consider instead…

Combinatorics · Mathematics 2022-03-25 Zachary Hamaker , Oliver Pechenik , Anna Weigandt

Let F be a continuous injective map from an open subset of R^n to R^n. Assume that, for infinitely many k>1, F induces a bijection between the rational points of denominator k in the domain and those in the image (the denominator of…

Number Theory · Mathematics 2011-05-10 Giovanni Panti

There is a natural bijection between Dyck paths and basis diagrams of the Temperley-Lieb algebra defined via tiling. Overhang paths are certain generalisations of Dyck paths allowing more general steps but restricted to a rectangle in the…

Combinatorics · Mathematics 2020-12-21 Bethany Marsh , Paul Martin

We present a bijection for toroidal maps that are essentially $3$-connected ($3$-connected in the periodic planar representation). Our construction actually proceeds on certain closely related bipartite toroidal maps with all faces of…

Combinatorics · Mathematics 2020-11-24 Nicolas Bonichon , Éric Fusy , Benjamin Lévêque

A di-sk tree is a rooted binary tree whose nodes are labeled by $\oplus$ or $\ominus$, and no node has the same label as its right child. The di-sk trees are in natural bijection with separable permutations. We construct a combinatorial…

Combinatorics · Mathematics 2021-09-15 Shishuo Fu , Zhicong Lin , Yaling Wang
‹ Prev 1 3 4 5 6 7 10 Next ›