English
Related papers

Related papers: Counting unicellular maps on non-orientable surfac…

200 papers

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 study large uniform random maps with one face whose genus grows linearly with the number of edges, which are a model of discrete hyperbolic geometry. In previous works, several hyperbolic geometric features have been investigated. In the…

Probability · Mathematics 2021-03-04 Svante Janson , Baptiste Louf

We study bifurcations of non-orientable area-preserving maps with quadratic homoclinic tangencies. We study the case when the maps are given on non-orientable two-dimensional surfaces. We consider one and two parameter general unfoldings…

Dynamical Systems · Mathematics 2015-06-23 Amadeu Delshams , Marina Gonchenko , Sergey V. Gonchenko

We study large uniform random maps with one face whose genus grows linearly with the number of edges. They can be seen as a model of discrete hyperbolic geometry. In the past, several of these hyperbolic geometric features have been…

Combinatorics · Mathematics 2021-02-26 Baptiste Louf

A longstanding avenue of research in orientable surface topology is to create and enumerate collections of curves in surfaces with certain intersection properties. We look for similar collections of curves in non-orientable surfaces. A…

Geometric Topology · Mathematics 2023-04-19 Sarah Ruth Nicholls , Nancy Scherich , Julia Shneidman

The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…

Mathematical Physics · Physics 2020-02-04 Elba Garcia-Failde

This manuscript recounts some of the author's contributions to algebraic and enumerative combinatorics. We have focused on two types of generalizations of bipartite maps, which are bipartite graphs embedded on surfaces. Maps are known to…

Combinatorics · Mathematics 2023-02-14 Valentin Bonzom

A unicellular collection on a surface is a collection of curves whose complement is a single disk. There is a natural surgery operation on unicellular collections, endowing the set of such with a graph structure where the edge relation is…

Geometric Topology · Mathematics 2023-08-21 Nick Salter , Abdoul Karim Sane

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

We consider the problem of counting and of listing topologically inequivalent "planar" {4-valent} maps with a single component and a given number n of vertices. This enables us to count and to tabulate immersions of a circle in a sphere…

Combinatorics · Mathematics 2016-08-19 Robert Coquereaux , Jean-Bernard Zuber

We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…

Combinatorics · Mathematics 2015-10-30 G. A. T. F da Costa , M. Policarpo

In algebraic topology, we usually represent surfaces by mean of cellular complexes. This representation is intrinsic, but requires to identify some points through an equivalence relation. On the other hand, embedding a surface in a…

Algebraic Topology · Mathematics 2024-08-28 Anthony Fraga

In this note, we examine how the BKP structure of the generating series of several models of maps on non-oriented surfaces can be used to obtain explicit and/or efficient recurrence formulas for their enumeration according to the genus and…

Combinatorics · Mathematics 2023-06-23 Valentin Bonzom , Guillaume Chapuy , Maciej Dołęga

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

Combinatorics · Mathematics 2019-09-27 Norman Do , Jian He , Daniel V. Mathews

Rotary maps (orientably regular maps) are highly symmetric graph embeddings on orientable surfaces. This paper classifies all rotary maps whose underlying graphs are Praeger-Xu graphs, denoted $\operatorname{C}(p,r,s)$, for any odd prime…

Combinatorics · Mathematics 2025-07-03 Zhaochen Ding , Zheng Guo , Luyi Liu

Bauer and Itzykson showed that associated to each labeled map embedded on an oriented Riemann surface there was a group generated by a pair of permutations. From this result an algorithm may be constructed for enumerating labeled maps, and…

Combinatorics · Mathematics 2007-05-23 Virgil U. Pierce

We propose a novel meshless method to compute harmonic maps and conformal maps for surfaces embedded in the Euclidean 3-space, using point cloud data only. Given a surface, or a point cloud approximation, we simply use the standard cubic…

Differential Geometry · Mathematics 2020-09-22 Tianqi Wu , Shing-Tung Yau

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…

Geometric Topology · Mathematics 2014-10-14 Ariadna Fossas , Hugo Parlier

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 article, we investigate short topological decompositions of non-orientable surfaces and provide algorithms to compute them. Our main result is a polynomial-time algorithm that for any graph embedded in a non-orientable surface…

Computational Geometry · Computer Science 2022-03-15 Niloufar Fuladi , Alfredo Hubard , Arnaud de Mesmay