Preserving Torsion Orders When Embedding Into Groups Withsmall
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
18.703 Modern Algebra, Presentations and Groups of Small
12. Presentations and Groups of small order Definition-Lemma 12.1. Let A be a set. A word in A is a string of 0 elements of A and their inverses. We say that the word w is obtained 0 from w by a reduction, if we can get from w to w by repeatedly applying the following rule, −1 −1 • replace aa (or a a) by the empty string. 0 Given any word w, the reduced word w associated to w is any 0 word obtained from w by reduction, such that w cannot be reduced any further. Given two words w1 and w2 of A, the concatenation of w1 and w2 is the word w = w1w2. The empty word is denoted e. The set of all reduced words is denoted FA. With product defined as the reduced concatenation, this set becomes a group, called the free group with generators A. It is interesting to look at examples. Suppose that A contains one element a. An element of FA = Fa is a reduced word, using only a and a−1 . The word w = aaaa−1 a−1 aaa is a string using a and a−1. Given any such word, we pass to the reduction w0 of w. This means cancelling as much as we can, and replacing strings of a’s by the corresponding power. Thus w = aaa −1 aaa = aaaa = a 4 = w0 ; where equality means up to reduction. Thus the free group on one generator is isomorphic to Z. The free group on two generators is much more complicated and it is not abelian. -
Some Remarks on Semigroup Presentations
SOME REMARKS ON SEMIGROUP PRESENTATIONS B. H. NEUMANN Dedicated to H. S. M. Coxeter 1. Let a semigroup A be given by generators ai, a2, . , ad and defining relations U\ — V\yu2 = v2, ... , ue = ve between these generators, the uu vt being words in the generators. We then have a presentation of A, and write A = sgp(ai, . , ad, «i = vu . , ue = ve). The same generators with the same relations can also be interpreted as the presentation of a group, for which we write A* = gpOi, . , ad\ «i = vu . , ue = ve). There is a unique homomorphism <£: A—* A* which maps each generator at G A on the same generator at G 4*. This is a monomorphism if, and only if, A is embeddable in a group; and, equally obviously, it is an epimorphism if, and only if, the image A<j> in A* is a group. This is the case in particular if A<j> is finite, as a finite subsemigroup of a group is itself a group. Thus we see that A(j> and A* are both finite (in which case they coincide) or both infinite (in which case they may or may not coincide). If A*, and thus also Acfr, is finite, A may be finite or infinite; but if A*, and thus also A<p, is infinite, then A must be infinite too. It follows in particular that A is infinite if e, the number of defining relations, is strictly less than d, the number of generators. 2. We now assume that d is chosen minimal, so that A cannot be generated by fewer than d elements. -
An Ascending Hnn Extension
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 134, Number 11, November 2006, Pages 3131–3136 S 0002-9939(06)08398-5 Article electronically published on May 18, 2006 AN ASCENDING HNN EXTENSION OF A FREE GROUP INSIDE SL2 C DANNY CALEGARI AND NATHAN M. DUNFIELD (Communicated by Ronald A. Fintushel) Abstract. We give an example of a subgroup of SL2 C which is a strictly ascending HNN extension of a non-abelian finitely generated free group F .In particular, we exhibit a free group F in SL2 C of rank 6 which is conjugate to a proper subgroup of itself. This answers positively a question of Drutu and Sapir (2005). The main ingredient in our construction is a specific finite volume (non-compact) hyperbolic 3-manifold M which is a surface bundle over the circle. In particular, most of F comes from the fundamental group of a surface fiber. A key feature of M is that there is an element of π1(M)inSL2 C with an eigenvalue which is the square root of a rational integer. We also use the Bass-Serre tree of a field with a discrete valuation to show that the group F we construct is actually free. 1. Introduction Suppose φ: F → F is an injective homomorphism from a group F to itself. The associated HNN extension H = G, t tgt−1 = φ(g)forg ∈ G is said to be ascending; this extension is called strictly ascending if φ is not onto. In [DS], Drutu and Sapir give examples of residually finite 1-relator groups which are not linear; that is, they do not embed in GLnK for any field K and dimension n. -
Knapsack Problems in Groups
MATHEMATICS OF COMPUTATION Volume 84, Number 292, March 2015, Pages 987–1016 S 0025-5718(2014)02880-9 Article electronically published on July 30, 2014 KNAPSACK PROBLEMS IN GROUPS ALEXEI MYASNIKOV, ANDREY NIKOLAEV, AND ALEXANDER USHAKOV Abstract. We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the bounded submonoid membership problem, are P-time decidable in hyperbolic groups and give var- ious examples of finitely presented groups where the subset sum problem is NP-complete. 1. Introduction 1.1. Motivation. This is the first in a series of papers on non-commutative discrete (combinatorial) optimization. In this series we propose to study complexity of the classical discrete optimization (DO) problems in their most general form — in non- commutative groups. For example, DO problems concerning integers (subset sum, knapsack problem, etc.) make perfect sense when the group of additive integers is replaced by an arbitrary (non-commutative) group G. The classical lattice problems are about subgroups (integer lattices) of the additive groups Zn or Qn, their non- commutative versions deal with arbitrary finitely generated subgroups of a group G. The travelling salesman problem or the Steiner tree problem make sense for arbitrary finite subsets of vertices in a given Cayley graph of a non-commutative infinite group (with the natural graph metric). The Post correspondence problem carries over in a straightforward fashion from a free monoid to an arbitrary group. This list of examples can be easily extended, but the point here is that many classical DO problems have natural and interesting non-commutative versions. -
Bounded Depth Ascending HNN Extensions and Π1-Semistability at ∞ Arxiv:1709.09140V1
Bounded Depth Ascending HNN Extensions and π1-Semistability at 1 Michael Mihalik June 29, 2021 Abstract A 1-ended finitely presented group has semistable fundamental group at 1 if it acts geometrically on some (equivalently any) simply connected and locally finite complex X with the property that any two proper rays in X are properly homotopic. If G has semistable fun- damental group at 1 then one can unambiguously define the funda- mental group at 1 for G. The problem, asking if all finitely presented groups have semistable fundamental group at 1 has been studied for over 40 years. If G is an ascending HNN extension of a finitely pre- sented group then indeed, G has semistable fundamental group at 1, but since the early 1980's it has been suggested that the finitely pre- sented groups that are ascending HNN extensions of finitely generated groups may include a group with non-semistable fundamental group at 1. Ascending HNN extensions naturally break into two classes, those with bounded depth and those with unbounded depth. Our main theorem shows that bounded depth finitely presented ascending HNN extensions of finitely generated groups have semistable fundamental group at 1. Semistability is equivalent to two weaker asymptotic con- arXiv:1709.09140v1 [math.GR] 26 Sep 2017 ditions on the group holding simultaneously. We show one of these conditions holds for all ascending HNN extensions, regardless of depth. We give a technique for constructing ascending HNN extensions with unbounded depth. This work focuses attention on a class of groups that may contain a group with non-semistable fundamental group at 1. -
Combinatorial Group Theory
Combinatorial Group Theory Charles F. Miller III March 5, 2002 Abstract These notes were prepared for use by the participants in the Workshop on Algebra, Geometry and Topology held at the Australian National University, 22 January to 9 February, 1996. They have subsequently been updated for use by students in the subject 620-421 Combinatorial Group Theory at the University of Melbourne. Copyright 1996-2002 by C. F. Miller. Contents 1 Free groups and presentations 3 1.1 Free groups . 3 1.2 Presentations by generators and relations . 7 1.3 Dehn’s fundamental problems . 9 1.4 Homomorphisms . 10 1.5 Presentations and fundamental groups . 12 1.6 Tietze transformations . 14 1.7 Extraction principles . 15 2 Construction of new groups 17 2.1 Direct products . 17 2.2 Free products . 19 2.3 Free products with amalgamation . 21 2.4 HNN extensions . 24 3 Properties, embeddings and examples 27 3.1 Countable groups embed in 2-generator groups . 27 3.2 Non-finite presentability of subgroups . 29 3.3 Hopfian and residually finite groups . 31 4 Subgroup Theory 35 4.1 Subgroups of Free Groups . 35 4.1.1 The general case . 35 4.1.2 Finitely generated subgroups of free groups . 35 4.2 Subgroups of presented groups . 41 4.3 Subgroups of free products . 43 4.4 Groups acting on trees . 44 5 Decision Problems 45 5.1 The word and conjugacy problems . 45 5.2 Higman’s embedding theorem . 51 1 5.3 The isomorphism problem and recognizing properties . 52 2 Chapter 1 Free groups and presentations In introductory courses on abstract algebra one is likely to encounter the dihedral group D3 consisting of the rigid motions of an equilateral triangle onto itself. -
Beyond Serre's" Trees" in Two Directions: $\Lambda $--Trees And
Beyond Serre’s “Trees” in two directions: Λ–trees and products of trees Olga Kharlampovich,∗ Alina Vdovina† October 31, 2017 Abstract Serre [125] laid down the fundamentals of the theory of groups acting on simplicial trees. In particular, Bass-Serre theory makes it possible to extract information about the structure of a group from its action on a simplicial tree. Serre’s original motivation was to understand the structure of certain algebraic groups whose Bruhat–Tits buildings are trees. In this survey we will discuss the following generalizations of ideas from [125]: the theory of isometric group actions on Λ-trees and the theory of lattices in the product of trees where we describe in more detail results on arithmetic groups acting on a product of trees. 1 Introduction Serre [125] laid down the fundamentals of the theory of groups acting on sim- plicial trees. The book [125] consists of two parts. The first part describes the basics of what is now called Bass-Serre theory. This theory makes it possi- ble to extract information about the structure of a group from its action on a simplicial tree. Serre’s original motivation was to understand the structure of certain algebraic groups whose Bruhat–Tits buildings are trees. These groups are considered in the second part of the book. Bass-Serre theory states that a group acting on a tree can be decomposed arXiv:1710.10306v1 [math.GR] 27 Oct 2017 (splits) as a free product with amalgamation or an HNN extension. Such a group can be represented as a fundamental group of a graph of groups. -
Torsion, Torsion Length and Finitely Presented Groups 11
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Apollo TORSION, TORSION LENGTH AND FINITELY PRESENTED GROUPS MAURICE CHIODO AND RISHI VYAS Abstract. We show that a construction by Aanderaa and Cohen used in their proof of the Higman Embedding Theorem preserves torsion length. We give a new construction showing that every finitely presented group is the quotient of some C′(1~6) finitely presented group by the subgroup generated by its torsion elements. We use these results to show there is a finitely presented group with infinite torsion length which is C′(1~6), and thus word-hyperbolic and virtually torsion-free. 1. Introduction It is well known that the set of torsion elements in a group G, Tor G , is not necessarily a subgroup. One can, of course, consider the subgroup Tor1 G generated by the set of torsion elements in G: this subgroup is always normal( ) in G. ( ) The subgroup Tor1 G has been studied in the literature, with a particular focus on its structure in the context of 1-relator groups. For example, suppose G is presented by a 1-relator( ) presentation P with cyclically reduced relator Rk where R is not a proper power, and let r denote the image of R in G. Karrass, Magnus, and Solitar proved ([17, Theorem 3]) that r has order k and that every torsion element in G is a conjugate of some power of r; a more general statement can be found in [22, Theorem 6]. As immediate corollaries, we see that Tor1 G is precisely the normal closure of r, and that G Tor1 G is torsion-free. -
Compressed Word Problems in HNN-Extensions and Amalgamated Products
Compressed word problems in HNN-extensions and amalgamated products Niko Haubold and Markus Lohrey Institut f¨ur Informatik, Universit¨atLeipzig {haubold,lohrey}@informatik.uni-leipzig.de Abstract. It is shown that the compressed word problem for an HNN- −1 extension hH,t | t at = ϕ(a)(a ∈ A)i with A finite is polynomial time Turing-reducible to the compressed word problem for the base group H. An analogous result for amalgamated free products is shown as well. 1 Introduction Since it was introduced by Dehn in 1910, the word problem for groups has emerged to a fundamental computational problem linking group theory, topol- ogy, mathematical logic, and computer science. The word problem for a finitely generated group G asks, whether a given word over the generators of G represents the identity of G, see Section 2 for more details. Dehn proved the decidability of the word problem for surface groups. On the other hand, 50 years after the appearance of Dehn’s work, Novikov and independently Boone proved the exis- tence of a finitely presented group with undecidable word problem, see [10] for references. However, many natural classes of groups with decidable word prob- lem are known, as for instance finitely generated linear groups, automatic groups and one-relator groups. With the rise of computational complexity theory, also the complexity of the word problem became an active research area. This devel- opment has gained further attention by potential applications of combinatorial group theory for secure cryptographic systems [11]. In order to prove upper bounds on the complexity of the word problem for a group G, a “compressed” variant of the word problem for G was introduced in [6, 7, 14]. -
Deforming Discrete Groups Into Lie Groups
Deforming discrete groups into Lie groups March 18, 2019 2 General motivation The framework of the course is the following: we start with a semisimple Lie group G. We will come back to the precise definition. For the moment, one can think of the following examples: • The group SL(n; R) n × n matrices of determinent 1, n • The group Isom(H ) of isometries of the n-dimensional hyperbolic space. Such a group can be seen as the transformation group of certain homoge- neous spaces, meaning that G acts transitively on some manifold X. A pair (G; X) is what Klein defines as “a geometry” in its famous Erlangen program [Kle72]. For instance: n n • SL(n; R) acts transitively on the space P(R ) of lines inR , n n • The group Isom(H ) obviously acts on H by isometries, but also on n n−1 @1H ' S by conformal transformations. On the other side, we consider a group Γ, preferably of finite type (i.e. admitting a finite generating set). Γ may for instance be the fundamental group of a compact manifold (possibly with boundary). We will be interested in representations (i.e. homomorphisms) from Γ to G, and in particular those representations for which the intrinsic geometry of Γ and that of G interact well. Such representations may not exist. Indeed, there are groups of finite type for which every linear representation is trivial ! This groups won’t be of much interest for us here. We will often start with a group of which we know at least one “geometric” representation. -
Combinatorial Group Theory
Combinatorial Group Theory Charles F. Miller III 7 March, 2004 Abstract An early version of these notes was prepared for use by the participants in the Workshop on Algebra, Geometry and Topology held at the Australian National University, 22 January to 9 February, 1996. They have subsequently been updated and expanded many times for use by students in the subject 620-421 Combinatorial Group Theory at the University of Melbourne. Copyright 1996-2004 by C. F. Miller III. Contents 1 Preliminaries 3 1.1 About groups . 3 1.2 About fundamental groups and covering spaces . 5 2 Free groups and presentations 11 2.1 Free groups . 12 2.2 Presentations by generators and relations . 16 2.3 Dehn’s fundamental problems . 19 2.4 Homomorphisms . 20 2.5 Presentations and fundamental groups . 22 2.6 Tietze transformations . 24 2.7 Extraction principles . 27 3 Construction of new groups 30 3.1 Direct products . 30 3.2 Free products . 32 3.3 Free products with amalgamation . 36 3.4 HNN extensions . 43 3.5 HNN related to amalgams . 48 3.6 Semi-direct products and wreath products . 50 4 Properties, embeddings and examples 53 4.1 Countable groups embed in 2-generator groups . 53 4.2 Non-finite presentability of subgroups . 56 4.3 Hopfian and residually finite groups . 58 4.4 Local and poly properties . 61 4.5 Finitely presented coherent by cyclic groups . 63 1 5 Subgroup Theory 68 5.1 Subgroups of Free Groups . 68 5.1.1 The general case . 68 5.1.2 Finitely generated subgroups of free groups . -
Chapter 1 GENERAL STRUCTURE and PROPERTIES
Chapter 1 GENERAL STRUCTURE AND PROPERTIES 1.1 Introduction In this Chapter we would like to introduce the main de¯nitions and describe the main properties of groups, providing examples to illustrate them. The detailed discussion of representations is however demanded to later Chapters, and so is the treatment of Lie groups based on their relation with Lie algebras. We would also like to introduce several explicit groups, or classes of groups, which are often encountered in Physics (and not only). On the one hand, these \applications" should motivate the more abstract study of the general properties of groups; on the other hand, the knowledge of the more important and common explicit instances of groups is essential for developing an e®ective understanding of the subject beyond the purely formal level. 1.2 Some basic de¯nitions In this Section we give some essential de¯nitions, illustrating them with simple examples. 1.2.1 De¯nition of a group A group G is a set equipped with a binary operation , the group product, such that1 ¢ (i) the group product is associative, namely a; b; c G ; a (b c) = (a b) c ; (1.2.1) 8 2 ¢ ¢ ¢ ¢ (ii) there is in G an identity element e: e G such that a e = e a = a a G ; (1.2.2) 9 2 ¢ ¢ 8 2 (iii) each element a admits an inverse, which is usually denoted as a¡1: a G a¡1 G such that a a¡1 = a¡1 a = e : (1.2.3) 8 2 9 2 ¢ ¢ 1 Notice that the axioms (ii) and (iii) above are in fact redundant.