Related papers: Rhomboidal C4C8 toris which are Cayley graphs
We study the class of 1-perfectly orientable graphs, that is, graphs having an orientation in which every out-neighborhood induces a tournament. 1-perfectly orientable graphs form a common generalization of chordal graphs and circular arc…
In this paper we calculate fundamental groups (and some of their quotients) of complements of four toric varieties branch curves. For these calculations, we study properties and degenerations of these toric varieties and the braid…
In this paper, we investigate structural properties of the Cayley graph of a quandle and describe this graph for several important classes of quandles, including conjugation, Takasaki, dihedral, and Alexander quandles. In particular, we…
I describe the \emph{Chiral rings} $R_{3,4}$ for $3$D, $N=4$ supersymmetric $G$-gauge theory and matter fields in quaternionic representations $E$: first, by a topological tweak of the construction of arxiv:1601.03586, and second, more…
Following an idea of Dadok, Harvey and Lawson, we apply the triality property of SO(8) to study the comass of certain self-dual 4-forms on R^8. In particular, we prove that the Cayley 4-form has comass 1 and that any self-dual 4-form…
In this work, we explore edge direction, transitivity, and connectedness of Cayley graphs of gyrogroups. More specifically, we find conditions for a Cayley graph of a gyrogroup to be undirected, transitive, and connected. We also show a…
A graph is said to be {\em vertex-transitive non-Cayley} if its full automorphism group acts transitively on its vertices and contains no subgroups acting regularly on its vertices. In this paper, a complete classification of cubic…
Peres/Mermin arguments about no-hidden variables in quantum mechanics are used for displaying a pair (R, S) of entangling Clifford quantum gates, acting on two qubits. From them, a natural unitary representation of Coxeter/Weyl groups W(D5)…
Let $S$ be a subset of the cyclic group $\Z_n$. The cyclic Haar graph $H(\Z_n,S)$ is the bipartite graph with color classes $\Z_n^+$ and $\Z_n^-,$ and edges $\{x^+,y^-\},$ where $x,y \in \Z_n$ and $y - x \in S$. In this paper we give…
Ribbon tangles are proper embeddings of tori and cylinders in the $4$-ball~$B^4$, "bounding" $3$-manifolds with only ribbon disks as singularities. We construct an Alexander invariant $\mathsf{A}$ of ribbon tangles equipped with a…
We prove that every vertex transitive, planar, 1-ended, graph covers every graph whose balls of radius r are isomorphic to the ball of radius r in G for a sufficiently large r. We ask whether this is a general property of finitely presented…
It is known that the Levi graph of any rank two coset geometry is an edge-transitive graph, and thus coset geometries can be used to construct many edge transitive graphs. In this paper, we consider the reverse direction. Starting from…
In this paper, we discuss optimal $1$-toroidal graphs (abbreviated as O1TG), which are drawn on the torus so that every edge crosses another edge at most once, and has $n$ vertices and exactly $4n$ edges. We first consider connectivity of…
The chordal ring (CR) graphs are a well-known family of graphs used to model some interconnection networks for computer systems in which all nodes are in a cycle. Generalizing the CR graphs, in this paper, we introduce the families of…
The notion of a quaternionic gerbe is presented as a new way of bundling algebraic structures over a four manifold. The structure groupoid of this fibration is described in some detail. The Euclidean conformal group R*SO(4) appears…
A toric arrangement is a finite set of hypersurfaces in a complex torus, every hypersurface being the kernel of a character. In the present paper we build a CW-complex homotopy equivalent to the arrangement complement, with a combinatorial…
This paper investigates the symplectic and contact topology associated to circular spherical divisors. We classify, up to toric equivalence, all concave circular spherical divisors $ D $ that can be embedded symplectically into a closed…
In this paper, all finite groups whose commuting (non-commuting) graphs can be embed on the plane, torus or projective plane are classified.
Rectangular diagrams of links are link diagrams in the plane ${\mathbb R}^2$ such that they are composed of vertical line segments and horizontal line segments and vertical segments go over horizontal segments at all crossings. P. R.…
We show that there exist efficient algorithms for the triangle packing problem in colored permutation graphs, complete multipartite graphs, distance-hereditary graphs, k-modular permutation graphs and complements of k-partite graphs (when k…