Related papers: On groups with Cayley graph isomorphic to a cube

Let $\mathcal G$ denote the space of finitely generated marked groups. For any finitely generated group $G$, we construct a continuous, injective map $f$ from the space of subgroups $Sub(G)$ to $\mathcal G$ that sends conjugate subgroups to…

We introduce a class of spaces, called real cubings, and study the stucture of groups acting nicely on these spaces. Just as cubings are a natural generalisation of simplicial trees, real cubings can be regarded as a natural generalisation…

Let $k$ be a field. We characterize the group schemes $G$ over $k$, not necessarily affine, such that $\mathsf{D}_{\mathrm{qc}}(B_kG)$ is compactly generated. We also describe the algebraic stacks that have finite cohomological dimension in…

We show that if G is any nilpotent, finite group, and the commutator subgroup of G is cyclic, then every connected Cayley graph on G has a hamiltonian cycle.

Given a group G, we construct, in a canonical way, an inverse semigroup S(G) associated to G. The actions of S(G) are shown to be in one-to-one correspondence with the partial actions of G, both in the case of actions on a set, and that of…

This paper proves the reconstruction conjecture for graphs which are isomorphic to the cube of a tree. The proof uses the reconstructibility of trees from their peripheral vertex deleted subgraphs. The main result follows from (i)…

Let G be a branch group (as defined by Grigorchuk) acting on a tree T. A parabolic subgroup P is the stabiliser of an infinite geodesic ray in T. We denote by $\rho_{G/P}$ the associated quasi-regular representation. If G is discrete, these…

In this paper we introduce a representation of knots and links called a cube diagram. We show that a property of a cube diagram is a link invariant if and only if the property is invariant under two types of cube diagram operations. A knot…

Given a finite group $G$ and a subset $S\subseteq G,$ the bi-Cayley graph $\bcay(G,S)$ is the graph whose vertex set is $G \times \{0,1\}$ and edge set is $\{\{(x,0),(s x,1)\} : x \in G, s\in S \}$. A bi-Cayley graph $\bcay(G,S)$ is called…

Each infinitesimally faithful representation of a reductive complex connected algebraic group $G$ induces a dominant morphism $\Phi$ from the group to its Lie algebra $\g$ by orthogonal projection in the endomorphism ring of the…

We prove that if the Cayley graph of a finitely generated group enjoys the property L_delta then the group is almost convex and has a sub-cubic isoperimetric function.

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

Suppose G is a finite group, such that |G| = 16p, where p is prime. We show that if S is any generating set of G, then there is a hamiltonian cycle in the corresponding Cayley graph Cay(G;S).

We show that if G is a finite group whose commutator subgroup [G,G] has order 2p, where p is an odd prime, then every connected Cayley graph on G has a hamiltonian cycle.

We describe a procedure which verifies that a group given by generators and relators is word-hyperbolic. This procedure always works with a group which is word-hyperbolic, provided there is sufficient memory and time devoted to the problem.…

We consider a finitely generated virtually abelian group $G$ acting properly and without inversions on a CAT(0) cube complex $X$. We prove that $G$ stabilizes a finite dimensional CAT(0) subcomplex $Y \subseteq X$ that is isometrically…

A class of groups is investigated, each of which has a fairly simple presentation . For example the group $R = (a, b, c, d | a^3 = b^3 = c^3 = d^3 = 1, ba^{-1} =dc^{-1}, ca^{-1} = db^{-1}) $ is in the class. Such a group does not have as a…

We introduce a new construction, the isotropy groupoid, to organize the orbit data for split $\Gamma$-spaces. We show that equivariant principal $G$-bundles over split $\Gamma$-CW complexes $X$ can be effectively classified by means of…

Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only…

A 2-group is a `categorified' version of a group, in which the underlying set G has been replaced by a category and the multiplication map m: G x G -> G has been replaced by a functor. A number of precise definitions of this notion have…