Construction of Infinite Finitely Presented Nilsemigroup

A. Ya Belov-Kanel, I. A. Ivanov-Pogodaev

Research output: Contribution to journalArticlepeer-review

Abstract

Abstract: An infinite finitely presented nilsemigroup with identity x9 = 0 is constructed. This construction answers the question of L.N. Shevrin and M.V. Sapir. The proof is based on the construction of a sequence of geometric complexes, each obtained by gluing several simple 4-cycles (squares). These complexes have certain geometric and combinatorial properties. Actually, the semigroup is the set of word codings of paths on such complexes. Each word codes a path on some complex. Defining relations correspond to pairs of equivalent short paths. The shortest paths in terms of the natural metric are associated with nonzero words in the subgroup. Codings that are not presented by some path or presented by non-shortest paths can be reduced to a zero word.

Original languageEnglish
Pages (from-to)81-85
Number of pages5
JournalDoklady Mathematics
Volume101
Issue number2
DOIs
StatePublished - 1 Mar 2020

Keywords

  • Burnside-type problems
  • finitely presented semigroups

All Science Journal Classification (ASJC) codes

  • General Mathematics

Fingerprint

Dive into the research topics of 'Construction of Infinite Finitely Presented Nilsemigroup'. Together they form a unique fingerprint.

Cite this