Related papers: Symmetric groups and checker triangulated surfaces
We show that the counting of observables and correlators for a 3-index tensor model are organized by the structure of a family of permutation centralizer algebras. These algebras are shown to be semi-simple and their Wedderburn-Artin…
A Bely\u{\i} pair is a holomorphic map from a Riemann surface to $S^2$ with additional properties. A dessin d'enfants is a bipartite graph with additional structure. It is well know that there is a bijection between Bely\u{i} pairs and…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
A closed hyperbolic surface of genus $g\ge 2$ can be decomposed into pairs of pants along shortest closed geodesics and if these curves are sufficiently short (and with lengths uniformly bounded away from 0), then the geometry of the…
We consider the polychromatic coloring problems for unions of two or more geometric hypergraphs on the same vertex sets of points in the plane. We show, inter alia, that the union of bottomless rectangles and horizontal strips does in…
A combinatorial Gray code for a class of objects is a listing that contains each object from the class exactly once such that any two consecutive objects in the list differ only by a `small change'. Such listings are known for many…
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…
Coverings of the Riemann sphere by itself, ramified over two points, are given by so-called Shabat polynomials. The correspondence between Grothendieck's dessins d'enfants and Belyi maps then implies a bijection between Shabat polynomials…
A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…
Mixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case in which such graphs are Cayley graphs of Abelian groups. These groups can be constructed by…
Transversal structures (also known as regular edge labelings) are combinatorial structures defined over 4-connected plane triangulations with quadrangular outer-face. They have been intensively studied and used for many applications…
This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…
A superdiagonal composition is one in which the $i$-th part or summand is of size greater than or equal to $i$. In this paper, we study the number of palindromic superdiagonal compositions and colored superdiagonal compositions. In…
Skeletal polyhedra and polygonal complexes are finite or infinite periodic structures in 3-space with interesting geometric, combinatorial, and algebraic properties. These structures can be viewed as finite or infinite periodic graphs…
We inductively define layers of colorings of knot and knotted surface diagrams using ternary quasigroups. Homological invariants from such systems of colorings use shorter differentials and of higher degree than the standard homology…
This paper is devoted to the study of particular geometrically defined intersection classes of graphs. Those were previously studied by Magnant and Martin, who proved that these graphs have arbitrary large chromatic number, while being…
A three-polar, cf. T. Gregor, J. Halu\v{s}ka, Lexicographical ordering and field operations in the complex plane. Stud. Mat. 41(2014), 123--133., $HSV-RGB$ Colour space $\triangle$ was introduced and studied. It was equipped with operations…
We extend Heawood's theorem on the colourability of plane triangulations to triangulations of 3-space. We prove that a triangulation of 3-space can be edge coloured with three colours if and only if all edges have even degree.
This expository paper explores the interaction of group ordering with topological questions, especially in dimensions 2 and 3. Among the topics considered are surfaces, braid groups, 3-manifolds and their structures such as foliations and…
The topology and symmetry group of a free boundary minimal surface in the three-dimensional Euclidean unit ball do not determine the surface uniquely. We provide pairs of non-isometric free boundary minimal surfaces having any sufficiently…