PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 24, 2024Mathematics0 citationsOpen Access

Combinatorial Estimations on Burnside Type Problems

View Full Paper
ABAnton BeletskiyIIIlya Ivanov-Pogodaev

Key Points

Key points are not available for this paper at this time.

Abstract

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).

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Beletskiy et al. (2024) studied this question.

synapsesocial.com/papers/68e77c7cb6db6435876f095fhttps://doi.org/10.3390/math12050665
Ask AI
Helpful
Bookmark
Share
View Full Paper