Related papers: Symmetric groups and checker triangulated surfaces
A simple surface amalgam is the union of a finite collection of surfaces with precisely one boundary component each and which have their boundary curves identified. We prove if two fundamental groups of simple surface amalgams act properly…
The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and…
We obtain tilings with a singular point by applying conformal maps on regular tilings of the Euclidean plane, and determine its symmetries. The resulting tilings are then symmetrically colored by applying the same conformal maps on…
A spatial surface is a compact surface embedded in the 3-sphere. In this paper, we provide several typical examples of spatial surfaces and construct a coloring invariant to distinguish them. The coloring is defined by using a multiple…
A graph drawn in a surface is a near-quadrangulation if the sum of the lengths of the faces different from 4-faces is bounded by a fixed constant. We leverage duality between colorings and flows to design an efficient algorithm for…
We start by introducing the basics of configurations of points and lines, and then move into discussing symmetry groups of these configurations. Specifically, we explore how we might classify the symmetries of $(9_3)$ and $(10_3)$ geometric…
The ideal (tagged resp.) triangulation of bounded surface with marked points are associated with skew-symmetric (skew-symmetrizable) exchange matrices. An algo- rithm is established to decompose the graph associated to such matrix. There…
We consider colored variants of a class of geometric-combinatorial questions on $k$-gons and empty $k$-gons that have been started around 1935 by Erd\H{o}s and Szekeres. In our setting we have $n$ points in general position in the plane,…
Dessins d'enfants are combinatorial structures on compact Riemann surfaces defined over algebraic number fields, and regular dessins are the most symmetric of them. If G is a finite group, there are only finitely many regular dessins with…
Let F be a closed surface and i:F \to S^3 a generic immersions. Then S^3 - i(F) is a union of connected regions, which may be separated into two sets {U_j} and {V_j} by a checkerboard coloring. For k \geq 0, let a_k, b_k be the number of…
The intersection matrix of a finite simplicial complex has as each of its entries the rank of the intersection of its respective simplices. We prove that such matrix defines the triangulation of a closed connected surface up to isomorphism.
We investigate slicings of combinatorial manifolds as properly embedded co-dimension 1 submanifolds. A focus is given to dimension 3 where slicings are normal surfaces. In the case of 2-neighborly 3-manifolds and quadrangulated slicings, a…
Suppose that $nk$ points in general position in the plane are colored red and blue, with at least $n$ points of each color. We show that then there exist $n$ pairwise disjoint convex sets, each of them containing $k$ of the points, and each…
In this paper we introduce mixed coloured permutation, permutations with certain coloured cycles, and study the enumerative properties of these combinatorial objects. We derive the generating function, closed forms, recursions and…
We start discussing the group of automorphisms of the field of complex numbers, and describe, in the special case of polynomials with only two critical values, Grothendieck's program of 'Dessins d' enfants', aiming at giving representations…
A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…
We give a combinatorial description of closed curves on oriented surfaces in terms of certain permutations, called charts. We describe automorphisms of curves in terms of charts and compute the total number of curves counted with…
A triangulation of a polygon is a subdivision of it into triangles, using diagonals between its vertices. Two different triangulations of a polygon can be related by a sequence of flips: a flip replaces a diagonal by the unique other…
As a vital link between group theory and graph theory, Cayley graphs provide a geometric framework for encoding algebraic structures. This study explores the properties of Cayley graphs derived from cyclic groups whose order is the square…
Given recipe of qualitative, kinetic modelling by geometric methods of three-dimensional dendritic crystals. Characteristic features of the perturbations appearing on the surface of a spherical body, leading to different scenarios of the…