Related papers: Symmetric groups and checker triangulated surfaces
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
The paper is devoted to the study of combinatorial determinacy properties of a family of substitution complexes consisting of quadrilaterals glued side-to-side with each other. These properties are useful in constructing algebraic…
The paper investigates connections between abstract polytopes and properly edge colored graphs. Given any finite n-edge-colored n-regular graph G, we associate to G a simple abstract polytope P_G of rank n, called the colorful polytope of…
We consider a product of three copies of infinite symmetric group and its representations spherical with respect to the diagonal subgroup. We show that such representations generate functors from a certain category of simplicial…
We generalise surface cluster algebras to the case of infinite surfaces where the surface contains finitely many accumulation points of boundary marked points. To connect different triangulations of an infinite surface, we consider infinite…
Consider the collection of edge bicolorings of a graph that is cellularly embedded on an orientable surface. In this work, we count the number of equivalence classes of such colorings under two relations: reversing colors around a face and…
Gallai's colouring theorem states that if the edges of a complete graph are 3-coloured, with each colour class forming a connected (spanning) subgraph, then there is a triangle that has all 3 colours. What happens for more colours: if we…
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
Riemann's Existence Theorem gives the following bijections: (1) Isomorphism classes of Belyi maps of degree $d$. (2) Equivalence classes of generating systems of degree $d$. (3) Isomorphism classes of dessins d'enfants with $d$ edges. In…
Coloured graphical models are Gaussian statistical models determined by an undirected coloured graph. These models can be described by linear spaces of symmetric matrices. We outline a relationship between the symmetries of the graph and…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
We derive a bulk-boundary correspondence for three-dimensional (3D) symmetry-protected topological (SPT) phases with unitary symmetries. The correspondence consists of three equations that relate bulk properties of these phases to…
A triangle group is denoted by $\Delta(p,q,r)$ and has finite presentation $$ \Delta(p,q,r)=\langle x,y | x^p=y^q=(xy)^r=1 \rangle .$$ We examine a method for composition of permutation representations of a triangle group $\Delta(p,q,r)$…
Garoufalidis and Levine introduced the homology cobordism group of homology cylinders over a surface. This group can be regarded as a generalization of the mapping class group. Using torsion invariants, we show that the abelianization of…
The goal of this paper is to show the existence (using probabilistic tools) of configurations of lines, boxes, and points with certain interesting combinatorial properties. (i) First, we construct a family of $n$ lines in $\mathbb{R}^3$…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
Totally symmetric sets are a recently introduced tool for studying homomorphisms between groups. In this paper, we give full classifications of totally symmetric sets in certain families of groups and bound their sizes in others. As a…
We show that every open Riemann surface can be obtained by glueing together a countable collection of equilateral triangles, in such a way that every vertex belongs to finitely many triangles. Equivalently, it is a _Belyi surface_: There…
We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…