English
Related papers

Related papers: Bijection between oriented maps and weighted non-o…

200 papers

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 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

A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is a topological disk. In this paper we present a bijective link between unicellular maps on a non-orientable surface and…

Combinatorics · Mathematics 2012-04-20 Olivier Bernardi , Guillaume Chapuy

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 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

Jack characters provide dual information about Jack symmetric functions. We give explicit formulas for the top-degree part of these Jack characters in terms of bicolored oriented maps with an arbitrary face structure.

Combinatorics · Mathematics 2017-09-11 Agnieszka Czyżewska-Jankowska , Piotr Śniady

The enumeration of maps and the study of uniform random maps have been classical topics of combinatorics and statistical physics ever since the seminal work of Tutte in the sixties. Following the bijective approach initiated by Cori and…

Combinatorics · Mathematics 2010-06-29 Guillaume Chapuy , Michel Marcus , Gilles Schaeffer

This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific "transversal structures" on triangulations of the 4-gon with no separating 3-cycle, which are…

Combinatorics · Mathematics 2009-03-20 Eric Fusy

We give a different presentation of a recent bijection due to Chapuy and Dol\k{e}ga for nonorientable bipartite quadrangulations and we extend it to the case of nonorientable general maps. This can be seen as a Bouttier--Di…

Combinatorics · Mathematics 2022-11-04 Jérémie Bettinelli

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

This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively…

Combinatorics · Mathematics 2012-06-13 Olivier Bernardi , Eric Fusy

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

This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of the map decorated with some dangling half-edges that enable to reconstruct its faces. Our…

Combinatorics · Mathematics 2015-07-27 Marie Albenque , Dominique Poulalhon

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

We characterize bijections on matrix spaces (operator algebras) preserving full rank (invertibility) of differences of matrix (operator) pairs in both directions.

Rings and Algebras · Mathematics 2024-02-05 Hans Havlicek , Peter Šemrl

Regular edge-colored graphs encode colored triangulations of pseudo-manifolds. Here we study families of edge-colored graphs built from a finite but arbitrary set of building blocks, which extend the notion of $p$-angulations to arbitrary…

Combinatorics · Mathematics 2018-08-29 Valentin Bonzom , Luca Lionni , Vincent Rivasseau

We relate general maps to bipartite maps through a bijection of type slit-slide-sew. We provide an involution on arbitrary genus maps with even degree faces. This enables a full interpretation of the relation between general and bipartite…

Combinatorics · Mathematics 2026-04-23 Jérémie Bettinelli , Dimitri Korkotashvili

Hypermaps were introduced as an algebraic tool for the representation of embeddings of graphs on an orientable surface. Recently a bijection was given between hypermaps and indecomposable permutations; this sheds new light on the subject by…

Combinatorics · Mathematics 2008-12-03 Robert Cori

Consider the collection of edge bicolorings of a graph that is cellularly embedded on an orientable surface. In this work, we count the number of equivalence classes of such colorings under two relations: reversing colors around a face and…

Geometric Topology · Mathematics 2018-02-13 Oliver T. Dasbach , Heather M. Russell

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

Combinatorics · Mathematics 2009-09-02 Dainis Zeps
‹ Prev 1 2 3 10 Next ›