English
Related papers

Related papers: Blossoming bijection for higher-genus maps

200 papers

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

In a recent preprint, Gullerud and Walker [2] proved a theorem and made a conjecture about the correctness of efficiently generating B\'ezout trees for Pythagorean pairs. In this note, we give a simple proof of their theorem, confirm that…

Number Theory · Mathematics 2018-04-03 Cherng-tiao Perng , Maila Brucal-Hallare

Goulden and Jackson (1996) introduced, using Jack symmetric functions, some multivariate generating series $\psi(x, y, z; 1, 1+\beta)$ with an additional parameter $\beta$ that may be interpreted as a continuous deformation of the rooted…

Combinatorics · Mathematics 2017-08-14 Maciej Dołęga

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 show that any multiplicative bijection between the algebras of differentiable functions, defined on differentiable manifolds of positive dimension, is an algebra isomorphism, given by composition with a unique diffeomorphism.

Differential Geometry · Mathematics 2011-11-09 J. Mrcun , P. Semrl

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

Combinatorics · Mathematics 2012-01-13 Edinah K. Gnang , Chetan Tonde

We present a bijection from planar reduced trees to planar rooted hypertrees, which extends Knuth's rotation correspondence between planar binary trees and planar rooted trees. The operadic counterpart of the new bijection is explained.…

Combinatorics · Mathematics 2019-04-09 Kurusch Ebrahimi-Fard , Dominique Manchon

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

We show that the Chow covectors of a linkage matching field define a bijection between certain degree vectors and lattice points, and we demonstrate how one can recover the linkage matching field from this bijection. This resolves two open…

Combinatorics · Mathematics 2020-06-18 Georg Loho , Ben Smith

We study random bipartite planar maps defined by assigning nonnegative weights to each face of a map. We prove that for certain choices of weights a unique large face, having degree proportional to the total number of edges in the maps,…

Probability · Mathematics 2015-06-05 Svante Janson , Sigurdur Örn Stefánsson

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

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

We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting…

Combinatorics · Mathematics 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

We introduce and study the notion of a locally proper map between topological spaces. We show that fundamental constructions of sheaf theory, more precisely proper base change, projection formula, and Verdier duality, can be extended from…

Algebraic Topology · Mathematics 2014-11-06 Olaf M. Schnürer , Wolfgang Soergel

When can a map between manifolds be deformed away from itself? We describe a (normal bordism) obstruction which is often computable and in general much stronger than the classical primary obstruction in cohomology. In particular, it answers…

Algebraic Topology · Mathematics 2007-05-23 Ulrich Koschorke

Recently, a tree bijection has been found for planar hyperbolic surfaces, which allows for an easy computation of the Weil--Petersson volumes, and opens the path to get distance statistic on random hyperbolic surfaces and to find scaling…

Geometric Topology · Mathematics 2025-12-12 Bart Zonneveld

Motivated by the Poisson Dixmier-Moeglin equivalence problem, a systematic study of commutative unitary rings equipped with a {\em biderivation}, namely a binary operation that is a derivation in each argument, is here begun, with an eye…

Commutative Algebra · Mathematics 2021-11-08 Omar Leon Sanchez , Rahim Moosa

We prove that isomorphism classes of principal bundles over a diffeological space are in bijection to certain maps on its free loop space, both in a setup with and without connections on the bundles. The maps on the loop space are smooth…

Differential Geometry · Mathematics 2013-03-21 Konrad Waldorf

We survey the theory and applications of mating-of-trees bijections for random planar maps and their continuum analog: the mating-of-trees theorem of Duplantier, Miller, and Sheffield (2014). The latter theorem gives an encoding of a…

Probability · Mathematics 2023-02-16 Ewain Gwynne , Nina Holden , Xin Sun

For every integer $g$, isomorphism of graphs of Euler genus at most $g$ can be decided in linear time. This improves previously known algorithms whose time complexity is $n^{O(g)}$ (shown in early 1980's), and in fact, this is the first…

Data Structures and Algorithms · Computer Science 2015-11-10 Ken-ichi Kawarabayashi
‹ Prev 1 4 5 6 7 8 10 Next ›