Combinatorial and Geometric Group Theory
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Filling Functions Notes for an Advanced Course on the Geometry of the Word Problem for Finitely Generated Groups Centre De Recer
Filling Functions Notes for an advanced course on The Geometry of the Word Problem for Finitely Generated Groups Centre de Recerca Mathematica` Barcelona T.R.Riley July 2005 Revised February 2006 Contents Notation vi 1Introduction 1 2Fillingfunctions 5 2.1 Van Kampen diagrams . 5 2.2 Filling functions via van Kampen diagrams . .... 6 2.3 Example: combable groups . 10 2.4 Filling functions interpreted algebraically . ......... 15 2.5 Filling functions interpreted computationally . ......... 16 2.6 Filling functions for Riemannian manifolds . ...... 21 2.7 Quasi-isometry invariance . .22 3Relationshipsbetweenfillingfunctions 25 3.1 The Double Exponential Theorem . 26 3.2 Filling length and duality of spanning trees in planar graphs . 31 3.3 Extrinsic diameter versus intrinsic diameter . ........ 35 3.4 Free filling length . 35 4Example:nilpotentgroups 39 4.1 The Dehn and filling length functions . .. 39 4.2 Open questions . 42 5Asymptoticcones 45 5.1 The definition . 45 5.2 Hyperbolic groups . 47 5.3 Groups with simply connected asymptotic cones . ...... 53 5.4 Higher dimensions . 57 Bibliography 68 v Notation f, g :[0, ∞) → [0, ∞)satisfy f ≼ g when there exists C > 0 such that f (n) ≤ Cg(Cn+ C) + Cn+ C for all n,satisfy f ≽ g ≼, ≽, ≃ when g ≼ f ,andsatisfy f ≃ g when f ≼ g and g ≼ f .These relations are extended to functions f : N → N by considering such f to be constant on the intervals [n, n + 1). ab, a−b,[a, b] b−1ab, b−1a−1b, a−1b−1ab Cay1(G, X) the Cayley graph of G with respect to a generating set X Cay2(P) the Cayley 2-complex of a -
Arxiv:1701.04633V1 [Math.NT]
COUNTING IDEALS IN POLYNOMIAL RINGS LENNY FUKSHANSKY, STEFAN KUHNLEIN,¨ AND REBECCA SCHWERDT Abstract. We investigate properties of zeta functions of polynomial rings and their quotients, generalizing and extending some classical results about Dedekind zeta functions of number fields. By an application of Delange’s version of the Ikehara Tauberian Theorem, we are then able to determine the asymptotic order of the ideal counting function in such rings. As a result, we produce counting estimates on ideal lattices of bounded determinant coming from fixed number fields, as well as density estimates for any ideal lattices among all sublattices of Zd. We conclude with some more general speculations and open questions. 1. Introduction A classical arithmetic problem in the theory of finitely generated groups and rings is the study of the asymptotic order of growth of the number of subgroups of bounded index. A common approach to this problem involves studying the analytic properties of a corresponding zeta function (a Dirichlet series generating function) and then applying a Tauberian theorem to deduce information about the number in question, represented by the coefficients of this zeta function. This research direction received a great deal of attention over the years as can be seen from [11], [8], [6], [7], [3], [17] and the references within. In the recent years, a similar approach has also been applied to the more geometric setting of counting sublattices in lattices, e.g. [15], [10], [9], [1], [14]. In this note, we consider some special cases of the following general setting. Let R be a commutative ring with identity such that for every natural number n the set of ideals in R of index n is a finite number, call this number an(R). -
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. -
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. -
WHAT IS Outer Space?
WHAT IS Outer Space? Karen Vogtmann To investigate the properties of a group G, it is with a metric of constant negative curvature, and often useful to realize G as a group of symmetries g : S ! X is a homeomorphism, called the mark- of some geometric object. For example, the clas- ing, which is well-defined up to isotopy. From this sical modular group P SL(2; Z) can be thought of point of view, the mapping class group (which as a group of isometries of the upper half-plane can be identified with Out(π1(S))) acts on (X; g) f(x; y) 2 R2j y > 0g equipped with the hyper- by composing the marking with a homeomor- bolic metric ds2 = (dx2 + dy2)=y2. The study of phism of S { the hyperbolic metric on X does P SL(2; Z) and its subgroups via this action has not change. By deforming the metric on X, on occupied legions of mathematicians for well over the other hand, we obtain a neighborhood of the a century. point (X; g) in Teichm¨uller space. We are interested here in the (outer) automor- phism group of a finitely-generated free group. u v Although free groups are the simplest and most fundamental class of infinite groups, their auto- u v u v u u morphism groups are remarkably complex, and v x w v many natural questions about them remain unan- w w swered. We will describe a geometric object On known as Outer space , which was introduced in w w u v [2] to study Out(Fn). -
Rostislav Grigorchuk Texas A&M University
CLAREMONT CENTER for MATHEMATICAL SCIENCES CCMSCOLLOQUIUM On Gap Conjecture for group growth and related topics by Rostislav Grigorchuk Texas A&M University Abstract: In this talk we will present a survey of results around the Gap Conjecture which was formulated by thep speaker in 1989. The conjecture states that if growth of a finitely generated group is less than e n, then it is polynomial. If proved, it will be a far reaching improvement of the Gromov's remarkable theorem describing groups of polynomial growth as virtually nilpotent groups. Old and new results around conjecture and its weaker and stronger forms will be formulated and discussed. About the speaker: Professor Grigorchuk received his undergraduate degree in 1975 and Ph.D. in 1978, both from Moscow State University, and a habilitation (Doctor of Science) degree in 1985 at the Steklov Institute of Mathematics in Moscow. During the 1980s and 1990s, Rostislav Grigorchuk held positions in Moscow, and in 2002 joined the faculty of Texas A&M University, where he is now a Distinguished Professor of Mathematics. Grigorchuk is especially famous for his celebrated construction of the first example of a finitely generated group of intermediate growth, thus answering an important problem posed by John Milnor in 1968. This group is now known as the Grigorchuk group, and is one of the important objects studied in geometric group theory. Grigorchuk has written over 100 research papers and monographs, had a number of Ph.D. students and postdocs, and serves on editorial boards of eight journals. He has given numerous talks and presentations, including an invited address at the 1990 International Congress of Mathematicians in Kyoto, an AMS Invited Address at the March 2004 meeting of the AMS in Athens, Ohio, and a plenary talk at the 2004 Winter Meeting of the Canadian Mathematical Society. -
Automorphism Groups of Free Groups, Surface Groups and Free Abelian Groups
Automorphism groups of free groups, surface groups and free abelian groups Martin R. Bridson and Karen Vogtmann The group of 2 × 2 matrices with integer entries and determinant ±1 can be identified either with the group of outer automorphisms of a rank two free group or with the group of isotopy classes of homeomorphisms of a 2-dimensional torus. Thus this group is the beginning of three natural sequences of groups, namely the general linear groups GL(n, Z), the groups Out(Fn) of outer automorphisms of free groups of rank n ≥ 2, and the map- ± ping class groups Mod (Sg) of orientable surfaces of genus g ≥ 1. Much of the work on mapping class groups and automorphisms of free groups is motivated by the idea that these sequences of groups are strongly analogous, and should have many properties in common. This program is occasionally derailed by uncooperative facts but has in general proved to be a success- ful strategy, leading to fundamental discoveries about the structure of these groups. In this article we will highlight a few of the most striking similar- ities and differences between these series of groups and present some open problems motivated by this philosophy. ± Similarities among the groups Out(Fn), GL(n, Z) and Mod (Sg) begin with the fact that these are the outer automorphism groups of the most prim- itive types of torsion-free discrete groups, namely free groups, free abelian groups and the fundamental groups of closed orientable surfaces π1Sg. In the ± case of Out(Fn) and GL(n, Z) this is obvious, in the case of Mod (Sg) it is a classical theorem of Nielsen. -
Arxiv:1510.00545V4 [Math.GR] 29 Jun 2016 7
SCHREIER GRAPHS OF GRIGORCHUK'S GROUP AND A SUBSHIFT ASSOCIATED TO A NON-PRIMITIVE SUBSTITUTION ROSTISLAV GRIGORCHUK, DANIEL LENZ, AND TATIANA NAGNIBEDA Abstract. There is a recently discovered connection between the spectral theory of Schr¨o- dinger operators whose potentials exhibit aperiodic order and that of Laplacians associated with actions of groups on regular rooted trees, as Grigorchuk's group of intermediate growth. We give an overview of corresponding results, such as different spectral types in the isotropic and anisotropic cases, including Cantor spectrum of Lebesgue measure zero and absence of eigenvalues. Moreover, we discuss the relevant background as well as the combinatorial and dynamical tools that allow one to establish the afore-mentioned connection. The main such tool is the subshift associated to a substitution over a finite alphabet that defines the group algebraically via a recursive presentation by generators and relators. Contents Introduction 2 1. Subshifts and aperiodic order in one dimension 3 2. Schr¨odingeroperators with aperiodic order 5 2.1. Constancy of the spectrum and the integrated density of states (IDS) 5 2.2. The spectrum as a set and the absolute continuity of spectral measures 9 2.3. Aperiodic order and discrete random Schr¨odingeroperators 10 3. The substitution τ, its finite words Subτ and its subshift (Ωτ ;T ) 11 3.1. The substitution τ and its subshift: basic features 11 3.2. The main ingredient for our further analysis: n-partition and n-decomposition 14 3.3. The maximal equicontinuous factor of the dynamical system (Ωτ ;T ) 15 3.4. Powers and the index (critical exponent) of Subτ 19 3.5. -
What Is the Grigorchuk Group?
WHAT IS THE GRIGORCHUK GROUP? JAKE HURYN Abstract. The Grigorchuk group was first constructed in 1980 by Rostislav Grigorchuk, defined as a set of measure-preserving maps on the unit interval. In this talk a simpler construction in terms of binary trees will be given, and some important properties of this group will be explored. In particular, we study it as a negative example to a variant of the Burnside problem posed in 1902, an example of a non-linear group, and the first discovered example of a group of intermediate growth. 1. The Infinite Binary Tree We will denote the infinite binary tree by T . The vertex set of T is all finite words in the alphabet f0; 1g, and two words have an edge between them if and only if deleting the rightmost letter of one of them yields the other: ? 0 1 00 01 10 11 . Figure 1. The infinite binary tree T . This will in fact be a rooted tree, with the root at the empty sequence, so that any automorphism of T must fix the empty sequence. Here are some exercises about Aut(T ), the group of automorphisms of T . In this paper, exercises are marked with either ∗ or ∗∗ based on difficulty. Most are taken from exercises or statements made in the referenced books. Exercise 1. Show that the group Aut(T ) is uncountable and has a subgroup iso- morphic to Aut(T ) × Aut(T ).∗ Exercise 2. Impose a topology on Aut(T ) to make it into a topological group home- omorphic to the Cantor set.∗∗ Exercise 3. -
On the Dehn Functions of K\" Ahler Groups
ON THE DEHN FUNCTIONS OF KAHLER¨ GROUPS CLAUDIO LLOSA ISENRICH AND ROMAIN TESSERA Abstract. We address the problem of which functions can arise as Dehn functions of K¨ahler groups. We explain why there are examples of K¨ahler groups with linear, quadratic, and exponential Dehn function. We then proceed to show that there is an example of a K¨ahler group which has Dehn function bounded below by a cubic function 6 and above by n . As a consequence we obtain that for a compact K¨ahler manifold having non-positive holomorphic bisectional curvature does not imply having quadratic Dehn function. 1. Introduction A K¨ahler group is a group which can be realized as fundamental group of a compact K¨ahler manifold. K¨ahler groups form an intriguing class of groups. A fundamental problem in the field is Serre’s question of “which” finitely presented groups are K¨ahler. While on one side there is a variety of constraints on K¨ahler groups, many of them originating in Hodge theory and, more generally, the theory of harmonic maps on K¨ahler manifolds, examples have been constructed that show that the class is far from trivial. Filling the space between examples and constraints turns out to be a very hard problem. This is at least in part due to the fact that the range of known concrete examples and construction techniques are limited. For general background on K¨ahler groups see [2] (and also [13, 4] for more recent results). Known constructions have shown that K¨ahler groups can present the following group theoretic properties: they can ● be non-residually finite [50] (see also [18]); ● be nilpotent of class 2 [14, 47]; ● admit a classifying space with finite k-skeleton, but no classifying space with finitely many k + 1-cells [23] (see also [5, 38, 12]); and arXiv:1807.03677v2 [math.GT] 7 Jun 2019 ● be non-coherent [33] (also [45, 27]). -
On Dehn Functions and Products of Groups
TRANSACTIONSof the AMERICANMATHEMATICAL SOCIETY Volume 335, Number 1, January 1993 ON DEHN FUNCTIONS AND PRODUCTS OF GROUPS STEPHEN G. BRICK Abstract. If G is a finitely presented group then its Dehn function—or its isoperimetric inequality—is of interest. For example, G satisfies a linear isoperi- metric inequality iff G is negatively curved (or hyperbolic in the sense of Gro- mov). Also, if G possesses an automatic structure then G satisfies a quadratic isoperimetric inequality. We investigate the effect of certain natural operations on the Dehn function. We consider direct products, taking subgroups of finite index, free products, amalgamations, and HNN extensions. 0. Introduction The study of isoperimetric inequalities for finitely presented groups can be approached in two different ways. There is the geometric approach (see [Gr]). Given a finitely presented group G, choose a compact Riemannian manifold M with fundamental group being G. Then consider embedded circles which bound disks in M, and search for a relationship between the length of the circle and the area of a minimal spanning disk. One can then triangulate M and take simplicial approximations, resulting in immersed disks. What was their area then becomes the number of two-cells in the image of the immersion counted with multiplicity. We are thus led to a combinatorial approach to the isoperimetric inequality (also see [Ge and CEHLPT]). We start by defining the Dehn function of a finite two-complex. Let K be a finite two-complex. If w is a circuit in K^, null-homotopic in K, then there is a Van Kampen diagram for w , i.e.