A construction which can be used to produce finitely presented infinite simple groups

DOI10.1016/0021-8693(84)90172-8zbMATH Open0544.20027OpenAlexW1977665851MaRDI QIDQ796644FDOQ796644

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

zbMATH Keywords

finitely presented simple groupscofinite isomorphismsderived group of finite indexinescapable isomorphismsinverse limits of wreath products

Mathematics Subject Classification ID

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

• Title not available (Why is that?)
• Subgroups of finitely presented groups
• The embedding of certain linear and Abelian groups in finitely presented simple groups

Cited In (26)

• Orthogonal Completions of the Polycyclic Monoids
• THE ${\mathcal R}$- AND ${\mathcal L}$-ORDERS OF THE THOMPSON–HIGMAN MONOID M_{k, 1} AND THEIR COMPLEXITY
• FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY
• Higher dimensional generalizations of the Thompson groups
• The Polycyclic MonoidsP_nand the Thompson GroupsV_n,1
• A finitely presented simple group with unsolvable conjugacy problem
• A CORRESPONDENCE BETWEEN BALANCED VARIETIES AND INVERSE MONOIDS
• 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?)
• The word problem of the Brin-Thompson group is \textsf{coNP}-complete
• CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS
• The Polycyclic Inverse Monoids and the Thompson Groups Revisited
• Finite generation and presentability of wreath products of monoids.
• Monoids that map onto the Thompson-Higman groups
• THE THOMPSON–HIGMAN MONOIDS M_k,i: THE ${\mathcal J}$-ORDER, THE ${\mathcal D}$-RELATION, AND THEIR COMPLEXITY
• 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
• 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
• Some embeddings between symmetric R. thompson groups

Recommendations

• A finitely generated simple group with free 2-generated subgroups 👍 👎
• Finiteness properties of groups 👍 👎
• 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 👍 👎
• Analysing finitely presented groups by constructing representations 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)