A sample iterated small cancellation theory for groups of Burnside type

We develop yet another technique to present the free Burnside group $B(m,n)$ of odd exponent $n$ with $m\ge2$ generators as a group satisfying a certain iterated small cancellation condition. Using the approach, we provide a reasonably accessible proof that $B(m,n)$ is infinite with a moderate bound $n > 2000$ on the odd exponent $n$.

Authors

Institutions

Publication Details

Journal
Известия Российской академии наук Серия математическая
Published
2025-01-01
DOI
https://doi.org/10.4213/im9475
Primary Topic
Geometric and Algebraic Topology
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A sample iterated small cancellation theory for groups of Burnside type

Igor Lysenok
Известия Российской академии наук Серия математическая
Geometric and Algebraic Topology
article

A sample iterated small cancellation theory for groups of Burnside type

Igor Lysenok
article en

Abstract

We develop yet another technique to present the free Burnside group $B(m,n)$ of odd exponent $n$ with $m\ge2$ generators as a group satisfying a certain iterated small cancellation condition. Using the approach, we provide a reasonably accessible proof that $B(m,n)$ is infinite with a moderate bound $n > 2000$ on the odd exponent $n$.

Известия Российской академии наук Серия математическаяVol. 89(4)
Russian Academy of Sciences (RU), Steklov Mathematical Institute (RU)
Russian Science Foundation
Openalex Percentile: Top 77%
Geometric and Algebraic Topology
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.