Related papers: Last Car Decomposition of Planar Maps
For some $k \in \mathbb{Z}_{\geq 0}\cup \infty$, we call a linear forest $k$-bounded if each of its components has at most $k$ edges. We will say a $(k,\ell)$-bounded linear forest decomposition of a graph $G$ is a partition of $E(G)$ into…
We provide the first solution to the problem of counting rooted 3-connected bipartite planar maps. Our starting point is the enumeration of bicoloured planar maps according to the number of edges and monochromatic edges, following Bernardi…
We propose a novel approach for studying rooted trees by using functions that we will call descent functions. We provide a construction method for rooted trees that allows to study their properties through the use of descent functions.…
We use orbifold structures to deduce degeneracy statements for holomorphic maps into logarithmic surfaces. We improve former results in the smooth case and generalize them to singular pairs. In particular, we give applications on nodal…
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…
The term fractal describes a class of complex structures exhibiting self-similarity across different scales. Fractal patterns can be created by using various techniques such as finite subdivision rules and iterated function systems. In this…
A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…
Linked-twist maps are area-preserving, piece-wise diffeomorphisms, defined on a subset of the torus. They are non-uniformly hyperbolic generalisations of the well-known Arnold Cat Map. We show that a class of canonical examples have…
In this work, we give a decomposition of a martingale into three martingales with applications to certain types of inequalities in the new theory of Stochastic Analysis in Vector Lattices
We study analogues of Cartan decompositions of Lie groups for totally disconnected locally compact groups. It is shown using these decompositions that a large class of totally disconnected locally compact groups acting on trees and…
Several min-max relations in graph theory can be expressed in the framework of the Erd\H{o}s-P\'osa property. Typically, this property reveals a connection between packing and covering problems on graphs. We describe some recent techniques…
In this paper the chordal graph structures of polynomial sets appearing in triangular decomposition in top-down style are studied when the input polynomial set to decompose has a chordal associated graph. In particular, we prove that the…
When using Traizet's regeneration technique to construct minimal surfaces, the simplest nontrivial configurations are given as the roots of polynomials that satisfy a hypergeometric differential equation. We exhibit examples of simple…
We study the displacement map associated to small one-parameter polynomial unfoldings of polynomial Hamiltonian vector fields on the plane. Its leading term, the generating function $M(t)$, has an analytic continuation in the complex plane…
In this paper, we survey recent works on the structure of the mapping class groups of surfaces mainly from the point of view of topology. We then discuss several possible directions for future research. These include the relation between…
We propose an algorithm generating planar networks which structure resembles a hierarchical structure of desiccation crack patterns.
Our main result is an explicit operator-theoretic formula for the number of colored planar maps with a fixed set of stars each of which has a fixed set of half-edges with fixed coloration. The formula bounds the number of such colored…
The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.
We introduce a novel technique to generate Benders' cuts from a conic relaxation ("corner") derived from a basis of a higher-dimensional polyhedron that we aim to outer approximate in a lower-dimensional space. To generate facet-defining…
\noindent In \cite{Casas} Casas-Alvero found decompositions of higher order polars of an irreducible plane curve generalizing the results of Merle. We improve his result giving a finer decomposition where we determine the topological type…