Related papers: Generating maps on surfaces
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…
Using digital topology approach, we construct digital models of closed surfaces as the intersection graphs of LCL covers of the surfaces. It is proved that digital models of closed surfaces are digital 2-dimensional surfaces preserving the…
Toeplitz's Square Peg Problem asks whether every continuous simple closed curve in the plane contains the four vertices of a square. It has been proved for various classes of sufficiently smooth curves, some of which are dense, none of…
We consider embeddings of planar graphs in $R^2$ where vertices map to points and edges map to polylines. We refer to such an embedding as a polyline drawing, and ask how few bends are required to form such a drawing for an arbitrary planar…
We study analytic surfaces in 3-dimensional Euclidean space containing two circular arcs through each point. The problem of finding such surfaces traces back to the works of Darboux from XIXth century. We reduce finding all such surfaces to…
We study the shape of inflated surfaces introduced in \cite{B1} and \cite{P1}. More precisely, we analyze profiles of surfaces obtained by inflating a convex polyhedron, or more generally an almost everywhere flat surface, with a symmetry…
A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…
We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…
A new method is proposed to divide a spherical surface into equal-area cells. The method is based on dividing a sphere into several latitudinal bands of near-constant span with further division of each band into equal-area cells. It is…
We consider systems of simple closed curves on surfaces and their total number of intersection points, their so-called crossing number. For a fixed number of curves, we aim to minimise the crossing number. We determine the minimal crossing…
We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…
We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…
Ribbon graphs embedded on a Riemann surface provide a useful way to describe the double line Feynman diagrams of large N computations and a variety of other QFT correlator and scattering amplitude calculations, e.g in MHV rules for…
We define two transforms between minimal surfaces with non-circular ellipse of curvature in the 5-sphere, and show how this enables us to construct, from one such surface, a sequence of such surfaces. We also use the transforms to show how…
An embedding of a graph on a translation surface is said to be \emph{systolic} if each vertex of the graph corresponds to a singular point (or marked point) and each edge corresponds to a shortest saddle connection on the translation…
We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…
Work of Glover and Huneke shows that a cubic graph embeds into the real projective plane if and only if it does not contain one of six topological minors called cubic projective plane obstructions. Here we classify up to equivalence the…
A quadrangulation is a graph embedded on the sphere such that each face is bounded by a walk of length 4, parallel edges allowed. All quadrangulations can be generated by a sequence of graph operations called vertex splitting, starting from…
Those maps of a closed surface to the three-dimensional torus that are homotopic to embeddings are characterized. Particular attention is paid to the somewhat intricate case when the surface is nonorientable.
In classical differential geometry, a central question has been whether abstract surfaces with given geometric features can be realized as surfaces in Euclidean space. Inspired by the rich theory of embedded triply periodic minimal…