Related papers: Symmetric groups and checker triangulated surfaces
Color symmetry is an extension of symmetry imposed by isometric transformations and means that the colors of geometrical objects are assigned according to the symmetry properties of the objects. A color symmetry permutes the coloring of the…
Esperet and Joret proved that planar graphs with bounded maximum degree are 3-colorable with bounded clustering. Liu and Wood asked whether the conclusion holds with the assumption of the bounded maximum degree replaced by assuming that no…
For suitable subgroups of a finitely generated group, we define the intersection number of one subgroup with another subgroup and show that this number is symmetric. We also give an interpretation of this number.
The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…
We explore geometric and topological properties of 3d surfaces swept by Poncelet triangles, as well as tangles formed by associated points.
We study the moduli space of euclidean structures with cone points on a surface, and describe a decomposition into cells each of which corresponds to a given combinatorial type of Delaunay tessellation. We use some of the ideas to study…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal…
Hyperplane arrangements form the geometric counterpart of combinatorial objects such as matroids. The shape of the sequence of Betti numbers of the complement of a hyperplane arrangement is of particular interest in combinatorics, where…
In this work, we try to enunciate the Total chromatic number of some Cayley graphs like the Cayley graph on Symmetric group, Alternating group, Dihedral group with respect to some generating sets and some other regular graphs.
Motivated by a new way of visualizing hypergraphs, we study the following problem. Consider a rectangular grid and a set of colors $\chi$. Each cell $s$ in the grid is assigned a subset of colors $\chi_s \subseteq \chi$ and should be…
Group theory involves the study of symmetry, and its inherent beauty gives it the potential to be one of the most accessible and enjoyable areas of mathematics, for students and non-mathematicians alike. Unfortunately, many students never…
We investigate representations of mapping class groups of surfaces that arise from the untwisted Drinfeld double of a finite group G, focusing on surfaces without marked points or with one marked point. We obtain concrete descriptions of…
The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…
In this paper, we investigate the structure of associated groups of symmetric quandles. Among other results, we explore the relationship between the associated group of a symmetric quandle and that of its underlying quandle. We provide a…
We study singularities of constant positive Gaussian curvature surfaces and determine the way they bifurcate in generic 1-parameter families of such surfaces. We construct the bifurcations explicitly using loop group methods. Constant…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
Circular coloring is a constraints satisfaction problem where colors are assigned to nodes in a graph in such a way that every pair of connected nodes has two consecutive colors (the first color being consecutive to the last). We study…
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
Two colourings of a graph are orthogonal if they have the property that when two vertices are coloured with the same colour in one colouring, then those vertices receive distinct colours in the other colouring. In this paper, orthogonal…