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 条
  • [41] Iterative Method for Solving Combinatorial Optimization Problems of the Game-type on Arrangements
    Iemets, O. A.
    Olkhovskaja, E. V.
    JOURNAL OF AUTOMATION AND INFORMATION SCIENCES, 2011, 43 (05) : 52 - 63
  • [42] Combinatorial genetic algorithm for solving combinatorial optimization problems
    Ou, Yongbin
    Peng, Jiahong
    Peng, Hong
    Jishou Daxue Xuebao/Journal of Jishou University, 1999, 20 (01): : 42 - 45
  • [43] Combinatorial Problems for Horn Clauses
    Langlois, Marina
    Mubayi, Dhruv
    Sloan, Robert H.
    Turan, Gyoergy
    GRAPH THEORY, COMPUTATIONAL INTELLIGENCE AND THOUGHT: ESSAYS DEDICATED TO MARTIN CHARLES GOLUMBIC ON THE OCCASION OF HIS 60TH BIRTHDAY, 2009, 5420 : 54 - 65
  • [44] Phase transitions in combinatorial problems
    Dubois, O
    Monasson, R
    Selman, B
    Zecchina, R
    THEORETICAL COMPUTER SCIENCE, 2001, 265 (1-2) : 1 - 1
  • [45] ON A SIMPLE CLASS OF COMBINATORIAL PROBLEMS
    LANDSBERG, PT
    AMERICAN JOURNAL OF PHYSICS, 1962, 30 (07) : 532 - &
  • [46] Reconfigurable accelerators for combinatorial problems
    Platzner, M
    COMPUTER, 2000, 33 (04) : 58 - +
  • [47] On the Landscape of Combinatorial Optimization Problems
    Tayarani-N, Mohammad-H.
    Pruegel-Bennett, Adam
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (03) : 420 - 434
  • [48] An algebraic model for combinatorial problems
    Stearns, RE
    Hunt, HB
    SIAM JOURNAL ON COMPUTING, 1996, 25 (02) : 448 - 476
  • [49] COMBINATORIAL PROBLEMS IN DATABASES - PREFACE
    DEMETROVICS, J
    KATONA, GOH
    PAPADIMITRIOU, CH
    DISCRETE APPLIED MATHEMATICS, 1992, 40 (02) : 105 - 105
  • [50] COMMUNICATION ON SOME COMBINATORIAL PROBLEMS
    LEWIN, D
    PERSPECTIVES OF NEW MUSIC, 1978, 16 (02) : 251 - 253