A construction which can be used to produce finitely presented infinite simple groups
DOI10.1016/0021-8693(84)90172-8zbMATH Open0544.20027OpenAlexW1977665851MaRDI QIDQ796644FDOQ796644
Authors: E. Scott
Publication date: 1984
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-8693(84)90172-8
Recommendations
- scientific article; zbMATH DE number 67427
- scientific article; zbMATH DE number 5955584
- Analysing finitely presented groups by constructing representations
- A finitely presented simple group with unsolvable conjugacy problem
- A simple non-bisimple congruence-free finitely presented monoid.
- The infinite simple group \(V\) of Richard J. Thompson: presentations by permutations
- scientific article; zbMATH DE number 3912613
- scientific article; zbMATH DE number 1910391
- A finitely generated simple group with free 2-generated subgroups
- Finiteness properties of groups
finitely presented simple groupscofinite isomorphismsderived group of finite indexinescapable isomorphismsinverse limits of wreath products
Generators, relations, and presentations of groups (20F05) Subgroup theorems; subgroup growth (20E07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Simple groups (20E32)
Cites Work
Cited In (28)
- The polycyclic inverse monoids and the Thompson groups revisited
- Orthogonal Completions of the Polycyclic Monoids
- FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY
- Higher dimensional generalizations of the Thompson groups
- The Polycyclic MonoidsPnand the Thompson GroupsVn,1
- Some embeddings between symmetric R.\ Thompson groups
- A finitely presented simple group with unsolvable conjugacy problem
- A CORRESPONDENCE BETWEEN BALANCED VARIETIES AND INVERSE MONOIDS
- A finitely presented torsion-free simple group
- New embeddings between the Higman-Thompson groups
- The isomorphism problem for Higman-Thompson groups.
- THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY
- Title not available (Why is that?)
- A finitely generated simple group with free 2-generated subgroups
- The word problem of the Brin-Thompson group is \textsf{coNP}-complete
- CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS
- Finite generation and presentability of wreath products of monoids.
- Monoids that map onto the Thompson-Higman groups
- Monoid generalizations of the Richard Thompson groups.
- One-way permutations, computational asymmetry and distortion.
- Title not available (Why is that?)
- Constructing finitely presented simple groups that contain Grigorchuk groups
- The \(\mathcal R\)- and \(\mathcal L\)-orders of the Thompson-Higman monoid \(M_{k,1}\) and their complexity.
- The Thompson-Higman monoids \(M_{k,i}\): the \(\mathcal J\)-order, the \(\mathcal D\)-relation, and their complexity.
- Some isomorphism results for Thompson-like groups \(V_n(G)\)
- Isomorphisms of Brin-Higman-Thompson groups.
- Semigroups and one-way functions
- The embedding of certain linear and Abelian groups in finitely presented simple groups
This page was built for publication: A construction which can be used to produce finitely presented infinite simple groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796644)