Remembering Mark Sapir

DOI10.4171/JCA/109MaRDI QIDQ6996152zbMATH OpenFDO

Authors J.-C. Birget, Gili Golan, Alexander Y. Olshanskii, M. V. Volkov

Publication date 16 April 2025

Published in Journal of Combinatorial Algebra (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4171/JCA/109

zbMATH Keywords

Burnside problems for semigroupsDehn functionsS-machines

Mathematics Subject Classification ID

Biographies, obituaries, personalia, bibliographies (01A70) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Geometric group theory (20F65) Varieties and pseudovarieties of semigroups (20M07)

Review text

Mark Sapir (February 12, 1957--October 8, 2022) was a brilliant mathematician whose main research areas included semigroup theory, geometric group theory and combinatorial algebra. His early work concerned mainly semigroup theory, while in geometric group theory he made major contributions to the classification of Dehn functions of finitely presented groups, to the complexity of the word problem and to the asymptotic geometry of relatively hyperbolic groups. He also introduced the notion of diagram groups, offering new perspectives on Thompson groups.\N\NBesides the authors, the article features personal and historical recollections contributed by Victor Guba, Olga Kharlampovich, Simon Goberstein, Stuart Margolis, Lev Shneerson, John Meakin, Ilya Kapovich, Eugene Plotkin, Michael Mihalik, Samuel Corson and Arman Darbinyan.

Cites work

• Algorithmic problems for finite groups and finite \(0\)-simple semigroups
• CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
• Conjugacy problem in groups with quadratic Dehn function
• scientific article; zbMATH DE number 988810 (Why is no real title available?)
• Isoperimetric and isodiametric functions of groups
• Isoperimetric functions of groups and computational complexity of the word problem
• Non-amenable finitely presented torsion-by-cyclic groups.
• PROBLEMS OF BURNSIDE TYPE AND THE FINITE BASIS PROPERTY IN VARIETIES OF SEMIGROUPS
• Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
• Quasi-identities of finite semigroups and symbolic dynamics
• The conjugacy problem and Higman embeddings
• The restricted Burnside problem for varieties of semigroups
• There is only one gap in the isoperimetric spectrum
• Topology of finite graphs
• Unending chess, symbolic dynamics and a problem in semi-groups

Cited in

(1)

• On zero-measured subsets of Thompson's group F

This page was built for publication: Remembering Mark Sapir

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6996152)