Related papers: Symmetric groups and checker triangulated surfaces
We study reflection-symmetric realisations of symmetric graphs in the plane that allow a continuous symmetry and edge-length preserving deformation. To do so, we identify a necessary combinatorial condition on graphs with…
We state and prove a corrected version of a theorem of Singerman, which relates the existence of symmetries (anticonformal involutions) of a quasiplatonic Riemann surface $\mathcal S$ (one uniformised by a normal subgroup $N$ of finite…
We prove a result that relates the number of homomorphisms from the fundamental group of a compact nonorientable surface to a finite group $G$, where conjugacy classes of the boundary components of the surface must map to prescribed…
We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…
We characterise which simplicial surfaces can be folded onto a triangle. We define a notion of folding that incorporates the non-intersection-properties of real materials. All of the surfaces foldable onto a triangle admit a…
We consider a large family of dynamical Belyi maps of arbitrary degree and study the arithmetic monodromy groups attached to the iterates of such maps. Building on the results of Bouw-Ejder-Karemaker on the geometric monodromy groups of…
In this paper we study some properties of Fibonacci-sum set-graphs. The aforesaid graphs are an extension of the notion of Fibonacci-sum graphs to the notion of set-graphs. The colouring of Fibonacci-sum graphs is also discussed. A number…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
We give a new proof of a theorem of D. Calegari that says that the Cayley graph of a surface group with respect to any generating set lying in finitely many mapping class group orbits has infinite diameter. This applies, for instance, to…
The aim of this work is to prove that the connected parts of Farey complex structure in plane are triangles or quadrangles. To do this work we go back to plane convex polygones with oriented edge for wich we prove that if two consecutive…
We construct a new family of trivalent expanders tessellating hyperbolic surfaces with large isometry groups. These graphs are obtained from a family of Cayley graphs of nilpotent groups via $(\Delta-Y)$-transformations. We compare this…
We present a detailed study of the combinatorial interpretation of matrix integrals, including the examples of tessellations of arbitrary genera, and loop models on random surfaces. After reviewing their methods of solution, we apply these…
We give a linear-time algorithm to decide 3-colorability (and find a 3-coloring, if it exists) of quadrangulations of a fixed surface. The algorithm also allows to prescribe the coloring for a bounded number of vertices.
Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…
A new parametric surface representation is proposed that interpolates the vertices of a given closed mesh of arbitrary topology. Smoothly connecting quadrilateral patches are created by blending local, multi-sided quadratic interpolants. In…
We point out an explicit connection between graphs drawn on compact Riemann surfaces defined over the field $\bar{\mathbb{Q}}$ of algebraic numbers --- so-called Grothendieck's {\it dessins d'enfants} --- and a wealth of distinguished…
A combinatorial map is a connected topological graph cellularly embedded in a surface. This monograph concentrates on the automorphism group of a map, which is related to the automorphism group of a Klein surface and a Smarandache manifold,…
This is a research monograph on constructions of and group actions on countable homogeneous graphs, concentrating particularly on the simple random graph and its edge-coloured variants. We study various aspects of the graphs, but the…
A survey of enumeration problems arising from the study of graphs formed when the edges of a polygon are marked with evenly spaced points and every pair of points is joined by a line. A few of these problems have been solved, a classical…
This paper grew out of an attempt to find a suitable finite sheeted covering of an aspherical 3-manifold so that the cover either has infinite or trivial first homology group. With this motivation we define a new class of groups. These…