Related papers: Power commutator groups
The power graph of an arbitrary group $G$ is a simple graph with all elements of $G$ as its vertices and two vertices are adjacent if one is a positive power of another. In this paper, we generalize this concept to a graph whose vertices…
We use polyhedral product models to analyse the structure of the commutator subgroup of a right-angled Artin group. In particular, we provide a minimal set of generators for the commutator subgroup, consisting of special iterated…
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
In the paper we study irreducible representations of some nilpotent groups of finite abelian total rank. The main result of the paper states that if a torsion-free minimax group $G$ of nilpotency class 2 admits a faithful irreducible…
We introduce a linearly ordered lattice $\mu(Grp)$ of torsion theories in simplicial groups. The torsion theories are defined where the torsion/torsion-free subcategories are given by the simplicial groups with bounded above/below Moore…
The goal of this note is to provide yet another proof of the following theorem of Golod: there exists an infinite finitely generated group $G$ such that every element of $G$ has finite order. Our proof is based on the Nielsen-Schreier index…
We construct finitely generated simple torsion-free groups with strong homological control. Our main result is that every subset of $\mathbb{N} \cup \{\infty\}$, with some obvious exceptions, can be realized as the set of dimensions of…
We show that every Grigorchuk group $G_\omega$ embeds in (the commutator subgroup of) the topological full group of a minimal subshift. In particular, the topological full group of a Cantor minimal system can have subgroups of intermediate…
The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…
The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple graph with vertex set $G$ and two distinct vertices are adjacent if one of them is a power of the other. Let $n=p_1^{n_1}p_2^{n_2}\cdots p_r^{n_r},$ where…
Operators acting on the discrete random chaos yield signed multiplicative systems, extending the notion of spin matrices and quaternions. We investigate signed groups through the associated sign matrices, focusing on generators and their…
We define ``star reducible'' Coxeter groups to be those Coxeter groups for which every fully commutative element (in the sense of Stembridge) is equivalent to a product of commuting generators by a sequence of length-decreasing star…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
We consider the class $\mathcal{R}$ of finitely generated toral relatively hyperbolic groups. We show that groups from $\mathcal{R}$ are commutative transitive and generalize a theorem proved by Benjamin Baumslag to this class. We also…
We prove that any non-cocompact irreducible lattice in a higher rank semi-simple Lie group contains a subgroup of finite index, which has three generators.
The power graph $\mathcal{P}(G)$ of a finite group $G$ is the graph whose vertex set is $G$, and two elements in $G$ are adjacent if one of them is a power of the other. The purpose of this paper is twofold. First, we find the complexity of…
We construct irreducible unitary representations of a finitely generated free group which are weakly contained in the left regular representation and in which a given linear combination of the generators has an eigenvalue. When the…
We prove that every right-angled Coxeter group (RACG) is profinitely rigid amongst all Coxeter groups. On the other hand we exhibit RACGs which have infinite profinite genus amongst all finitely generated residually finite groups. We also…
Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…
We construct and study polyhedral product models for classifying spaces of right-angled Artin and Coxeter groups, general graph product groups and their commutator subgroups. By way of application, we give a criterion of freeness for the…