On the decidability of some problems in special classes of groups
A. Mostowski (1966)
Fundamenta Mathematicae
Similarity:
Displaying similar documents to “The word problem in polycyclic groups is elementary”
On the decidability of some problems in special classes of groups
A note on recursively enumerable predicates in groups
Paul Schupp (1970)
Fundamenta Mathematicae
Similarity:
On Some Classes Of Unrecognizable Properties Of Groups
Nataša B. Božinović (1979)
Publications de l'Institut Mathématique
Similarity:
Experimenting with infinite groups. I.
Baumslag, Gilbert, Cleary, Sean, Havas, George (2004)
Experimental Mathematics
Similarity:
First Order Classes of Groups Having no Groups With a Given Property
Nataša Božović (1985)
Publications de l'Institut Mathématique
Similarity:
Equations in simple matrix groups: algebra, geometry, arithmetic, dynamics
Tatiana Bandman, Shelly Garion, Boris Kunyavskiĭ (2014)
Open Mathematics
Similarity:
We present a survey of results on word equations in simple groups, as well as their analogues and generalizations, which were obtained over the past decade using various methods: group-theoretic and coming from algebraic and arithmetic geometry, number theory, dynamical systems and computer algebra. Our focus is on interrelations of these machineries which led to numerous spectacular achievements, including solutions of several long-standing problems.
Conjugacy pinched and cyclically pinched one-relator groups.
Benjamin Fine, Gerhard Rosenberger, Michael Stille (1997)
Revista Matemática de la Universidad Complutense de Madrid
Similarity:
Here we consider two classes of torsion-free one-relator groups which have proved quite amenable to study-the cyclically pinched one-relator groups and the conjugacy pinched one-relator groups. The former is the class of groups which are free products of free groups with cyclic amalgamations while the latter is the class of HNN extensions of free groups with cyclic associated subgroups. Both are generalizations of surface groups. We compare and contrast results in these classes relative...
Algorithmic problems related to the direct product of groups.
Božović, Nataša, Krstić, Sava (1985)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Residually finite groups with the same finite images
Gilbert Baumslag (1974)
Compositio Mathematica
Similarity:
Monoid presentations of groups by finite special string-rewriting systems
Duncan W. Parkes, V. Yu. Shavrukov, Richard M. Thomas (2004)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We show that the class of groups which have monoid presentations by means of finite special -confluent string-rewriting systems strictly contains the class of plain groups (the groups which are free products of a finitely generated free group and finitely many finite groups), and that any group which has an infinite cyclic central subgroup can be presented by such a string-rewriting system if and only if it is the direct product of an infinite cyclic group and a finite cyclic group. ...