Related papers: On Graphs, Groups and Geometry

In this paper we shall be looking at several results relating Schur rings to sufficient conditions for a graph to be a graphical regular representation (GRR) of a finite group, and then applying these specifically in the case of certain…

For any metric $d$ on $\mathbb{R}^2$, an ($\mathbb{R}^2,d$)-geometric graph is a graph whose vertices are points in $\mathbb{R}^2$, and two vertices are adjacent if and only if their distance is at most 1. If $d=\|.\|_{\infty}$, the metric…

Four geometric conditions on a geodesic metric space, which are stronger variants of classical conditions characterizing hyperbolicity, are proved to be equivalent. In the particular case of the Cayley graph of a finitely generated group,…

Let $X=GD$ be a group, where $G$ is a nonabelian simple group and $D$ is a dihedral group. These groups $X$ are closely related to regular Cayley maps. The main theorems of this paper describes $X$.

In this paper we extend the classical notion of digraphical and graphical regular representation of a group and we classify, by means of an explicit description, the finite groups satisfying this generalization. A graph or digraph is called…

For a path-connected metric space $(X,d)$, the $n$-th homotopy group $\pi_n(X)$ inherits a natural pseudometric from the $n$-th iterated loop space with the uniform metric. This pseudometric gives $\pi_n(X)$ the structure of a topological…

In this note we study the dynamics of the natural evaluation action of the group of isometries $G$ of a locally compact metric space $(X,d)$ with one end. Using the notion of pseudo-components introduced by S. Gao and A. S. Kechris we show…

In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…

Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…

For groups $G$ that can be generated by an involution and an element of odd prime order, this paper gives a sufficient condition for a certain Cayley graph of $G$ to be a graphical regular representation (GRR), that is, for the Cayley graph…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

In this paper, we define a natural metric on Aut(X*) and prove that the closure of the adding machine group, a subgroup of the automorphism group, is both isometric and isomorphic to the group of p-adic integers. So, we show that the group…

A finite group R is a CI-group if, whenever S and T are subsets of R with the Cayley graphs Cay(R,S) and Cay(R,T) isomorphic, there exists an automorphism x of R with S^x=T. The classification of CI-groups is an open problem in the theory…

A group, defined as set with associative multiplication and inverse, is a natural structure describing the symmetry of a space. The concept of group generalizes to group objects internal to other categories than sets. But there are yet more…

We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

We say that a group G is a cube group if it is generated by a set S of involutions such that the corresponding Cayley graph Cay(G,S) is isomorphic to a cube. Equivalently, G is a cube group if it acts on a cube such that the action is…

We consider groups defined by non-empty balanced presentations with the property that each relator is of the form R(x,y), where x and y are distinct generators and R(.,.) is determined by some fixed cyclically reduced word R(a,b) that…

In this paper we study the elementary theory of graph products of groups and show that under natural conditions on the vertex groups we can recover (the core of) the underlying graph and the associated vertex groups. More precisely, we…

A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite families of finite groups that do not admit GRRs : abelian…