Related papers: A bijection for essentially 3-connected toroidal m…

We study the birational maps of $\mathbb{P}^3_\mathbb{C}$. More precisely we describe the irreducible components of the set of birational maps of bidegree $(3,3)$ (resp. $(3,4)$, resp. $(3,5)$).

We present a new method to count unrooted maps on the sphere up to orientation-preserving homeomorphisms. The principle, called tree-decomposition, is to deform a map into an arborescent structure whose nodes are occupied by constrained…

We study canonical and pluricanonical maps of varieties isogenous to a product of curves, i.e., quotients of the form $X = (C_1 \times \dots \times C_n)/G$ with $g(C_i)\ge 2$ and $G$ acting freely. For this purpose, we provide a technical…

For an oriented matroid M, and given a generic single element extension and a generic single element lifting of M, the main result of [1] provides a bijection between bases of M and certain reorientations of M induced by the…

A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length…

In this paper we prove strong toroidalization of birational morphisms of 3-folds. Suppose that f:X\to Y is a birational morphism of nonsingular complete 3-folds, and D_Y, D_X are simple normal crossings divisors on Y and X such that…

We study the root polytope $\mathcal P_\Phi$ of a finite irreducible crystallographic root system $\Phi$ using its relation with the abelian ideals of a Borel subalgebra of a simple Lie algebra with root system $\Phi$. We determine the…

We prove that properly rescaled large planar Eulerian triangulations converge to the Brownian map. This result requires more than a standard application of the methods that have been used to obtain the convergence of other families of…

We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…

We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree…

Almost $4$-connectivity is a weakening of $4$-connectivity which allows for vertices of degree three. In this paper we prove the following theorem. Let $G$ be an almost $4$-connected triangle-free planar graph, and let $H$ be an almost…

Fold maps are smooth maps at each singular point of which it is represented as the product map of a Morse function and the identity map. Round fold maps are, in short, such maps the sets of all singular points of which are embedded…

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

We introduce the rotation unfolding of the folding map of a surface in $\mathbb{R}^3$, and investigate its $\mathcal{A}$-vesality. The rotation unfolding is a 2-parameter unfolding and can be considered as a subfamily of the folding family,…

A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…

To approximate a simple root of an equation we construct families of iterative maps of higher order of convergence. These maps are based on model functions which can be written as an inner product. The main family of maps discussed is…

We consider the problem of enumerating planar constellations with two points at a prescribed distance. Our approach relies on a combinatorial correspondence between this family of constellations and the simpler family of rooted…

We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links.…

The Hessian map is the rational map that sends a homogeneous polynomial to the determinant of its Hessian matrix. We prove that the Hessian map is birational on its image for ternary forms of degree $d\ge 4$, $d\neq 5$, by considering the…

Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…