Combinatorial Estimations on Burnside Type Problems

被引:0
|
作者
Beletskiy, Anton [1 ]
Ivanov-Pogodaev, Ilya [2 ]
机构
[1] HSE Univ, Fac Math, Moscow 101000, Russia
[2] MIPT Univ, Sch Appl Math & Comp Sci, Moscow 141701, Russia
基金
俄罗斯科学基金会;
关键词
Burnside; small cancellations; group theory; ALGORITHM;
D O I
10.3390/math12050665
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The Burnside problem, formulated by W. Burnside in 1902, is one of the most well-known and important open questions in the field of Group Theory. Despite significant progress made in the past century towards solving this problem, its complete solution remains unknown. In this paper, we investigate one of the approaches to solving the Burnside problem based on the application of an iterative theory of small cancellations and canonical forms developed by E. Rips in recent years. We present a novel self-contained exposition of this theory and utilize it to obtain new estimates on the infiniteness of initial approximations of Burnside groups where only a finite number of periodic relations is used for relatively small odd exponents (n>120).
引用
收藏
页数:25
相关论文
共 50 条