Fact-checked by Grok 2 weeks ago

Burnside problem

The Burnside problem is a fundamental question in group theory concerning the finiteness of periodic groups, specifically asking whether a group generated by a finite set of elements, each of finite order, must itself be finite. Formulated by the British mathematician William Burnside in 1902, the problem highlights a key distinction between finite-order elements and the overall structure of the group they generate.^[1] Burnside's original query, posed in the context of discontinuous transformation groups, evolved into several variants that have driven significant advances in combinatorial group theory. The general Burnside problem inquires whether every finitely generated periodic group—meaning every element has some finite order, but not necessarily bounded—is finite. This was resolved negatively in 1964 by Evgenii Golod and Igor Shafarevich, who constructed infinite finitely generated torsion groups using graded Lie algebras over rings, providing counterexamples that are infinite p-groups for odd primes p. The bounded Burnside problem, a stronger version assuming a uniform bound n on the orders of all elements (i.e., groups of exponent n), asks if the free Burnside group B(m,n) of rank m and exponent n is finite. Early positive results held for small n, such as n=2,3,4,6, but Sergei Adian and Pyotr Novikov proved in 1968 that B(m,n) is infinite for odd n ≥ 4381 and m ≥ 2, using a combinatorial small cancellation method over hyperbolic spaces. The restricted Burnside problem, which seeks the existence of a maximal finite quotient among all finite m-generated groups of exponent n, was affirmatively solved by Efim Zelmanov in a series of papers from 1990 to 1991. Zelmanov's proof, employing profound techniques from Lie ring theory and local finiteness in varieties of groups, established that such a largest finite group exists for all finite m and n, resolving a long-standing conjecture and earning him the Fields Medal in 1994. These resolutions not only answered Burnside's questions but also spurred developments in geometric group theory, profinite groups, and algorithmic problems in group presentations.

Overview and Formulation

Definition of the Problem

The Burnside problem concerns the finiteness of certain groups in abstract algebra. A group G is said to be periodic (or a torsion group) if every element g \in G has finite order, meaning there exists a positive integer n_g such that g^{n_g} = e, where e is the identity element of G. The order of g, denoted |g|, is the smallest such positive integer n_g.^[2] The exponent of a group G, denoted \exp(G), is defined as the least common multiple of the orders of all its elements, which may be infinite even if G is periodic (i.e., if the orders of elements are unbounded).^[3] A group G is finitely generated if there exists a finite set S \subseteq G such that every element of G can be expressed as a finite product of elements from S and their inverses; the elements of S are called generators of G. All finite groups are both periodic and finitely generated, but infinite examples exist for each property separately. For instance, the Prüfer p-group \mathbb{Z}(p^\infty), which consists of all p-power roots of unity in the complex numbers under multiplication (or equivalently, the p-primary component of \mathbb{Q}/\mathbb{Z}), is an infinite periodic group where every element has p-power order, yet it is not finitely generated. In 1902, William Burnside formulated the problem in the context of groups of bounded exponent: given positive integers m and n, is the group generated by m elements where every element satisfies x^n = e necessarily finite? This is equivalent to asking whether the free Burnside group B(m,n) of rank m and exponent n is finite. More generally, the Burnside problem asks whether every finitely generated periodic group is finite.^[1]

Mathematical Context and Motivation

The Burnside problem occupies a central place in infinite group theory, distinguishing it from the realm of finite groups where every element inherently possesses finite order due to the group's bounded cardinality. In contrast, infinite groups can exhibit torsion—every element having finite order—without being finite, raising fundamental questions about the structure and growth of such groups. This context ties back to William Burnside's foundational work on representation theory, including his proof that groups of order p^a q^b (with p, q distinct primes) are solvable, and his explorations of periodic linear groups, which suggested patterns of finiteness that extended intuitively to infinite settings.^[4]^[5] The problem's motivation stems from broader attempts to classify finitely generated groups, especially those subject to order restrictions like uniform periodicity. It emerges in efforts to delineate the properties of groups generated by a finite set while imposing laws such as x^n = 1 for all elements x, connecting directly to free groups through the notion of varieties of groups—classes defined by identities. The free objects in these varieties, known as free Burnside groups B(r, n) of rank r and exponent n, serve as quotients of free groups by the normal subgroup generated by nth powers, providing a universal model for understanding how such laws constrain group structure and infinitude.^[6]^[7] Beyond classification, the Burnside problem holds implications for core algebraic concerns, such as the decidability of the word problem in torsion groups, where an affirmative solution would render it solvable via finite presentations, but counterexamples introduce undecidability challenges in algorithmic group theory. The Golod-Shafarevich approach, yielding the first infinite examples, establishes a brief link to Lie algebras and ring theory by constructing graded associative algebras with controlled growth dimensions, whose associated groups are infinite and periodic.^[8]^[9] Burnside's expectation of finiteness drew from affirmative results for small exponents, where torsion straightforwardly yields bounded groups. For exponent 2, the resulting groups are elementary abelian 2-groups, finite when finitely generated. Similarly, for exponent 3, such groups prove finite, as established through explicit constructions showing no infinite examples arise. These cases, rooted in the automatic periodicity of small-order structures, fueled optimism that the pattern held generally for finitely generated periodic groups.^[10]^[4]

Historical Development

Early Work and Affirmative Cases

In 1902, William Burnside posed the question of whether a group generated by m elements, in which every element satisfies the relation x^n = 1 for a fixed positive integer n, must be finite; this formulation specifically targeted groups of bounded exponent n. He provided affirmative answers for small values of n, demonstrating that the free Burnside group B(m,2) of exponent 2 is the elementary abelian 2-group of order $2^m. For n=2 and m=2, this yields the Klein four-group. Burnside also established finiteness for B(m,3), showing that such groups have order at most $3^{2m-1}.^[1] Subsequent early investigations confirmed and refined these results for low exponents. In 1933, F. W. Levi and B. L. van der Waerden proved that B(m,3) is finite of exact order $3^{m + \binom{m}{2} + \binom{m}{3}}, establishing it as a metabelian group of nilpotency class at most 3. For exponent 4, I. N. Sanov demonstrated in 1940 that B(m,4) is finite for all m, building on Burnside's partial result for m=2. Marshall Hall Jr. extended the affirmative resolution in 1958 by showing that B(m,6) is finite, with order $2^a 3^b where a = 1 + (m-1)3^c and b = 1 + (m-1)2^m for c = m + \binom{m}{2} + \binom{m}{3}, and of derived length at most 3. These outcomes implied full finiteness for groups of exponents dividing 2, 3, 4, or 6.^[1]^[11] Early approaches to these proofs relied on constructive methods, including the development of normal forms for elements in the groups and enumeration of cosets to bound the order. Burnside's lemma, which counts orbits under group actions, played a key role in enumerating distinct elements and subgroups. This work unfolded amid broader investigations into finite groups of bounded exponent, influenced by Ferdinand Georg Frobenius's foundational contributions to representation theory and finite group classification in the late 19th century, as well as Issai Schur's 1911 theorem that finitely generated periodic subgroups of \mathrm{GL}(n, \mathbb{C}) are finite.^[1]

Emergence of Counterexamples

In the 1950s, initial doubts about the finiteness of periodic groups began to emerge through the work of Alexei Kostrikin, who focused on the case of prime exponents and proved the existence of a maximal finite quotient for groups satisfying the identity x^p = 1 where p is prime, thereby motivating the formulation of the restricted Burnside problem as a refined affirmative question.^[12] This partial result highlighted potential limitations in Burnside's original conjecture, shifting attention toward bounded cases while leaving the general problem open. In 1959, Sergei Novikov announced a negative solution, claiming the existence of infinite finitely generated groups of odd exponent greater than 71 satisfying x^n = 1, though the proof contained a significant gap that was not resolved until later.^[13] The first definitive counterexample to the general Burnside problem arrived in 1964 with the construction by Evgeny Golod and Igor Shafarevich of an infinite, finitely generated, torsion group using techniques from graded Lie algebras over rings, demonstrating that not all periodic groups are finite without additional restrictions. This breakthrough provided the initial negative resolution, relying on inequalities bounding the growth of dimensions in associated algebras to ensure infiniteness. Building on earlier ideas, Pyotr Novikov and Sergei Adian delivered a rigorous proof in 1968 that free Burnside groups B(m, n) are infinite for odd exponents n \geq 4381 and m \geq 2, employing small cancellation theory over a carefully chosen alphabet to control relator overlaps and establish non-trivial reduced words of arbitrary length.^[14] The case of even exponents proved more challenging, but in 1994 Sergei Ivanov extended the negative solution to sufficiently large even exponents using geometric group theory, constructing infinite free Burnside groups B(m, n) for n \geq 2^{48} and m \geq 2 via presentations with hyperbolic-like properties and asymptotic density arguments for van Kampen diagrams.^[15] Subsequent refinements, such as those by Olga Lysenok, lowered the bound to even exponents n \geq 8000, confirming infiniteness through similar combinatorial and geometric methods. In 2015, Sergei Adian claimed further progress by modifying the Novikov-Adian framework to show infiniteness of B(m, n) for all odd n > 101 and m \geq 2, though this result remains unverified as of 2025 due to the complexity of the induction and parameter estimates involved.^[16] These developments marked a pivotal shift, transforming the Burnside problem from an open conjecture into a landscape of known counterexamples for large exponents, while leaving smaller cases unresolved.

The General Burnside Problem

Statement and Implications

The general Burnside problem inquires whether every finitely generated torsion group—that is, a group in which every element has finite order—is necessarily finite.^[9] This question, posed by William Burnside in 1902, broadens his original inquiry about groups of fixed exponent n (where g^n = e for all g in the group) to allow elements of arbitrary finite orders.^[17] The answer is negative: counterexamples exist, as first constructed by Golod and Shafarevich in 1964, demonstrating the existence of infinite finitely generated p-groups for primes p and ranks at least 2.^[9] These counterexamples have profound implications for the theory of infinite torsion groups. In particular, they reveal that the variety of all torsion groups, generated by all finite groups, is not locally finite, meaning that not every finitely generated subgroup within this variety is finite—a property that would hold if the general Burnside problem had an affirmative resolution.^[7] This challenges the expectation that torsion conditions impose strong finiteness constraints in non-abelian settings, as varieties of groups with bounded exponent may or may not be locally finite depending on the exponent.^[18] Philosophically, the result underscores a key distinction between abelian and non-abelian groups: while finite generation plus torsion implies finiteness in the abelian case—by the fundamental theorem of finitely generated abelian groups, which decomposes such groups into finite direct sums of cyclic groups of prime-power order—the general case lacks this guarantee.^[19] Thus, finite generation and universal torsion do not suffice for finiteness, overturning an analogy drawn from abelian structures and highlighting the richness of non-commutative group theory.^[9]

Golod-Shafarevich Counterexamples

In 1964, Evgeny Golod and Igor Shafarevich developed a groundbreaking construction that provided the first counterexamples to the general Burnside problem, demonstrating the existence of infinite finitely generated groups in which every element has finite order.^[20] Their approach relies on the Golod-Shafarevich theorem, which analyzes presentations of pro-p groups for a prime p through associated graded algebras over the field with p elements. Specifically, these groups are obtained as quotients of free pro-p groups by uniformly powerful ideals generated by homogeneous relations in the completed group algebra, ensuring that the resulting structure is a p-group where all non-identity elements have order a power of p.^[9] The core of the theorem involves a homological inequality derived from the dimensions of mod-p cohomology groups. For a nontrivial finite p-group G, the Golod-Shafarevich inequality states that

\dim H^2(G, \mathbb{F}_p) > \frac{[\dim H^1(G, \mathbb{F}_p)]^2}{4},

where H^1(G, \mathbb{F}_p) and H^2(G, \mathbb{F}_p) are the first and second cohomology groups with trivial action.^[20] This bound arises from the Hilbert series of the cohomology algebra, which controls the growth of the group: if the number of relations (reflected in the dimension of H^2) is sufficiently small relative to the number of generators (captured by \dim H^1), the formal power series for the group's dimension function exhibits a radius of convergence leading to infinite growth. In the construction, Golod and Shafarevich select relations such that the inequality is "violated" in the limiting sense for finite groups, implying that the pro-p completion must be infinite.^[9] The resulting Golod-Shafarevich groups possess remarkable properties: they are infinite, finitely generated (typically by two elements), and torsion, meaning every element has order a power of p. For instance, explicit presentations with two generators and relations like powers and higher commutators yield such groups for any prime p, confirming that no uniform bound on orders is needed to force finiteness in the general case.^[20] These examples not only resolve the general Burnside problem negatively but also extend to broader constructions of infinite p-groups with controlled deficiency, influencing subsequent work on group growth and cohomology.^[9] Further developments of the Golod-Shafarevich framework have applications to infinite p-groups beyond the minimal two-generator case, including groups with exponential subgroup growth and positive power p-deficiency. These constructions provide foundational tools for addressing aspects of the restricted Burnside problem by highlighting infinite towers of finite p-quotients, though the groups themselves remain infinite.^[9]

The Bounded Burnside Problem

Free Burnside Groups of Exponent n

The free Burnside group of exponent n on m generators, denoted B(m,n), is defined as the quotient group F_m / F_m^n, where F_m is the free group on m generators and F_m^n is the normal subgroup generated by all nth powers of elements of F_m.^[21] This construction makes B(m,n) the largest m-generated group satisfying the law x^n = 1 for all x in the group, and it serves as the free object in the variety of groups of exponent dividing n.^[22] The bounded Burnside problem, a key question in the study of periodic groups, asks whether B(m,n) is finite for every m \geq 1 and n \geq 2.^[23] This problem investigates whether imposing a uniform exponent n on a finitely generated group forces finiteness, with implications for the local finiteness of the variety of all groups of exponent n. The answer is negative when n is sufficiently large: for odd n \geq 4381, B(m,n) is infinite for all m \geq 2.^[7] For small values of n, affirmative results establish finiteness of B(m,n) for all m. Specifically, when n=2, B(m,2) is the elementary abelian $2-group of rank m, which has order 2^m. For n=3, B(m,3)

is finite, as proved by showing that groups of exponent &#36;3

are locally finite; the order is $3^{m + \binom{m}{2} + \binom{m}{3}}. For n=4, B(m,4) is also finite for all m, with explicit orders known for small m such as |B(2,4)|=2^{12}.^[24] When n=6, B(m,6) is finite for all m, completing the known small-exponent cases where the variety is locally finite.^[25] For n=5, B(m,5) is finite for m \leq 2, with |B(2,5)|=5^{34}, but the finiteness for m \geq 3 remains an open question in the bounded Burnside problem.^[26]

Infinite Examples and Open Cases

The Novikov–Adian theorem established that the free Burnside group B(m,n) is infinite for all m \geq 2 and odd exponents n \geq 4381, providing the first counterexample to the bounded Burnside problem for sufficiently large odd periods.^[27] This result relied on a novel application of hyperbolic geometry and small cancellation theory over groups, specifically constructing presentations where periods exceed $1/6 of the relator length to ensure non-trivial reduced diagrams and infinite word growth. The theorem's proof involved embedding the group into a hyperbolic space via van Kampen diagrams, demonstrating exponential growth incompatible with finiteness. Subsequent advancements extended these ideas to even exponents. In 1994, Sergei V. Ivanov proved that B(m,n) is infinite for m \geq 2 and even n \geq 2^{48}, using a construction of group presentations incorporating relations inspired by the golden ratio to control commutator lengths and ensure hyperbolic-like properties. This bound was significantly improved by Igor G. Lysënok in 1996, who showed infiniteness for even n \geq 8000 and m \geq 2 through a refined Novikov–Adian framework adapted for even periods, emphasizing graded diagrams and small cancellation conditions tailored to powers of 2 in the exponent.^[28] These works confirmed that free Burnside groups of large even exponents also yield negative solutions to the Burnside problem, highlighting the role of asymptotic density in relator overlaps. Despite these breakthroughs, several cases remain open, particularly for smaller exponents. The finiteness of B(2,5) is unresolved as of November 2025, with no definitive proof of either finiteness or infiniteness despite extensive analysis of its potential order and subgroup structure.^[29] For small even exponents beyond 6, such as 8, results indicate finiteness for m=2 while cases for m \geq 3 remain open.^[30] In 2015, Sergei I. Adian claimed to prove infiniteness of B(m,n) for all odd n > 101 and m \geq 2 via a simplified modification of the Novikov–Adian method, reducing the exponent threshold through optimized estimates on period lengths and diagram reductions; however, the full details of this claim have not been independently verified or widely accepted in the literature. Computational approaches have supplemented theoretical efforts by verifying properties for small m and n. Programs in systems like GAP have enumerated elements and checked relations in B(m,n) for exponents up to 1000 in low ranks (e.g., m=2), confirming finiteness for cases like n=3,4,6 and providing growth bounds or subgroup indices where direct computation is feasible, though full enumeration becomes intractable beyond n \approx 10.^[31] These checks often focus on the restricted word problem or coset enumeration to probe infiniteness indirectly for intermediate exponents.^[32]

The Restricted Burnside Problem

Formulation for Finite Groups

The restricted Burnside problem asks whether, for given positive integers m and n, there exists a uniform bound on the orders of all finite m-generated groups of exponent n.^[1] This formulation, attributed to A. I. Kostrikin in his 1959 paper, distinguishes itself by focusing exclusively on finite groups and seeking a maximal finite example within the class.^[12] Equivalently, it questions the finiteness of the restricted Burnside group rB(m,n), defined as the quotient of the free Burnside group B(m,n) by the intersection of all normal subgroups of finite index, representing the "largest" finite m-generated group of exponent n.^[1] The motivation for this restricted version lies in examining the local finiteness of the variety of all groups satisfying the law x^n = 1, even when the free objects in that variety—the unrestricted Burnside groups—may be infinite.^[1] In algebraic terms, the variety is locally finite if every finitely generated member is finite, a property that holds if and only if rB(m,n) is finite for all m.^[1] This approach circumvents the infinities arising in the broader Burnside problem by confining attention to bounded orders within finite structures. Early affirmative results established the problem for small exponents. For n=2, finitely generated groups of exponent 2 are elementary abelian 2-groups, hence finite.^[1] F. Levi and B. L. van der Waerden proved in 1933 that m-generated groups of exponent 3 are finite, metabelian, of nilpotency class at most 3, and of order $3^{m + \binom{m}{2} + \binom{m}{3}}.^[1] I. N. Sanov resolved the case n=4 in 1940, showing finiteness for all m.^[1] For n=6, P. Hall and G. Higman demonstrated in 1956 that such groups are finite, soluble of derived length at most 3, with explicit order bounds involving powers of 2 and 3.^[1] Kostrikin extended this in 1959 by proving finiteness for prime exponents n=p, reducing the problem to Lie ring methods over fields of characteristic p.^[12] In contrast to the general Burnside problem and its bounded variant, which admit infinite counterexamples for sufficiently large odd n, the restricted formulation yields a positive answer by confirming boundedness in the finite setting.^[1]

Zelmanov's Solution and Consequences

In 1990 and 1991, Efim Zelmanov proved that for any positive integers m and n, the restricted Burnside group rB(m,n), consisting of all finite m-generated groups of exponent n modulo the laws of those groups, is finite, with its order bounded by a function f(m,n) depending only on m and n. Zelmanov's proof employs methods from Lie ring theory, associating to a finitely generated group of exponent p^k (for prime p) a graded Lie ring over \mathbb{Z}/p\mathbb{Z} via the Lazard correspondence or Hausdorff filtration, and reducing the problem to showing local nilpotency of this Lie ring. Central to the argument is the demonstration that finitely generated Lie rings satisfying an Engel condition of sufficient length—where [x, y^{(n)}] = 0 for all x, y, with y^{(n)} denoting n-fold commutators—are locally nilpotent, implying the original group is finite. For odd primes p, the proof handles the modular Lie algebra case by bounding its nilpotency class; the exponent-2 case follows similarly after reduction.^[33] This resolution earned Zelmanov the Fields Medal in 1994, recognizing its depth in bridging group theory with non-associative algebras. A key consequence is the finite-dimensionality of finitely generated restricted Lie algebras over fields of characteristic p satisfying an Engel-like identity, extending classical results on nilpotency to infinite-dimensional settings. Zelmanov's techniques also apply to Jordan algebras, proving that finitely generated Jordan algebras over fields of characteristic zero with a suitable Engel condition are finite-dimensional, with implications for the structure theory of alternative algebras.^[33] Subsequent work by Zelmanov and others provided explicit, albeit enormous, bounds on |rB(m,n)|; for instance, improvements yield orders at most \exp(O(n^{c \log n})) for some constant c > 0, depending on the prime factors of n.^[34] Zelmanov's theorem establishes that the Burnside variety of exponent n—the variety generated by all groups satisfying x^n = 1—is locally finite, meaning every finitely generated group in the variety is finite, resolving longstanding questions in universal algebra.^[18]

Tarski Monster Groups

Tarski monster groups, named after Alfred Tarski, are infinite groups G of exponent p for a fixed prime p, in which every proper subgroup is cyclic of order p. These groups were first constructed by Alexander Yu. Olshanskii in 1980, resolving a problem posed by Otto Schmidt on the existence of infinite non-abelian groups whose proper subgroups all have prime order. Olshanskii's construction yields such groups for every sufficiently large prime p > 10^{75}, and in fact produces continuum-many non-isomorphic examples for each such p.^[35] The construction relies on advanced techniques from geometric group theory, particularly a generalized small cancellation theory over hyperbolic spaces. Olshanskii begins with a free group and imposes relations designed to control the subgroup structure, ensuring that any proper subgroup collapses to order p while the whole group remains infinite and torsion. Adaptations of the Golod-Shafarevich inequality are used to guarantee infiniteness by analyzing the growth of the group's presentation.^[35] The resulting groups are 2-generated, providing particularly simple counterexamples to the bounded Burnside problem, as they are infinite despite having bounded exponent p. Key properties of Tarski monster groups include being simple (having no nontrivial normal subgroups), infinite, and torsion, with every non-identity element having order exactly p. Distinct proper subgroups intersect trivially, and the subgroup lattice is modular, which is unusual for non-abelian groups.^[35] These groups are non-amenable and contain no free subgroups, highlighting their pathological nature. As of 2025, recent work includes an elementary proof that no Tarski monster groups exist for exponent 3.^[36] Subsequent developments by Olshanskii in 1991 refined the geometric small cancellation framework, enabling broader applications and more precise control over group properties in such constructions. Tarski monster groups also connect to the study of random groups, where Olshanskii's methods inform the behavior of random presentations at critical densities, often yielding similar extreme subgroup restrictions.^[37]

Analogues in Other Structures

The Burnside problem extends naturally to semigroups, where the analogue asks whether a finitely generated periodic semigroup—one in which every element generates a finite cyclic subsemigroup—is necessarily finite. Unlike the group case, the answer is negative in general, as infinite periodic semigroups exist, but positive results hold for restricted classes such as finitely generated periodic semigroups of matrices over a field, which are always finite.^[38] The Magnus embedding theorem provides a key tool for relating semigroup problems to groups by embedding certain cancellative semigroups into groups, facilitating the transfer of finiteness properties and aiding in the study of periodic varieties. An analogue of the Adian-Rabin theorem applies to semigroups, demonstrating undecidability for properties like finiteness in finitely presented semigroups with bounded word lengths, mirroring the algorithmic challenges in the group setting.^[39] In Lie rings, the Burnside problem analogue considers whether a finitely generated Lie ring over a field, with every element satisfying a power law (bounded exponent), is finite-dimensional. Zelmanov's methods from the restricted Burnside problem for groups extend here: he proved that restricted Lie algebras of bounded exponent over fields of characteristic zero are nilpotent, implying finite-dimensionality in the solvable case, thus solving the restricted version affirmatively.^[33] However, the unbounded case—finitely generated torsion Lie rings—remains open, with no general finiteness result established. For hyperbolic groups, Gromov's 1987 framework introduced δ-hyperbolic groups that may contain torsion elements, allowing analogues of the bounded Burnside problem: whether the quotient of a finitely generated hyperbolic group by the n-th power of its augmentation ideal is finite for all n. Gromov conjectured that for every non-elementary hyperbolic group, there exists an n such that this quotient is infinite; this was proved by Ivanov and Olshanskii in 1996, showing that such quotients grow without bound for sufficiently large exponents, yielding infinite examples akin to the general Burnside counterexamples. In other structures, polynomial identity (PI) algebras over a field satisfy multilinear identities, and Burnside-type problems often resolve positively: finitely generated PI-algebras of bounded exponent are finite-dimensional.^[40] Nonetheless, Golod-Shafarevich constructions yield counterexamples to the general version, producing infinite-dimensional PI-algebras that are nil but not nilpotent, paralleling the infinite Golod-Shafarevich groups.^[9] For non-associative algebras, such as Lie-admissible or alternative algebras, analogues remain incomplete as of 2025, with partial results on nilpotency but no comprehensive resolution for torsion conditions. Open challenges persist in decidability for varieties of magmas—the most general binary operation structures—where the Burnside analogue concerns finiteness under bounded "periodicity" laws.

References

[1]
A history of the Burnside problem - MacTutor - University of St Andrews
It is clear that any finite group is periodic. In his 1902 paper, Burnside [1] introduced what he termed "a still undetermined point" in the theory of groups:
[2]
[PDF] ORDERS OF ELEMENTS IN A GROUP 1. Introduction Let G be a ...
An element g in a group has finite order if gn=e for some positive integer n. The order of g is the least n such that gn=e. If no such n exists, g has infinite ...
[3]
[PDF] Theory of Groups of Finite Order and the Burnside Problem
Influential as a founder of modern group theory, William Burnside generated the initial interest that brought group research to the forefront of mathematics.
[4]
[PDF] On the Burnside Problem - UChicago Math
Aug 12, 2006 · This paper will investigate the classical Burnside problem as it was originally proposed in 1902 and will focus on developing a counterexample.
[5]
[PDF] the burnside problem
The Burnside problem asks if a finitely generated group with finite order elements is necessarily finite. It has variations like the bounded and open problems.Missing: formulation | Show results with:formulation
[6]
The Burnside problem and related topics - Math-Net.Ru
Oct 23, 2024 · This paper gives a survey of results related to the famous Burn- side problem on periodic groups. A negative solution of this problem was first ...
[7]
word problem in free Burnside groups (and other torsion groups)
Jun 2, 2011 · Question 1. Is it known that for some free Burnside groups the word problem is undecidable? Provided that the answer is negative, what about the ...Which group does not satisfy the Tits alternative? - MathOverflowBurnside group B(2,3) has 27 elements, isomorphic to unitringular ...More results from mathoverflow.netMissing: connections | Show results with:connections
[8]
[PDF] golod-shafarevich groups: a survey - GitHub Pages
A year later, in 1964, Golod and Shafarevich [GS] confirmed this conjecture by showing that for any finite p-group G the minimal numbers of generators d(G) ...Missing: citation | Show results with:citation
[9]
[PDF] The Burnside Problem - Marcel Goh
Apr 15, 2020 · ONE OF THE oldest and most studied problems in group theory began life in a 1902 paper by William. Burnside [3]. He wrote: “A still undecided ...
[10]
Solution of the Burnside problem for exponent six - Project Euclid
December 1958 Solution of the Burnside problem for exponent six. Marshall Hall Jr. Author Affiliations +. Marshall Hall Jr.1 1The Ohio State University, ...
[11]
A. I. Kostrikin, “The Burnside problem”, Izv. Math., 23:1 (1959)
Citation: A. I. Kostrikin, “The Burnside problem”, Izv. Math., 23:1 (1959) ... prime order”, Math. USSR-Sb., 58:1 (1987), 119–126 mathnet · crossref ...
[12]
.Notices - American Mathematical Society
Burnside problem for prime exponents was solved by Kostrikin in. 1958, and now it is reported that Novikov has shown that the Burnside groups with two ...
[13]
INFINITE PERIODIC GROUPS. I - IOPscience
In this paper we construct an example of an infinite periodic group with a finite number of generators, in which the orders of all the elements are bounded by ...Missing: motivation survey
[14]
https://iopscience.iop.org/article/10.1070/IM1968v002n01ABEH000637
[15]
New estimates of odd exponents of infinite Burnside groups
Jul 26, 2015 · In the second part (Sections 11–15) we outline a new modification of the Novikov-Adian theory. The new modification allows us to decrease to n ≥ ...
[16]
[PDF] The Burnside Problem - Ghent University Library
A group is called torsion if all its elements have finite order, and in 1902. William Burnside [8] raised the question: Does a finitely generated torsion group ...
[17]
On varieties arising from the solution of the Restricted Burnside ...
It is well known that the solution of the Restricted Burnside Problem is equivalent to each of the following statements: 1.1. The class of locally finite groups ...Missing: implications | Show results with:implications
[18]
[PDF] ADS ABELIAN GROUPS Introduction Various decomposition ...
ИiiН every finitely generated torsion group is finite. Corollary 1.6. An infinite cyclic group is the only example of a finitely generated infinite abelian ...
[19]
E. S. Golod, I. R. Shafarevich, “On the class field tower”, Izv. Math ...
Full-text PDF (1001 kB) Citations (31). Received: 19.12.1963 ... \paper On the class field tower \jour Izv. Math. \yr 1964 \vol 28 \issue 2Missing: original | Show results with:original
[20]
Small cancellation theory over Burnside groups - ScienceDirect.com
Sep 7, 2019 · This article provides a versatile and easy-to-apply tool for constructing examples of finitely generated infinite n-periodic groups with prescribed properties.
[21]
[PDF] arXiv:math/9210221v1 [math.GR] 1 Oct 1992
Thus, it is known that the Burnside problem is settled in the affirmative for exponents n = 2, 3, 4, 6 and in the negative for the exponents that have an odd.Missing: early | Show results with:early
[22]
[PDF] The Burnside Groups and Small Cancellation Theory - UCSB Math
Dec 9, 1997 · Ivanov published a substantial article on the Burnside groups in which he showed that when n is at least 2 48 and either odd or divisible by 2 9 ...
[23]
Burnside Problem -- from Wolfram MathWorld
The Burnside problem originated with Burnside (1902), who wrote, "A still undecided point in the theory of discontinuous groups is whether the group order ...Missing: William unsolved
[24]
Paper by I. N. Sanov, Solution of the Burnside problem for exponent 4
Dec 5, 2014 · [1] Burnside, W. On an unsettled question in the theory of discontinuous groups. Quart. J. 33, 230-238 (1902). [2] Coxeter, H. S. M.; Moser ...<|control11|><|separator|>
[25]
SOLUTION OF THE BURNSIDE PROBLEM FOR EXPONENT 6<xref ...
1 Philip Hall and Graham Higman, "On the p-Length of p-SolubleGroups andReduction Theo- rems for Burnside's Problem," Proc. London Math. Soc., Ser. 3, 6, 1 ...<|control11|><|separator|>
[26]
The Burnside group of exponent 5 with two generators (Chapter 10)
In this paper in an attempt to prove finite B(5,2) the Burnside group of exponent 5 with two generators, it is shown that B(5,2) has a normal subgroup K1 of ...
[27]
The Burnside problem on periodic groups and related questions
Apr 14, 2011 · W. Burnside, “On Criteria for the Finiteness of the Order of Linear Substitutions,” Proc. London Math. Soc. 3, 435–440 (1905) ...
[28]
Infinite Burnside groups of even exponent - IOPscience
This paper presents a modified Novikov-Adian theory for free Burnside groups of exponent n=16k≥8000, obtaining a negative solution to the Burnside problem for ...Missing: Lysënok infinity
[29]
Finiteness of the Burnside Group - MathOverflow
Aug 20, 2015 · I would like an algorithm that takes the infinite presentation of B(d,n) and say whether it is bigger than k or infinite or something in that ...Burnside problem for hyperbolic groups? - MathOverflowword problem in free Burnside groups (and other torsion groups)More results from mathoverflow.net
[30]
A051576 - OEIS
Sep 9, 2025 · Ivanov showed in 1994 that B(e,r) is infinite if r>1, e >= 2 ... S. V. Ivanov, On the Burnside problem for groups of even exponent, Proc.
[31]
[PDF] Notes on Computational Group Theory Alexander Hulpke
• Pretabulation of results for “small” Fitting-free groups. (Up to size 106 there are at most a few hundered such groups and pretab- ulation is not that bad ...
[32]
[PDF] Some computational results on modules connected with Burnside ...
Some computational results on the structure of certain modules con- nected with Burnside groups of exponent 4 are given. Most results are for the four ...Missing: free mn
[33]
[PDF] Lecture about Efim Zelmanov 1
Burnside proved that groups of exponent 2 (trivial) and exponent 3 are locally finite. In 1905 Burnside showed that a subgroup of GL(n;C) of finite expo ...
[34]
https://doi.org/10.1017/S144678870000121X
[35]
[PDF] On the Classification of Tarski Monsters
Jun 1, 2021 · This paper presents a type of non-abelian infinite simple 𝑝-group, the Tarski monster. The existence of Tarski monsters was first proven by ...
[36]
[PDF] examples of random groups - g. arzhantseva and t. delzant
This group is called the Gromov monster: it contains a coarse image of an expander. It is worth noticing that one can easily merge this construction with that.
[37]
Yet another solution to the Burnside problem for matrix semigroups
Nov 16, 2008 · As a consequence we provide yet another proof that finitely generated periodic semigroups of matrices are finite. Subjects: Group Theory ...
[38]
The Adian-Rabin Theorem -- An English translation - ResearchGate
Aug 21, 2022 · Adian give his proof of the famous "Adian-Rabin Theorem", which shows that there is no algorithm which takes as input a finite presentation of a ...
[39]
PI-groups and PI-representations of groups
Dec 15, 2009 · It is well known that many famous Burnside-type problems have positive solutions for PI-groups and PI-algebras. In the present article, ...