English
Related papers

Related papers: Bijections for generalized Tamari intervals via or…

200 papers

We present bijections for the planar cases of two counting formulas on maps that arise from the KP hierarchy (Goulden-Jackson and Carrell-Chapuy formulas), relying on a "cut-and-slide" operation. This is the first time a bijective proof is…

Combinatorics · Mathematics 2019-11-01 Baptiste Louf

We introduce the set of (non-spanning) tree-decorated planar maps, and show that they are in bijection with the Cartesian product between the set of trees and the set of maps with a simple boundary. As a consequence, we count the number of…

Combinatorics · Mathematics 2020-04-09 Luis Fredes , Avelio Sepúlveda

We consider maps on orientable surfaces. A map is called \emph{unicellular} if it has a single face. A \emph{covered map} is a map (of genus $g$) with a marked unicellular spanning submap (which can have any genus in $\{0,1,...,g\}$). Our…

Combinatorics · Mathematics 2012-03-14 Olivier Bernardi , Guillaume Chapuy

We present a general bijective approach to planar hypermaps with two main results. First we obtain unified bijections for all classes of maps or hypermaps defined by face-degree constraints and girth constraints. To any such class we…

Combinatorics · Mathematics 2019-06-14 Olivier Bernardi , Eric Fusy

In this paper, we exploit the combinatorics and geometry of triangulations of products of simplices to derive new results in the context of Catalan combinatorics of $\nu$-Tamari lattices. In our framework, the main role of "Catalan objects"…

Combinatorics · Mathematics 2017-10-12 Cesar Ceballos , Arnau Padrol , Camilo Sarmiento

We extend the Marcus-Schaeffer bijection between orientable rooted bipartite quadrangulations (equivalently: rooted maps) and orientable labeled one-face maps to the case of all surfaces, that is orientable and non-orientable as well. This…

Combinatorics · Mathematics 2016-09-06 Guillaume Chapuy , Maciej Dołęga

We show new bijective proofs of previously known formulas for the number of regions of some deformations of the braid arrangement, by means of a bijection between the no-broken-circuit sets of the corresponding integral gain graphs and some…

Combinatorics · Mathematics 2014-08-26 Sylvie Corteel , David Forge , Véronique Ventos

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 consider planar maps with three boundaries, colloquially called pairs of pants. In the case of bipartite maps with controlled face degrees, a simple expression for their generating function was found by Eynard and proved bijectively by…

Combinatorics · Mathematics 2022-11-28 Jérémie Bouttier , Emmanuel Guitter , Grégory Miermont

The Stanley lattice, Tamari lattice and Kreweras lattice are three remarkable orders defined on the set of Catalan objects of a given size. These lattices are ordered by inclusion: the Stanley lattice is an extension of the Tamari lattice…

Combinatorics · Mathematics 2009-06-18 Olivier Bernardi , Nicolas Bonichon

We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…

Logic in Computer Science · Computer Science 2017-01-12 Noam Zeilberger

The Jacobian group ${\rm Jac}(G)$ of a finite graph $G$ is a group whose cardinality is the number of spanning trees of $G$. $G$ also has a tropical Jacobian which has the structure of a real torus; using the notion of break divisors, An et…

Combinatorics · Mathematics 2017-06-29 Chi Ho Yuen

We construct an explicit bijection between bipartite pointed maps of an arbitrary surface $\mathbb{S}$, and specific unicellular blossoming maps of the same surface. Our bijection gives access to the degrees of all the faces, and distances…

Combinatorics · Mathematics 2022-08-02 Maciej Dołęga , Mathias Lepoutre

We present a bijection between some quadrangular dissections of an hexagon and unrooted binary trees, with interesting consequences for enumeration, mesh compression and graph sampling. Our bijection yields an efficient uniform random…

Combinatorics · Mathematics 2008-10-21 Eric Fusy , Dominique Poulalhon , Gilles Schaeffer

We consider a Tamari interval of size $n$ (i.e., a pair of Dyck paths which are comparable for the Tamari relation) chosen uniformly at random. We show that the height of a uniformly chosen vertex on the upper or lower path scales as…

Combinatorics · Mathematics 2024-03-28 Guillaume Chapuy

A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…

Combinatorics · Mathematics 2023-04-13 Alexander E. Black , Kevin Liu , Alex Mcdonough , Garrett Nelson , Michael C. Wigal , Mei Yin , Youngho Yoo

We introduce new objects, the interval-posets, that encode intervals of the Tamari lattice. We then find a combinatorial interpretation of the bilinear form that appears in the functional equation of Tamari intervals described by Chapoton.…

Combinatorics · Mathematics 2012-12-05 Viviane Pons , Gregory Chatel

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 introduce new combinatorial objects, the interval- posets, that encode intervals of the Tamari lattice. We then find a combinatorial interpretation of the bilinear operator that appears in the functional equation of Tamari intervals…

Combinatorics · Mathematics 2015-02-27 Viviane Pons , Grégory Chatel

We obtain a very simple formula for the generating function of bipartite (resp. quasi-bipartite) planar maps with boundaries (holes) of prescribed lengths, which generalizes certain expressions obtained by Eynard in a book to appear. The…

Combinatorics · Mathematics 2014-03-18 Gwendal Collet , Eric Fusy