Related papers: A bijection for triangulations, quadrangulations, …
A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is simply connected. In a famous article, Harer and Zagier established a formula for the generating function of unicellular…
The degree of a map between orientable manifolds is a fundamental concept in topology that aids in understanding the structure and properties of the manifolds and the maps between them. Numerous studies have been conducted on the degree of…
Building on Whitney's classical method of triangulating smooth manifolds, we show that every compact $d$-dimensional smooth manifold admits a triangulation with dual graph of twin-width at most $d^{O(d)}$. In particular, it follows that…
The spaces of triangulations of a given manifold have been widely studied. The celebrated theorem of Pachner~\cite{Pachner} says that any two triangulations of a given manifold can be connected by a sequence of bistellar moves, or Pachner…
Inspired by a question of Ferrari in the physics context of JT gravity, we introduce and enumerate a combinatorial family of quadrangulations of the disk, called rigid quadrangulations. These form a subclass of the flat quadrangulations in…
In this paper, we present two related results on curves of genus 3. The first gives a bijection between the classes of the following objects: * Smooth non-hyperelliptic curves C of genus 3, with a choice of an element a in Jac(C)[2]-{0},…
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…
We study straight-line drawings of planar graphs with prescribed face areas. A plane graph is 'area-universal' if for every area assignment on the inner faces, there exists a straight-line drawing realizing the prescribed areas. For…
We extend so-called slit-slide-sew bijections to constellations and quasiconstellations. We present an involution on the set of hypermaps given with an orientation, one distinguished corner, and one distinguished edge leading away from the…
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice…
A dichotomous ordinal graph consists of an undirected graph with a partition of the edges into short and long edges. A geometric realization of a dichotomous ordinal graph $G$ in a metric space $X$ is a drawing of $G$ in $X$ in which every…
A planar stuffed map is an embedding of a graph into the 2-sphere $S^{2}$, considered up to orientation-preserving homeomorphisms, such that the complement of the graph is a collection of disjoint topologically connected components that are…
We prove that a uniform rooted plane map with n edges converges in distribution after a suitable normalization to the Brownian map for the Gromov-Hausdorff topology. A recent bijection due to Ambj{\o}rn and Budd allows to derive this result…
A celebrated result of Alon from 1993 states that any $d$-regular graph on $n$ vertices (where $d=O(n^{1/9})$) has a bisection with at most $\frac{dn}{2}(\frac{1}{2}-\Omega(\frac{1}{\sqrt{d}}))$ edges, and this is optimal. Recently, this…
Ascent sequences were introduced by Bousquet-M\'elou, Claesson, Dukes and Kitaev, and are in bijection with unlabeled $(2+2)$-free posets, Fishburn matrices, permutations avoiding a bivincular pattern of length $3$, and Stoimenow matchings.…
We investigate the combinatorics of quivers that arise from triangulations of even-dimensional cyclic polytopes. Work of Oppermann and Thomas pinpoints such quivers as the prototypes for higher-dimensional cluster theory. We first show that…
We consider triangulations of closed surfaces in which every vertex is incident to exactly $d$ edges. These triangulations can be identified with subgroups of the triangle group $\langle a,b,c\mid a^2,b^2,c^2,(ab)^3,(ac)^2,(bc)^d\rangle$…
The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed…
Via circle pattern techniques, random planar triangulations (with angle variables) are mapped onto Delaunay triangulations in the complex plane. The uniform measure on triangulations is mapped onto a conformally invariant spatial point…
Three--dimensional colored triangulations are gluings of tetrahedra whose faces carry the colors 0, 1, 2, 3 and in which the attaching maps between tetrahedra are defined using the colors. This framework makes it possible to generalize the…