English
Related papers

Related papers: Bijections between planar maps and planar linear n…

200 papers

Generalizing results of Temperley, Brooks, Smith, Stone and Tutte and others we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This…

Combinatorics · Mathematics 2007-05-23 Richard Kenyon , Scott Sheffield

A unicellular map, or one-face map, is a graph embedded in an orientable surface such that its complement is a topological disk. In this paper, we give a new viewpoint to the structure of these objects, by describing a decomposition of any…

Combinatorics · Mathematics 2012-03-15 Guillaume Chapuy

We establish a general bijective framework for encoding faces of some classical hyperplane arrangements. Precisely, we consider hyperplane arrangements in $\mathbb{R}^n$ whose hyperplanes are all of the form $\{x_i-x_j=s\}$ for some…

Combinatorics · Mathematics 2025-03-04 Olivier Bernardi

In a recent paper by Kitaev and Remmel, several formulas for the number of words of length n avoiding some generalized patterns were established. Each time the obtained function of n had been found in Sloane's Encyclopedia as the number of…

Combinatorics · Mathematics 2009-11-03 Alexander Valyuzhenich

We extend the notion of an enumeration scheme developed by Zeilberger and Vatter to the case of vincular patterns (also called "generalized patterns" or "dashed patterns"). In particular we provide an algorithm which takes in as input a set…

Combinatorics · Mathematics 2012-01-17 Andrew M. Baxter , Lara K. Pudwell

In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions…

Combinatorics · Mathematics 2013-03-01 Stefan Forcey , Mohammadmehdi Kafashan , Mehdi Maleki , Michael Strayer

We find a family of planar bipartite graphs all of whose Lombardi drawings (drawings with circular arcs for edges, meeting at equal angles at the vertices) are nonplanar. We also find families of embedded series-parallel graphs and…

Computational Geometry · Computer Science 2021-12-10 David Eppstein

Matrix-valued covariance extension and multivariate spectral estimation are formulated as generalized moment problems in the "THREE" approach and its extensions. Under this context, we discuss Theorem 6 in \cite{Georgiou-06} concerning the…

Optimization and Control · Mathematics 2019-08-08 Bin Zhu

In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinations of resource lambda-terms, from a calculus similar to Boudol's…

Logic in Computer Science · Computer Science 2010-01-20 Thomas Ehrhard

Let $M$ be a regular matroid. The Jacobian group ${\rm Jac}(M)$ of $M$ is a finite abelian group whose cardinality is equal to the number of bases of $M$. This group generalizes the definition of the Jacobian group (also known as the…

Combinatorics · Mathematics 2019-12-11 Spencer Backman , Matthew Baker , Chi Ho Yuen

The L-intersection graphs are the graphs that have a representation as intersection graphs of axis parallel shapes in the plane. A subfamily of these graphs are {L, |, --}-contact graphs which are the contact graphs of axis parallel L, |,…

Computational Geometry · Computer Science 2017-07-31 Daniel Gonçalves , Lucas Isenmann , Claire Pennarun

We elucidate a bijection between ribbon graphs on the real projective plane and non-crossing annular pairings that relate to the $1/N$ correction term of the GOE and LOE spectral moments. We also derive analogous objects for the $1/N^2$…

Combinatorics · Mathematics 2025-10-28 Anas A. Rahman , Daniel Munoz George , James A. Mingo

We deal with the asymptotic enumeration of combinatorial structures on planar maps. Prominent instances of such problems are the enumeration of spanning trees, bipartite perfect matchings, and ice models. The notion of orientations with…

Combinatorics · Mathematics 2007-09-06 S. Felsner , F. Zickfeld

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

We introduce the notion of fully simple maps, which are maps with non self-intersecting disjoint boundaries. In contrast, maps where such a restriction is not imposed are called ordinary. We study in detail the combinatorics of fully simple…

Mathematical Physics · Physics 2023-07-07 Gaëtan Borot , Elba Garcia-Failde

In this short note, we first present a simple bijection between binary trees and colored ternary trees and then derive a new identity related to generalized Catalan numbers.

Combinatorics · Mathematics 2008-05-12 Yidong Sun

We introduce tabular algebras, which are simultaneous generalizations of cellular algebras (in the sense of Graham-Lehrer) and table algebras (in the sense of Arad-Blau). We show that if a tabular algebra is equipped with a certain kind of…

Quantum Algebra · Mathematics 2007-05-23 R. M. Green

We introduce a notion of bipartite minors and prove a bipartite analog of Wagner's theorem: a bipartite graph is planar if and only if it does not contain $K_{3,3}$ as a bipartite minor. Similarly, we provide a forbidden minor…

Combinatorics · Mathematics 2013-12-03 Maria Chudnovsky , Gil Kalai , Eran Nevo , Isabella Novik , Paul Seymour

Recently, B\'{e}nyi and the second author introduced two combinatorial interpretations for symmetrized poly-Bernoulli polynomials. In the present study, we construct bijections between these combinatorial objects. We also define various…

Combinatorics · Mathematics 2021-07-27 Minoru Hirose , Toshiki Matsusaka , Ryutaro Sekigawa , Hyuga Yoshizaki

We discuss conjectures on Hamiltonicity in cubic graphs (Tait, Barnette, Tutte), on the dichromatic number of planar oriented graphs (Neumann-Lara), and on even graphs in digraphs whose contraction is strongly connected (Hochst\"attler). We…

Combinatorics · Mathematics 2018-09-10 Kolja Knauer , Petru Valicov