Related papers: Concise presentations of direct products

We show that if a torsion free nilpotent group $G$ has a balanced presentations and Hirsch length $h(G)>3$ then $\beta_1(G;\mathbb{Q})=2$. There is just one such group which is torsion-free and of Hirsch length $h=4$, and none with $h=5$.…

For $G$ a finite group, let $d_2(G)$ denote the proportion of triples $(x, y, z) \in G^3$ such that $[x, y, z] = 1$. We determine the structure of finite groups $G$ such that $d_2(G)$ is bounded away from zero: if $d_2(G) \geq \epsilon >…

A group is known as `large' if some finite index subgroup admits a surjective homomorphism onto a non-abelian free group. The main theorem of the paper is as follows. Let G be a finitely generated, large group and let g_1,...,g_r be a…

Let $G$ be a finite group. Define a graph on the set $G^{\#} = G \setminus \{ 1 \}$ by declaring distinct elements $x,y\in G^{\#}$ to be adjacent if and only if $\langle x,y\rangle$ is cyclic. Denote this graph by $\Delta(G)$. The graph…

Let G be a finite group with a generating set A. By the (symmetric) diameter of G with respect to A we mean the maximum over g in G of the length of the shortest word in (A union A inverse)A expressing g.By the (symmetric) diameter of G we…

We consider the group $\mathfrak{X}(G)$ obtained from $G\ast G$ by forcing each element $g$ in the first free factor to commute with the copy of $g$ in the second free factor. Deceptively complicated finitely presented groups arise from…

We explore transversals of finite index subgroups of finitely generated groups. We show that when $H$ is a subgroup of a rank $n$ group $G$ and $H$ has index at least $n$ in $G$ then we can construct a left transversal for $H$ which…

Let H be a group obtained from a group G by adding one generator and one relator which is a proper power of a unimodular word. The main aim of this paper is to prove that G is a malnormal subgroup of H. This implies that if G is a…

We compute coherent presentations of Artin monoids, that is presentations by generators, relations, and relations between the relations. For that, we use methods of higher-dimensional rewriting that extend Squier's and Knuth-Bendix's…

Let $p$ be a prime and $G$ a pro-$p$ group of finite rank that admits a faithful, self-similar action on the $p$-ary rooted tree. We prove that if the set $\{g\in G \ | \ g^{p^n}=1\}$ is a nontrivial subgroup for some $n$, then $G$ is a…

Let $p>3$ be a prime. For each maximal subgroup $H\leqslant\mathrm{GL}(d,p)$ with $|H| \geqslant p^{3d+1}$, we construct a $d$-generator finite $p$-group $G$ with the property that $\mathrm{Aut}(G)$ induces $H$ on the Frattini quotient…

We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…

Irrespective of whether n is prime, prime power with exponent >1, or composite, the group U_n of units of Z_n can sometimes be obtained as the direct product of cyclic groups generated by x, x+k and x+2k, for x, k in Z_n. Indeed, for many…

A group-word $w$ is called concise if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G$. It is known that there are words that are not concise. In particular, Olshanskii gave an example of such…

We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…

The power graph $\mathcal{P}(G)$ is the simple undirected graph with group elements as a vertex set and two elements are adjacent if one of them is a power of the other. The order supergraph $\mathcal{S}(G)$ of the power graph…

The deficiency of a group is the maximum over all presentations for that group of the number of generators minus the number of relators. Every finite group has non-positive deficiency. We show that every non-positive integer is the…

Let $G$ be $2$-generated group. The generating graph of $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G=\langle g,h\rangle$. This graph encodes the combinatorial…

We introduce a new approach to representation theory of finite groups that uses some basic algebraic geometry and allows to do all the theory without using characters. With this approach, to any finite group $G$ we associate a finite number…

A group-word $w$ is concise in a class of groups $\mathcal X$ if and only if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G\in \mathcal X$. It is a long-standing open problem whether every…