Related papers: Cross-wired lamplighter groups and linearity of au…
Let G be a group and DS(G) = { H'| H is any subgroup of G}. G is said to be a DC-group if DS(G) is a chain. In this paper, we prove that a finite DC-group is a semidirect product of a Sylow p-subgroup and an abelian p'-subgroup. For the…
A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that its automorphism group ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple…
Antonenko and Russyev independently have shown that any Mealy automaton with no cycles with exit--that is, where every cycle in the underlying directed graph is a sink component--generates a fi- nite (semi)group, regardless of the choice of…
Clifford quantum cellular automata (CQCAs) are a special kind of quantum cellular automata (QCAs) that incorporate Clifford group operations for the time evolution. Despite being classically simulable, they can be used as basic building…
Given an action of a finite group on a triangulated category, we investigate under which conditions one can construct a linearised triangulated category using DG-enhancements. In particular, if the group is a finite group of automorphisms…
We study the representations of non-commutative universal lattices and use them to compute lower bounds for the \TauC for the commutative universal lattices $G_{d,k}= \SL_d(\Z[x_1,...,x_k])$ with respect to several generating sets. As an…
We present new infinite families of expander graphs of vertex degree 4, which is the minimal possible degree for Cayley graph expanders. Our first family defines a tower of coverings (with covering indices equals 2) and our second family is…
Bartholdi, Neuhauser and Woess proved that a family of metabelian groups including lamplighters have a striking geometric manifestation as 1-skeleta of horocyclic products of trees. The purpose of this article is to give an elementary…
We study linear and hermitian representations of finite $C_2$-graded groups. We prove that the category of linear representations is equivalent to a category of antilinear representations as an $\infty$-category. We also prove that the…
We show that certain lamplighter groups that are quasi-isometric to each other are not bilipschitz equivalent. This gives a positive answer to a question in Topics in Geometric Group Theory by Pierre de la Harpe (page 107).
We study Hamilton circuits of the Cayley graphs of the Weyl groupoids of the generalized quantum groups, or the quantum double of the Nichols algebras of diagonal-type, with finite root systems. We prove the existence of a Hamilton circuit…
We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.
We introduce a class of automorphisms of rooted $d$-regular trees arising from affine actions on their boundaries viewed as infinite dimensional vector spaces. This class includes, in particular, many examples of self-similar realizations…
We study finite groups arising from configurations of pairwise skew lines in $\mathbb{P}^3_K$. To such a configuration ${L}$ one associates a group $G_{L}\subset \mathrm{PGL}_2(K)$ acting on each line, and we investigate which finite…
While one-dimensional cellular automata have been well studied, there are relatively few results about multidimensional cellular automata; the investigation of cellular automata defined on Cayley trees constitutes an intermediate class.…
In this paper we address the problem of quantitative classification of Cayley automatic groups in terms of a certain numerical characteristic which we earlier introduced for this class of groups. For this numerical characteristic we…
We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…
The simplest example of an infinite Burnside group arises in the class of automaton groups. However there is no known example of such a group generated by a reversible Mealy automaton. It has been proved that, for a connected automaton of…
In this paper, we study a family of finitely generated elementary amenable iet-groups. These groups are generated by finitely many rationals iets and rotations. For them, we state criteria for not virtual nilpotency or solvability, and we…
We study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which represents a tape filled with symbols and a head carrying a state. These homeomorphisms can only…