- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1432-1297
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Algorithms determining finite simple images of finitely presented groups ; volume:218 ; number:2 ; day:30 ; month:5 ; year:2019 ; pages:623-648 ; date:11.2019
Inventiones mathematicae ; 218, Heft 2 (30.5.2019), 623-648, 11.2019
- Creator
-
Bridson, Martin R.
Evans, David M.
Liebeck, Martin W.
Segal, Dan
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00222-019-00892-3
- URN
-
urn:nbn:de:101:1-2020020320241574510952
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:58 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bridson, Martin R.
- Evans, David M.
- Liebeck, Martin W.
- Segal, Dan
- SpringerLink (Online service)
Other Objects (12)
DETERMINING IDEALS OF A GIVEN FINITE INDEX IN A FINITELY PRESENTED SEMIGROUP
Computation with finitely L-presented groups
Subgroups of almost finitely presented groups
Amenable groups without finitely presented amenable covers
An L3-U3-quotient algorithm for finitely presented groups
Some remarks on finitely presented monoids with automatic structure
Virtually special non-finitely presented groups via linear characters
An L3-U3-quotient algorithm for finitely presented groups
Finitely and non-finitely related words
Separable algebras over infinite fields are 2-generated and finitely presented
Arithmetic groups over function fields : a complete characterization of finitely generated and finitely presented arithmetic subgroups of reductive algebraic groups
Kantorovich–Rubinstein Distance and Barycenter for Finitely Supported Measures: Foundations and Algorithms
DETERMINING IDEALS OF A GIVEN FINITE INDEX IN A FINITELY PRESENTED SEMIGROUP
Computation with finitely L-presented groups
Subgroups of almost finitely presented groups
Amenable groups without finitely presented amenable covers
An L3-U3-quotient algorithm for finitely presented groups
Some remarks on finitely presented monoids with automatic structure
Virtually special non-finitely presented groups via linear characters
An L3-U3-quotient algorithm for finitely presented groups
Finitely and non-finitely related words
Separable algebras over infinite fields are 2-generated and finitely presented
Arithmetic groups over function fields : a complete characterization of finitely generated and finitely presented arithmetic subgroups of reductive algebraic groups
Kantorovich–Rubinstein Distance and Barycenter for Finitely Supported Measures: Foundations and Algorithms
DETERMINING IDEALS OF A GIVEN FINITE INDEX IN A FINITELY PRESENTED SEMIGROUP
Computation with finitely L-presented groups
Subgroups of almost finitely presented groups
Amenable groups without finitely presented amenable covers
An L3-U3-quotient algorithm for finitely presented groups
Some remarks on finitely presented monoids with automatic structure
Virtually special non-finitely presented groups via linear characters
An L3-U3-quotient algorithm for finitely presented groups
Finitely and non-finitely related words
Separable algebras over infinite fields are 2-generated and finitely presented
Arithmetic groups over function fields : a complete characterization of finitely generated and finitely presented arithmetic subgroups of reductive algebraic groups