Related papers: The Generalized Burnside Theorem

In this article we trace the genesis of a theorem that gives for the first time examples of Galois group $G_S$ of the maximal $p$-extension of $\mathbb{Q}$, unramified outside a finite set of primes not containing $p$, that are of…

The generalised Fitting subgroup of a finite group is the group generated by all subnormal subgroups that are either nilpotent or quasisimple. The importance of this subgroup in finite group theory stems from the fact that it always…

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

In this paper, we extend the classical theory of crossed $G$-sets and the crossed Burnside ring from a finite group $G$ to a finite groupoid $\mathcal{G}$. We introduce a natural monoidal structure on the category of crossed…

It is shown that there exists a finitely generated infinite simple group of infinite commutator width, and that the commutator width of a finitely generated infinite boundedly simple group can be arbitrarily large. Besides, such groups can…

We consider a generalization of the notion of partially balanced incomplete block designs (PBIBDs), by relaxing the requirement that the underlying association scheme be commutative. An infinite family of such generalizations is…

We show that the free Burnside groups $B(m,n)$ are infinite for $m\geq 2$ and odd $n\geq 557$, the best currently known lower bound for the exponent. The proof uses iterated small cancellation theory where the induction is based on the…

A subset S of a finite group G invariably generates G if G = <hsg(s) j s 2 Si > for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response…

A B-group is a group such that all its minimal generating sets (with respect to inclusion) have the same size. We prove that the class of finite B-groups is closed under taking quotients and that every finite B-group is solvable. Via a…

We produce a simple group $G$ of cardinality $\aleph_1$ which is Artinian (every strictly descending chain of subgroups is finite), satisfies a Burnside law and such that for each uncountable subset $Y \subseteq G$ there exists a natural…

Let $ x $ be an element of a finite group $ G $ and denote the order of $ x $ by $ \mathrm{ord}(x) $. We consider a finite group $ G $ such that $ \gcd(\mathrm{ord}(x),\mathrm{ord}(y))\leqslant 2 $ for any two vanishing elements $ x $ and $…

Let $q$ be a fixed odd prime. We show that a finite subset $B$ of integers, not containing any perfect $q^{th}$ power, contains a $q^{th}$ power modulo almost every prime if and only if $B$ corresponds to a blocking set (with respect to…

Supersolubility of a finite group $G=\langle A,B\rangle$ with the nilpotent derived subgroup $G^\prime$ is established under the condition that the subgroups $A$ and $B$ are both subnormal and supersoluble.

Every nonabelian finite simple group of rank $n$ over a field of size $q$, with the possible exception of the Ree groups $^2G_2(3^{2e+1})$, has a presentation with a bounded number of generators and relations and total length $O(\log n…

An element $x$ in a finite group $G$ is said to be \textit{vanishing} if some (complex) irreducible character of $G$ takes value $0$ at $x$. In this article, we prove that every non-abelian finite simple group, except $\mathrm{SL}_2(4)$ and…

Given a group $G$, we write $g^G$ for the conjugacy class of $G$ containing the element $g$. A theorem of B. H. Neumann states that if $G$ is a group in which all conjugacy classes are finite with bounded size, then the commutator subgroup…

We prove that every countable group with solvable power problem embeds into a finitely presented 2-generated group with solvable power and conjugacy problems.

We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.

We prove that the word problem of the Brin-Thompson group nV over a finite generating set is coNP-complete for every n \ge 2. It is known that the groups nV are an infinite family of infinite, finitely presented, simple groups. We also…