scholarly journals The SQ-universality of some finitely presented groups

1973 ◽  
Vol 16 (1) ◽  
pp. 1-6 ◽  
Author(s):  
Peter M. Neumann
Keyword(s):  
Free Group ◽  
Finite Index ◽  
Countable Group ◽  
Factor Group ◽  
Finitely Presented Groups ◽  
Rank 2 ◽  
Finitely Presented

Following a suggestion of G. Higman we say that the group G is SQ-universal if every countable group is embeddable in some factor group of G. It is a well-known theorem of G. Higman, B. H. Neumann and Hanna Neumann that the free group of rank 2 is sq-universal in this sense. Several different proofs are now available (see, for example, [1] or [9]). It is my intention to prove the LEmma. If H is a subgroup of finite index in a group G, then G is SQ-universal if and only if H is SQ-universal.

VERIFYING THAT A GROUP IS VIRTUALLY FREE

1991 ◽  
Vol 01 (03) ◽  
pp. 339-351
Author(s):  
ROBERT H. GILMAN
Keyword(s):  
Finite Index ◽  
Free Subgroup ◽  
Universal Group ◽  
Finitely Presented Groups ◽  
Finite Presentation ◽  
Finitely Presented

This paper is concerned with computation in finitely presented groups. We discuss a procedure for showing that a finite presentation presents a group with a free subgroup of finite index, and we give methods for solving various problems in such groups. Our procedure works by constructing a particular kind of partial groupoid whose universal group is isomorphic to the group presented. When the procedure succeeds, the partial groupoid can be used as an aid to computation in the group.

scholarly journals Groups of p-deficiency one

2013 ◽  
Vol 156 (1) ◽  
pp. 115-121
Author(s):  
ANITHA THILLAISUNDARAM
Keyword(s):  
Finite Index ◽  
Index Subgroup ◽  
P Deficiency ◽  
Finitely Presented Groups ◽  
Finite Presentation ◽  
Finite Index Subgroup ◽  
Finitely Presented

AbstractIn a previous paper, Button and Thillaisundaram proved that all finitely presented groups of p-deficiency greater than one are p-large. Here we prove that groups with a finite presentation of p-deficiency one possess a finite index subgroup that surjects onto the integers. This implies that these groups do not have Kazhdan's property (T). Additionally, we show that the aforementioned result of Button and Thillaisundaram implies a result of Lackenby.

Separating Classes of Groups by First-Order Sentences

2003 ◽  
Vol 13 (03) ◽  
pp. 287-302 ◽  
Author(s):  
André Nies
Keyword(s):  
Nilpotent Group ◽  
Word Problem ◽  
Finitely Generated ◽  
Finitely Presented Groups ◽  
First Order ◽  
Solvable Word Problem ◽  
Rank 2 ◽  
Finitely Presented ◽  
Solvable Word

For various proper inclusions of classes of groups [Formula: see text], we obtain a group [Formula: see text] and a first-order sentence φ such that H⊨φ but no G∈ C satisfies φ. The classes we consider include the finite, finitely presented, finitely generated with and without solvable word problem, and all countable groups. For one separation, we give an example of a f.g. group, namely ℤp ≀ ℤ for some prime p, which is the only f.g. group satisfying an appropriate first-order sentence. A further example of such a group, the free step-2 nilpotent group of rank 2, is used to show that true arithmetic Th(ℕ,+,×) can be interpreted in the theory of the class of finitely presented groups and other classes of f.g. groups.

scholarly journals SUBGROUPS OF FINITELY PRESENTED GROUPS WITH SOLVABLE CONJUGACY PROBLEM

2005 ◽  
Vol 15 (05n06) ◽  
pp. 1075-1084 ◽  
Author(s):  
ALEXANDER YU. OLSHANSKII ◽  
MARK V. SAPIR
Keyword(s):  
Conjugacy Problem ◽  
Countable Group ◽  
Finitely Presented Groups ◽  
Power Problem ◽  
Finitely Presented

We prove that every countable group with solvable power problem embeds into a finitely presented 2-generated group with solvable power and conjugacy problems.

scholarly journals On the “largeness” of one-relator groups

1986 ◽  
Vol 29 (2) ◽  
pp. 263-269
Author(s):  
M. Edjvet
Keyword(s):  
Free Group ◽  
Finite Index ◽  
One Relator Groups ◽  
Rank 2

If G is a one-relator group on at least 3 generators, or is a one-relator group with torsion on at least 2 generators, then it follows from results in [1] and [6] that G has a subgroup of finite index which can be mapped homomorphically onto F2, the free group of rank 2. In the language of [2], G is equally as large as F2, written G⋍F2.

scholarly journals Normal subgroups of SimpHAtic groups

2021 ◽  
pp. 1-20
Author(s):  
Damian Osajda
Keyword(s):  
Finite Index ◽  
Two Dimensional ◽  
Normal Subgroups ◽  
Group Extensions ◽  
Finitely Presented Groups ◽  
Homotopy Types ◽  
Helly Property ◽  
Simply Connected ◽  
Finitely Presented

A group is SimpHAtic if it acts geometrically on a simply connected simplicially hereditarily aspherical (SimpHAtic) complex. We show that finitely presented normal subgroups of the SimpHAtic groups are either: finite, or of finite index, or virtually free. This result applies, in particular, to normal subgroups of systolic groups. We prove similar strong restrictions on group extensions for other classes of asymptotically aspherical groups. The proof relies on studying homotopy types at infinity of groups in question. We also show that non-uniform lattices in SimpHAtic complexes (and in more general complexes) are not finitely presentable and that finitely presented groups acting properly on such complexes act geometrically on SimpHAtic complexes. In Appendix we present the topological two-dimensional quasi-Helly property of systolic complexes.

A. A. Fridman. Stépéni nérazréšimosti problémy toždéstva v konéčno oprédélénnyh gruppah. Doklady Akadémii Nauk SSSR, vol. 147 (1962), pp. 805–808. - A. A. Fridman. Degrees of insolvability of the word problem in finitely defined groups. English translation of the preceding by Sue Ann Walker. Soviet mathematics, vol. 3 no. 6 (1962), pp. 1733–1737. - C. R. J. Clapham. Finitely presented groups with word problems of arbitrary degrees of insolubility. Proceedings of the London Mathematical Society, ser. 3 vol. 14 (1964), pp. 633–676. - William W. Boone. Finitely presented group whose word problem has the same degree as that of an arbitrarily given Thue system (an application of methods of Britton). Proceedings of the National Academy of Sciences, vol. 53 (1965), pp. 265–269. - William W. Boone. Word problems and recursively enumerable degrees of unsolvability. A first paper on Thue systems. Annals of mathematics, ser. 2 vol. 83 (1966), pp. 520–571. - William W. Boone. Word problems and recursively enumerable degrees of unsolvability. A sequel on finitely presented groups. Annals of mathematics, ser. 2 vol. 84 (1966), pp. 49–84.

1968 ◽  
Vol 33 (2) ◽  
pp. 296-297
Author(s):  
J. C. Shepherdson
Keyword(s):  
Word Problem ◽  
Word Problems ◽  
Nauk Sssr ◽  
London Mathematical Society ◽  
National Academy Of Sciences ◽  
Doklady Akademii Nauk Sssr ◽  
Finitely Presented Groups ◽  
Recursively Enumerable ◽  
Finitely Presented ◽  
Degrees Of Unsolvability
Sign in / Sign up

Export Citation Format

Share Document