Related papers: Nilpotent $p$-local finite groups

This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups. Let $\varphi_k(G)$ denote the probability that $k$ random elements generate a finite nilpotent group $G$. For any $0 < \epsilon <…

A maximal abelian normal subgroup A in a nilpotent group N is self-centralizing. This makes their role an important one in determining the structure of the nilpotent group. For example if A is finite then N is also finite. In the free…

A nilpotent quandle is a quandle whose inner automorphism group is nilpotent. Such quandles have been called reductive in previous works, but it turns out that their behaviour is in fact very close to nilpotency for groups. In particular,…

We introduce the concept of quantifying the extent to which a finitely generated group is residually finite. The quantification is carried out for some examples including free groups, the first Grigorchuk group, finitely generated nilpotent…

We give a combinatorial criterion that implies both the non-strong relative hyperbolicity and the one-endedness of a finitely generated group. We use this to show that many important classes of groups do not admit a strong relatively…

The aim of this work is to find some exact sequences on the $c$- nilpotent multiplier of a group $G$. We also give an upper bound for the $c$- nilpotent multiplier of finite $p$-groups and give the explicit structure of groups whose take…

The functions $F_{G}(n)$ measures the asymptotic behavior of residual finiteness for a finitely generated group $G$. In previous work \cite{Pengitore_1}, the author claimed a characterization for $F_{N}(n)$ when $N$ is a finitely generated…

Let $p$ be a prime number. A saturated fusion system $\mathcal{F}$ on a finite $p$-group $S$ is said to be supersolvable if there is a series $1 = S_0 \le S_1 \le \dots \le S_m = S$ of subgroups of $S$ such that $S_i$ is strongly…

Let $g$ be an element of a group $G$. For a positive integer $n$, let $E_n(g)$ be the subgroup generated by all commutators $[...[[x,g],g],\dots ,g]$ over $x\in G$, where $g$ is repeated $n$ times. We prove that if $G$ is a profinite group…

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

We develop nilpotently $p$-localization of knot groups in terms of the (symplectic) automorphism groups of free nilpotent groups. We show that any map from the set of conjugacy classes of the outer automorphism groups yields a knot…

We consider word automaticity for groups that are nilpotent of class $2$ and have exponent a prime $p$. We show that the infinitely generated free group in this variety is not word automatic. In contrast, the infinite extra-special…

We show that every finite group $G$ of size at least $3$ has a nilpotent subgroup of class at most $2$ and size at least $|G|^{1/32\log\log|G|}$. This answers a question of Pyber, and is essentially best possible.

In this article we study the homology of nilpotent groups. In particular a certain vanishing result for the homology and cohomology of nilpotent groups is proved.

It is known from work of du Sautoy and Grunewald in \cite{duSG1} that the zeta functions counting subgroups of finite index in infinite nilpotent groups depend upon the behaviour of some associated system of algebraic varieties on reduction…

We amalgamate finite 2-nilpotent groups G of exponent p > 2, where G' is contained in a subgroup of the center, generated by n elements. We get Fraisse limits D(n) with superstable elementary theories of SU-rank 1. D(1) is Felgner's extra…

We prove that the isomorphism type of the subrack lattice of a finite group determines the nilpotence class. We analyze the problem of estimating the orders of the group elements corresponding to the atoms of the subrack lattice. As a…

For a p-group G admitting an automorphism $\phi$ of order $p^n$ with exactly $p^m$ fixed points such that $\phi^{p^{n-1}}$ has exactly $p^k$ fixed points, we prove that G has a fully-invariant subgroup of m-bounded nilpotency class with…

We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical algorithm to test nilpotency of…

We show that the definition of unipotent (resp. nilpotent) pieces for classical groups given by Lusztig (resp. Lusztig and the author) coincides with the combinatorial definition using closure relations on unipotent classes (resp. nilpotent…