Related papers: Transversals, plexes, and multiplexes in iterated …

From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs or graphs called multidimensional circulants, which turn out to be Cayley (di)graphs of Abelian groups. This paper is mainly devoted to show…

Hadwiger's theorem is a Helly-type theorem involving common transversals to families of convex sets instead of common intersections. Subsequently, Pollack and Wenger identified a necessary and sufficient condition, called a consistent…

A d-interval hypergraph has d disjoint copies of the unit interval as its vertex set, and each edge is the union of d subintervals, one on each copy. Extending a classical result of Gallai on the case d = 1, Tardos and Kaiser used…

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

We call complex quasifold of dimension k a space that is locally isomorphic to the quotient of an open subset of the space C^k by the holomorphic action of a discrete group; the analogue of a complex torus in this setting is called a…

We classify a quasiperiodic flow as either algebraic or transcendental. For an algebraic quasiperiodic flow on the n-torus, we prove that an absolute invariant of the smooth conjugacy class of this flow, known as the multiplier group, is 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…

Given an equilateral triangle with $a$ the square of its side length and a point in its plane with $b$, $c$, $d$ the squares of the distances from the point to the vertices of the triangle, it can be computed that $a$, $b$, $c$, $d$ satisfy…

We construct invariant quasimorphisms for groups acting on the circle. Furthermore, we provide a criterion for the non-extendablity of the resulting quasimorphisms and an explicit formula which relates the values of our quasimorphisms to…

Let $G$ be a finite group. It was remarked by Breuillard-Green-Guralnick-Tao that if the Cayley graph $C(G,S)$ is an expander graph and is non-bipartite then the spectrum of the adjacency operator $T$ is bounded away from $-1$. In this…

The diffraction pattern of a quasicrystal admits as symmetry group a finite group G, and there exists a G-cluster C (a union of orbits of G) such that the quasicrystal can be regarded as a quasiperiodic packing of copies of C, generally,…

Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…

Two non-discrete Hausdorff group topologies $\tau, \delta$ on a group $G$ are called {\it transversal} if the least upper bound $\tau\vee \delta$ of $\tau$ and $\delta$ is the discrete topology. In this paper, we discuss the existence of…

C-loops are loops satisfying the identity $x(y\cdot yz) = (xy\cdot y)z$. We develop the theory of extensions of C-loops, and characterize all nuclear extensions provided the nucleus is an abelian group. C-loops with central squares have…

Let $G$ be a finite group, $S\subseteq G\setminus\{1\}$ be a set such that if $a\in S$, then $a^{-1}\in S$, where $1$ denotes the identity element of $G$. The undirected Cayley graph $Cay(G,S)$ of $G$ over the set $S$ is the graph whose…

The unitary Cayley graph of $\mathbb Z/n\mathbb Z$, denoted $G_{\mathbb Z/n\mathbb Z}$, is the graph with vertices $0,1,\ldots,$ $n-1$ in which two vertices are adjacent if and only if their difference is relatively prime to $n$. These…

We generalize the classic definition of Delaunay triangulation and prove that for a locally finite and coarsely dense generic point set, $A \subseteq \mathbb{R}^d$, the $d$-simplices whose vertices belong to $A$ and whose circumscribed…

A regular cover of a connected graph is called {\em cyclic} or {\em dihedral} if its transformation group is cyclic or dihedral respectively, and {\em arc-transitive} (or {\em symmetric}) if the fibre-preserving automorphism subgroup acts…

For a positive integer $d$, a $d$-transversal set of a graph $G$ is an edge subset $T\subseteq E(G)$ such that $|T\cap M|\geq d$ for every maximum matching $M$ of $G$. The $d$-transversal number of $G$, denoted by $\tau_d(G)$, is the…

The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel…