English
Related papers

Related papers: Cross-wired lamplighter groups and linearity of au…

200 papers

For a restricted wreath product $G\wr \mathbb{Z}^k$, where $G$ is a finite abelian group, we determine (almost in all cases) whether this product has the $R_\infty$ property (i.e., each its automorphism has infinite Reidemeister number).

Group Theory · Mathematics 2023-05-23 Evgenij Troitsky

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…

Group Theory · Mathematics 2025-07-21 Corentin Bodart

We expound a concise construction of finite groups and groupoids whose Cayley graphs satisfy graded acyclicity requirements. Our acyclicity criteria concern cyclic patterns formed by coset-like configurations w.r.t. subsets of the generator…

Combinatorics · Mathematics 2024-02-16 Martin Otto

Let $\Gamma$ be a discrete group. Following Linnell and Schick one can define a continuous ring $c(\Gamma)$ associated with $\Gamma$. They proved that if the Atiyah Conjecture holds for a torsion-free group $\Gamma$, then $c(\Gamma)$ is a…

Rings and Algebras · Mathematics 2014-02-25 Gabor Elek

We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…

Combinatorics · Mathematics 2024-01-17 Martin Otto

A non-complete graph is \emph{$2$-distance-transitive} if, for $i=1,2$ and for any two vertex pairs $(u_1,v_1)$ and $(u_2,v_2)$ with the same distance $i$ in the graph, there exists an element of the graph automorphism group that maps…

Combinatorics · Mathematics 2025-04-29 Wei Jin , Pingshan Li , Li Tan

Suppose G is a nilpotent, finite group. We show that if {a,b} is any 2-element generating set of G, then the corresponding Cayley digraph Cay(G;a,b) has a hamiltonian path. This implies there is a hamiltonian path in every connected Cayley…

Combinatorics · Mathematics 2011-07-04 Dave Witte Morris

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.

Combinatorics · Mathematics 2017-03-21 Dave Witte Morris

We exhibit a family of infinite, finitely-presented, nilpotent-by-abelian groups. Each member of this family is a solvable S-arithmetic group that is related to Baumslag-Solitar groups, and everyone of these groups has a quasi-isometry…

Group Theory · Mathematics 2007-05-23 Kevin Wortman

In this paper, we initiate the study of palindromic automorphisms of groups that are free in some variety. More specifically, we define palindromic automorphisms of free nilpotent groups and show that the set of such automorphisms is a…

We consider linear groups which do not contain unipotent elements of infinite order, which includes all linear groups in positive characteristic, and show that this class of groups has good properties which resemble those held by groups of…

Group Theory · Mathematics 2018-11-04 J. O. Button

The existing algorithm to compute and verify the automata associated with an automatic group deals only with the subclass of shortlex automatic groups. This paper describes the extension of the algorithm to deal with automatic groups…

Group Theory · Mathematics 2008-02-03 Sarah Rees

Shephard groups are common generalizations of Coxeter groups, Artin groups, and graph products of cyclic groups. Their definition is similar to that of a Coxeter group, but generators may have arbitrary order rather than strictly order 2.…

Group Theory · Mathematics 2024-12-19 Katherine Goldman

Witte Morris showed in [21] that every connected Cayley graph of a finite (generalized) dihedral group has a Hamiltonian path. The infinite dihedral group is defined as the free product with amalgamation $\mathbb Z_2 \ast \mathbb Z_2$. We…

Combinatorics · Mathematics 2026-01-16 Babak Miraftab , Konstantinos Stavropoulos

Let $S$ be a set of transpositions such that the girth of the transposition graph of $S$ is at least 5. It is shown that the automorphism group of the Cayley graph of the permutation group $H$ generated by $S$ is the semidirect product…

Discrete Mathematics · Computer Science 2013-06-18 Ashwin Ganesan

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. This paper provides three basic structural results on the critical group of a line graph. The first deals with connected…

Combinatorics · Mathematics 2010-06-22 Andrew Berget , Andrew Manion , Molly Maxwell , Aaron Potechin , Victor Reiner

Given a finite group $H$ and a free group $F_n$, we prove that the wreath product $H\wr F_n$ admits a metrically proper, isometric action on a Hilbert space.

Group Theory · Mathematics 2007-11-10 Yves De Cornulier , Yves Stalder , Alain Valette

The aim of this short note is to revisit some old results about groups of intermediate growth and groups of the lamplighter type and to show that the Lamplighter group $L=\mathbb{Z}_2\wr \mathbb{Z}$ is a condensation group and has a minimal…

Group Theory · Mathematics 2014-05-08 Mustafa Gokhan Benli , Rostislav Grigorchuk

Following the research from the paper "Triangles, squares and geodesics" (arXiv:0910.5688) of Rena Levitt and Jon McCammond we investigate the properties of groups acting on CAT(0) triangle-square complexes, focusing mostly on…

Group Theory · Mathematics 2025-10-07 Mateusz Kandybo

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…

Group Theory · Mathematics 2026-05-14 Joseph Paul MacManus
‹ Prev 1 8 9 10 Next ›