A generic algorithm for the identity problem in finite groups and monoids

Kapovich, Myasnikov, Schupp and Shpilrain in 2003 developed generic approach to algorithmic problems, which considers an algorithmic problem on "most" of the inputs instead of the entire domain and ignores it on the rest of inputs. This approach can be applied to algorithmic problems, whic...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1546; no. 1; pp. 12101 - 12105
Main Author Rybalov, Alexander
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.05.2020
Subjects
Algebra
Algorithms
Group theory
Monoids
Polynomials
Online AccessGet full text
ISSN1742-6588
1742-6596
1742-6596
DOI10.1088/1742-6596/1546/1/012101

Cover

More Information
Summary:Kapovich, Myasnikov, Schupp and Shpilrain in 2003 developed generic approach to algorithmic problems, which considers an algorithmic problem on "most" of the inputs instead of the entire domain and ignores it on the rest of inputs. This approach can be applied to algorithmic problems, which are hard in the classical sense. The problem of checking identities in algebraic structures is the one of the most fundamental problem in algebra. For finite algebraic structures this problem can be decidable in polynomial time, or hard (co-NP-complete). In this paper we present a generic polynomial algorithm for the identity problem in all finite groups and monoids with elements of period greater than 1. The work is supported by Mathematical Center in Akademgorodok, the agreement with Ministry of Science and High Education of the Russian Federation number 075-15-2019-1613.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
1742-6596
DOI:10.1088/1742-6596/1546/1/012101