Related papers: The Number of Complete Maps on Surfaces
Given a reflection group $G$ acting on a complex vector space $V$, a reflection map is the composition of an embedding $X \hookrightarrow V$ with the orbit map $V\to\mathbb C^p$ that maps a $G$-orbit to a point. Reflection maps can be very…
An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…
A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…
Graph embedding is a powerful method in parallel computing that maps a guest network $G$ into a host network $H$. The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion and the…
Following [6,12], we study coupled map networks over arbitrary finite graphs. An estimate from below for a topological entropy of a perturbed coupled map network via a topological entropy of an unperturbed network by making use of the…
We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…
We describe some theoretical results on triangulations of surfaces and we develop a theory on roots, decompositions and genus-surfaces. We apply this theory to describe an algorithm to list all triangulations of closed surfaces with at most…
It is known that graphs cellularly embedded into surfaces are equivalent to ribbon graphs. In this work, we generalize this statement to broader classes of graphs and surfaces. Half-edge graphs extend abstract graphs and are useful in…
This paper is about the geometry of flip-graphs associated to triangulations of surfaces. More precisely, we consider a topological surface with a privileged boundary curve and study the spaces of its triangulations with n vertices on the…
For each integer n, an n-folding curve is obtained by folding n times a strip of paper in two, possibly up or down, and unfolding it with right angles. Generalizing the usual notion of infinite folding curve, we define complete folding…
In this paper we introduce flat grafting as a deformation of quadratic differentials on a surface of finite type that is analogous to the grafting map on hyperbolic surfaces. Flat grafting maps are generic in the strata structure and…
We consider a one-dimensional family of rational surfaces with automorphisms. In a degeneration of this family, the limiting map is the identity map on a special fiber. We check that the map on the total space of the family has…
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their…
We consider translation surfaces with poles on surfaces. We shall prove that any finite group appears as the automorphism group of some translation surface with poles. As a direct consequence we obtain the existence of structures achieving…
An $n$-valued map is a set-valued continuous function $f$ such that $f(x)$ has cardinality $n$ for every $x$. Some $n$-valued maps will "split" into a union of $n$ single-valued maps. Characterizations of splittings has been a major theme…
There are several different extensions of the Tutte polynomial to graphs embedded in surfaces. To help frame the different options, here we consider the problem of extending the Tutte polynomial to cellularly embedded graphs starting from…
Simple drawings are drawings of graphs in which any two edges intersect at most once (either at a common endpoint or a proper crossing), and no edge intersects itself. We analyze several characteristics of simple drawings of complete…
A hypermap is an embedding of a connected hypergraph into an orientable closed surface. A covering between hypermaps is a homomorphism between the embedded hypergraphs which extends to an orientation-preserving covering of the supporting…
A map of a set to itself admits a representation by a graph with vertices being the elements of the set and an edge between every vertex and its image. Communities defined as the maximal connected components are uni-cyclic. The…
A branched covering map of surfaces induces a map in the opposite direction between their arc complexes. We represent a branched covering map combinatorially using what we call a lifting picture, and use this representation to computably…