Research Statement Justin A. James Decision Problems in Group Theory

Size: px
Start display at page:

Download "Research Statement Justin A. James Decision Problems in Group Theory"

Transcription

1 Research Statement Justin A. James Decision Problems in Group Theory 1 Introduction In 1911, Dehn formulated three fundamental decision problems for groups: the word problem, the conjugacy problem, and the isomorphism problem [Deh]. Dehn proved that there are algorithms to decide each of these problems when G is the fundamental group of a closed 2-manifold. However, these problems are undecidable for finitely presented groups in general. The word problem for a group G given by a finite presentation G= A R asks if there is an algorithm which given any word (a finite length product in the generators and their inverses) determines whether or not the word represents the identity element in the group. Novikov in 1955 [Nov] and Boone in 1959 [Boo] independently proved that there is a finitely presented group with undecidable word problem. Since then, there has been much progress toward the goal of determining which classes of groups have decidable word problem and which have undecidable word problem, but many open questions remain. If we restrict our attention to finitely presented groups that have decidable word problem, there are several generalizations of the word problem one can consider (see [McC] and [LM]). These include: deciding membership in finitely generated subgroups (the generalized word problem), deciding membership in finitely generated submonoids (the submonoid membership problem), determining the order of an element of the group (the order problem), deciding whether or not one element of the group is a non-negative power of another element (the power problem), and deciding membership in rational subsets of the group (the rational membership problem). The rational subsets of a group are subsets built up from singleton sets by recursively applying the operations union, product, and monoid closure. Each of the generalizations of the word problem mentioned above are rational problems because they can be solved by deciding instances of the rational membership problem. These problems are known to be strictly harder than the word problem. That is, an algorithm deciding any one of these problems can also be used to decide the word problem. For each of these decision problems, there is an example of a finitely presented group for which the word problem is decidable and the given problem is undecidable. However, there are examples of specific classes of groups for which these problems can be decided. For instance, it is known that all of these problems are decidable for finitely generated free groups [Ben] and for finitely generated free abelian groups [Gru]. The generalized word problem for finitely generated free abelian groups is of particular interest, because it is known to be an NP-complete problem (it has been reduced to non-negative integer programming, see [Sah]). I have found an alternate algorithm to decide the generalized word problem for finitely generated free abelian groups which only requires basic properties of vectors, and trigonometry. It remains to be seen whether my approach offers a significant improvement in complexity as compared to other existing algorithms.

2 Justin A. James 2 2 Closure Properties A major theme in group theory is the idea of building new groups from old ones. This can be done using several standard constructions. These include subgroups, quotients, direct products, free products, free products with amalgamation, and HNN extensions. It is natural to ask what effect these constructions have on the decidability of algorithmic problems such as the word problem and its generalizations. A Theorem of Grunschlag [Gru] shows that the decidability of the word problem, the generalized word problem, and the rational membership problem are all preserved for finite index subgroups and finite index extensions of a finitely generated group. K. A. Mihailova has shown that the generalized word problem is not preserved under direct product [Mih1], but that it is preserved under free product [Mih2]. That is, there is an example of two groups with decidable generalized word problem whose direct product has undecidable word problem, while if two finitely generated groups have decidable generalized word problem, then their free product also has decidable generalized word problem. I have been able to extend Mihailova s techniques to prove the following result: Theorem 1: Let G= G 1 G 2 where G 1 and G 2 are groups with generating sets A and B respectively. If G 1 and G 2 have decidable Rational Membership Problem, then membership in finitely generated submonoids of G is decidable. The algorithm used to prove this result is a two step process which starts by constructing a finite collection of finite state automata, and then uses them to perform a Nielsen -like completion procedure (See [LS]) in order to obtain a generating set for which every element of the given submonoid has a well behaved factorization. Finite state automata can be thought of as directed labeled graphs with a distinguished start vertex and a set of distinguished terminal vertices. The language accepted by a finite state automaton is the set of all strings that label a directed path from the start vertex to one of the terminal vertices (See [HU]). If the labels of the edges correspond to a finite set of generators for a group, then the language of an automaton corresponds to a subset of this group - namely the elements of the group that occur as the product of the generators given by a word labeling an accepted path in the automaton. Kleene s Theorem gives a connection between languages accepted by finite state automata labeled by a finite set A and rational subsets of the free monoid A (the set of all finite length strings over the alphabet A). If A is taken to be a finite generating set for a group G, a theorem of Berstel [Ber] shows that the image of a rational subset of a free monoid A is a rational subset of the group G under the natural identification map. Because of this, finite state automata are a computational tool that are often used to decide rational problems in finitely generated groups. I would like to determine whether or not the hypothesis in the previous theorem that the factors have decidable rational membership problem can be weakened. This leads to the following question: Question 1: Let G= G 1 G 2 where G 1 and G 2 are groups with generating sets A and B respectively. If G 1 and G 2 have decidable submonoid membership problem, is membership in finitely generated submonoids of G is decidable? Ben Steinberg has recently shown me an unpublished proof that the rational membership problem is also preserved under free products and free products with amalgamation and HNN extensions with finite base. I plan to investigate extending Steinberg s results to larger classes of amalgams and HNN extensions. 2

3 Justin A. James 3 3 Word Hyperbolic Groups For any group G with finite generating set A G with A closed under inversion, the Cayley graph of G with respect to A, denotedγ(g, A), is defined as follows: the vertex set of the graph is G, and for each a Aand g G, there is an edge from the vertex g to the vertex ga. Γ(G, A) can be made into a geodesic metric space by taking each edge as isometric to the unit interval, and then using the path metric (the distance between any two points in the graph is the length of a shortest path between them). Cayley graphs allow us to apply topological, combinatorial, and analytical methods to finitely generated groups. In any geodesic metric space X, a geodesic triangle (x, y, z) is calledδ-slim forδ 0if each of its sides is contained in theδ-neighborhood of the union of the other two sides. A geodesic metric space X called δ-hyperbolic if every geodesic triangle is δ-slim. A group G is δ-hyperbolic with respect to a generating set A if its Cayley graph with respect A,Γ(G, A) with path metric is aδ-hyperbolic metric space. G is word hyperbolic if it isδ-hyperbolic for someδ 0and some finite generating set A. Word hyperbolic groups were introduced by Gromov [Gro]. It is known that word hyperbolic groups have decidable word problem [AB], decidable order problem ([Lys] or [Bra]), and decidable power problem [Lys]. However, Rips [Rip] showed that the generalized word problem is undecidable for word hyperbolic groups. Therefore, membership in finitely generated submonoids and rational subsets are also be undecidable. The generalized power problem for a finitely generated groups asks if there is an algorithm that, given two elements of the group via two words u and v, can decide whether or not there are positive integer exponents k and l such that u k and v l represent the same element of the group. This decision problem is strictly harder than the power problem (and hence the word problem as well) and it turns out to be strictly easier than the generalized word problem. By analyzing the geometric properties of geodesic rays and quasigeodesic rays in the Cayley graph of a word hyperbolic group, I have been able to prove the following results: Theorem 2: Let G= A R be a finitely generatedδ-hyperbolic group. Then there is an algorithm deciding the generalized power problem for G. Theorem 3: Let G= A R be a finitely generatedδ-hyperbolic group. Let u, v A. Then there is an algorithm deciding membership in the rational subset{u} {v}. The fact that the generalized word problem is undecidable for word hyperbolic groups in general gives an upper bound on how far we can generalize this result, but I plan to continue to work on determining whether are not there are solutions to the decision problems that lie between the generalized power problem and the generalized word problem. Question 2: Let G= A R be a finitely generatedδ-hyperbolic group. Let u 1, u 2, u 3 A. Is there an algorithm deciding membership in the rational subset{u 1 } {u 2 } {u 3 }? If u 1, u 2,..., u n A, is there an algorithm to decide membership in{u 1 } {u 2 }... {u n }? 3

4 Justin A. James 4 4 Future Work Beyond the results mentioned above, very little is known about the decidability of generalizations of the word problem for finitely generated groups. There are many interesting classes of groups for which the decidability of rational problems is still open. Two classes of groups for which there are some partial results are Surface groups, and Coxeter groups. The word problem is known to be decidable for both of these classes of groups. Both P. Schupp [Sch] and McCammond and Wise [MW] have applied perimeter reduction techniques to decide the generalized word problem for Coxeter groups when restrictions are put on the both the number of generators of the group, and the exponents of the Coxeter relations. I plan to apply the techniques I have developed to investigate the following questions: Question 3: Is the rational membership problem, the submonoid membership problem, or the generalized word problem decidable for Coxeter groups of extra large type? Question 4: Is the rational membership problem or the submonoid membership problem decidable for surface groups? References [1] [AB] J. M. Alonso, T. Brady, D. Cooper, V. Ferlini, M. Lustig, M. Mihalik, M. Shapiro, and H. Short. Notes on word hyperbolic groups (ed. H. Short). In E. Ghys, A. Haefliger, and A. Verjovsky, editors, Group Theory from a Geometrical Viewpoint, pp World Scientific, [2] [Ben] M. Benois. Partie rationelles du groupes libre., C. R. Acad. Sci. Paris, Ser. A, 269: , [3] [Ber] J. Berstel. Transductions and Context-Free Languages, Teubner, Stuttgart, [4] [Boo] W. W. Boone. Certain simple unsolvable problems in group theory, I, II, III, IV, V VI, Nederl. Akad. Wetensch Proc. Ser A 57, , (1954), 58, , (1955), 60, 22-27, (1957). [5] [Bra] N. Brady. Finite Subgroups of Hyperbolic Groups Internat. J. Algebra Comput., 10(2000), no. 4, [6] [BrHa] M. R. Bridson and A. Haefliger. Metric Spaces of Non-Positive Curvature, Springer-Verlag, [7] [Deh] M. Dehn. Über unendliche diskontinuerliche Gruppen, Math. Ann. 69, , [8] [Gro] M. Gromov. Hyperbolic Groups, Essays in Group Theory, MSRI series vol. 8, edited by S. M. Gersten, pp , Springer Verlag, [9] [Gru] Z. Grunschlag. Algorithms in Geometric Group Theory, Ph.D. Dissertation, Univ. Calif. Berkeley, [10] [HU] J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation, Adison-Wesley Publishing Co., Reading MA - Menlo Park CA,

5 Justin A. James 5 [11] [LM] S. Lipschutz and C. F. Miller III. Groups with certain solvable and unsolvable decision problems. Comm. in Pure and Applied Math. 24, 7-15, [12] [LS] R. C. Lyndon, P. E. Schupp. Combinatorial Group Theory, Springer, Berlin, [13] [MW] J. P. McCammond and D. T. Wise. Coherence, local quasiconvexity and the perimeter of 2-complexes, Preprint, Texas A&M University, [14] [McC] J. McCool. The order problem and the power problem for free product sixth-groups. Glascow Math. J. 10, 1-9, [15] [Mih1] K. A. Mihailova. The occurrence problem for direct products of groups. (English Translation) Math USSR-Sbornik 70, , [16] [Mih4] K. A. Mihailova. The occurrence problem for free products of groups. (English Translation) Math USSR-Sbornik 75, , [17] [Nov] P. S. Novikov. On the algorithmic unsolvability of the word problem in group theory. Trudy Mat. Inst. Steklov 44, 1-143, [18] [Rip] E. Rips. Subgroups of small cancellation groups. Bull. London Math. Soc. 14, 45-47, [19] [Sah] S. Sahni, Computationally Related Problems. SIAM J. Comput, Vol. 3, No. 4, pp , [20] [Sch] P. E. Schupp. Coxeter groups, 2-completion, perimeter reduction and subgroup separability. Geom. Dedicata 96, ,

A note on doubles of groups

A note on doubles of groups A note on doubles of groups Nadia Benakli Oliver T. Dasbach Yair Glasner Brian Mangum Abstract Recently, Rips produced an example of a double of two free groups which has unsolvable generalized word problem.

More information

2 THE COMPLEXITY OF TORSION-FREENESS On the other hand, the nite presentation of a group G also does not allow us to determine almost any conceivable

2 THE COMPLEXITY OF TORSION-FREENESS On the other hand, the nite presentation of a group G also does not allow us to determine almost any conceivable THE COMPUTATIONAL COMPLEXITY OF TORSION-FREENESS OF FINITELY PRESENTED GROUPS Steffen Lempp Department of Mathematics University of Wisconsin Madison, WI 53706{1388, USA Abstract. We determine the complexity

More information

The Rational Subset Membership Problem for Groups: A Survey

The Rational Subset Membership Problem for Groups: A Survey The Rational Subset Membership Problem for Groups: A Survey Markus Lohrey University of Siegen December 18, 2013 Abstract The class of rational subsets of a group G is the smallest class that contains

More information

group Jean-Eric Pin and Christophe Reutenauer

group Jean-Eric Pin and Christophe Reutenauer A conjecture on the Hall topology for the free group Jean-Eric Pin and Christophe Reutenauer Abstract The Hall topology for the free group is the coarsest topology such that every group morphism from the

More information

Formal Languages 2: Group Theory

Formal Languages 2: Group Theory 2: Group Theory Matilde Marcolli CS101: Mathematical and Computational Linguistics Winter 2015 Group G, with presentation G = X R (finitely presented) X (finite) set of generators x 1,..., x N R (finite)

More information

ON COHERENCE OF GRAPH PRODUCTS AND COXETER GROUPS

ON COHERENCE OF GRAPH PRODUCTS AND COXETER GROUPS ON COHERENCE OF GRAPH PRODUCTS AND COXETER GROUPS OLGA VARGHESE Abstract. Graph products and Coxeter groups are defined via vertex-edge-labeled graphs. We show that if the graph has a special shape, then

More information

Word-hyperbolic groups have real-time word problem

Word-hyperbolic groups have real-time word problem Word-hyperbolic groups have real-time word problem Derek F. Holt 1 Introduction Let G = X be a finitely generated group, let A = X X 1, and let A be the set of all words in A. For u, v A, we denote the

More information

Results from MathSciNet: Mathematical Reviews on the Web c Copyright American Mathematical Society 2000

Results from MathSciNet: Mathematical Reviews on the Web c Copyright American Mathematical Society 2000 2000k:53038 53C23 20F65 53C70 57M07 Bridson, Martin R. (4-OX); Haefliger, André (CH-GENV-SM) Metric spaces of non-positive curvature. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles

More information

Some decision problems on integer matrices

Some decision problems on integer matrices Some decision problems on integer matrices Christian Choffrut L.I.A.F.A, Université Paris VII, Tour 55-56, 1 er étage, 2 pl. Jussieu 75 251 Paris Cedex France Christian.Choffrut@liafa.jussieu.fr Juhani

More information

arxiv: v1 [math.gr] 20 Jul 2009

arxiv: v1 [math.gr] 20 Jul 2009 Some geodesic problems in groups arxiv:0907.3258v1 [math.gr] 20 Jul 2009 Murray Elder School of Mathematics and Physics University of Queensland, Brisbane, Australia murrayelder@gmail.com Éric Fusy LIX

More information

Rational subsets and submonoids of wreath products

Rational subsets and submonoids of wreath products Rational subsets and submonoids of wreath products Markus Lohrey 1, Benjamin Steinberg 2, and Georg Zetzsche 3 1 Universität Leipzig, Institut für Informatik 2 City College of New York, Department of Mathematics

More information

Ping-Pong on Negatively Curved Groups

Ping-Pong on Negatively Curved Groups Ž. Journal of Algebra 27, 6572 999 Article ID jabr.998.7789, available online at http:www.idealibrary.com on Ping-Pong on Negatively Curved Groups Rita Gitik* Department of Mathematics, California Institute

More information

Flows, dynamics and algorithms for 3 manifold groups

Flows, dynamics and algorithms for 3 manifold groups Flows, dynamics and algorithms for 3 manifold groups Tim Susse University of Nebraska 4 March 2017 Joint with Mark Brittenham & Susan Hermiller Groups and the word problem Let G = A R be a finitely presented

More information

New York Journal of Mathematics. A Non-quasiconvex Subgroup of a Hyperbolic Group with an Exotic Limit Set

New York Journal of Mathematics. A Non-quasiconvex Subgroup of a Hyperbolic Group with an Exotic Limit Set New York Journal of Mathematics New York J. Math. 1 (1995) 184 195. A Non-quasiconvex Subgroup of a Hyperbolic Group with an Exotic Limit Set Ilya Kapovich Abstract. We construct an example of a torsion

More information

NOTES ON AUTOMATA. Date: April 29,

NOTES ON AUTOMATA. Date: April 29, NOTES ON AUTOMATA 1. Monoids acting on sets We say that a monoid S with identity element ɛ acts on a set Q if q(st) = (qs)t and qɛ = q. As with groups, if we set s = t whenever qs = qt for all q Q, then

More information

Homological Decision Problems for Finitely Generated Groups with Solvable Word Problem

Homological Decision Problems for Finitely Generated Groups with Solvable Word Problem Homological Decision Problems for Finitely Generated Groups with Solvable Word Problem W.A. Bogley Oregon State University J. Harlander Johann Wolfgang Goethe-Universität 24 May, 2000 Abstract We show

More information

arxiv:math/ v1 [math.gr] 2 May 2004

arxiv:math/ v1 [math.gr] 2 May 2004 THE TITS ALTERNATIVE FOR CAT(0) CUBICAL COMPLEXES arxiv:math/0405022v1 [math.gr] 2 May 2004 MICHAH SAGEEV AND DANIEL T. WISE Abstract. We prove a Tits alternative theorem for groups acting on CAT(0) cubicalcomplexes.

More information

Research Statement. MUHAMMAD INAM 1 of 5

Research Statement. MUHAMMAD INAM 1 of 5 MUHAMMAD INAM 1 of 5 Research Statement Preliminaries My primary research interests are in geometric inverse semigroup theory and its connections with other fields of mathematics. A semigroup M is called

More information

Z n -free groups are CAT(0)

Z n -free groups are CAT(0) Z n -free groups are CAT(0) Inna Bumagin joint work with Olga Kharlampovich to appear in the Journal of the LMS February 6, 2014 Introduction Lyndon Length Function Let G be a group and let Λ be a totally

More information

WHY WORD PROBLEMS ARE HARD

WHY WORD PROBLEMS ARE HARD WHY WORD PROBLEMS ARE HARD KEITH CONRAD 1. Introduction The title above is a joke. Many students in school hate word problems. We will discuss here a specific math question that happens to be named the

More information

On Linear and Residual Properties of Graph Products

On Linear and Residual Properties of Graph Products On Linear and Residual Properties of Graph Products Tim Hsu & Daniel T. Wise 1. Introduction Graph groups are groups with presentations where the only relators are commutators of the generators. Graph

More information

Finite Presentations of Hyperbolic Groups

Finite Presentations of Hyperbolic Groups Finite Presentations of Hyperbolic Groups Joseph Wells Arizona State University May, 204 Groups into Metric Spaces Metric spaces and the geodesics therein are absolutely foundational to geometry. The central

More information

ON GROUP-THEORETIC MODELS OF RANDOMNESS AND GENERICITY

ON GROUP-THEORETIC MODELS OF RANDOMNESS AND GENERICITY ON GROUP-THEORETIC MODELS OF RANDOMNESS AND GENERICITY ILYA KAPOVICH AND PAUL SCHUPP Abstract. We compare the random group model of Gromov and the model of generic groups of Arzhantseva and Ol shanskii.

More information

Some geodesic problems in groups

Some geodesic problems in groups Groups Complex. Cryptol. 2 (2010), 223 229 DOI 10.1515/GCC.2010.014 de Gruyter 2010 Some geodesic problems in groups Murray Elder and Andrew Rechnitzer Abstract. We consider several algorithmic problems

More information

Centralizers of Coxeter Elements and Inner Automorphisms of Right-Angled Coxeter Groups

Centralizers of Coxeter Elements and Inner Automorphisms of Right-Angled Coxeter Groups International Journal of Algebra, Vol. 3, 2009, no. 10, 465-473 Centralizers of Coxeter Elements and Inner Automorphisms of Right-Angled Coxeter Groups Anton Kaul Mathematics Department, California Polytecnic

More information

Discrete Groups: A Story of Geometry, Complexity, and Imposters

Discrete Groups: A Story of Geometry, Complexity, and Imposters Discrete Groups: A Story of Geometry, Complexity, and Imposters Martin R Bridson Mathematical Institute University of Oxford BMS Colloquium, Berlin, 29 June 2012. BMS Colloquium, Berlin, 29 June 2012.

More information

THE WORD PROBLEM AND RELATED RESULTS FOR GRAPH PRODUCT GROUPS

THE WORD PROBLEM AND RELATED RESULTS FOR GRAPH PRODUCT GROUPS proceedings of the american mathematical society Volume 82, Number 2, June 1981 THE WORD PROBLEM AND RELATED RESULTS FOR GRAPH PRODUCT GROUPS K. J. HORADAM Abstract. A graph product is the fundamental

More information

THE FUNDAMENTAL GROUP OF THE DOUBLE OF THE FIGURE-EIGHT KNOT EXTERIOR IS GFERF

THE FUNDAMENTAL GROUP OF THE DOUBLE OF THE FIGURE-EIGHT KNOT EXTERIOR IS GFERF THE FUNDAMENTAL GROUP OF THE DOUBLE OF THE FIGURE-EIGHT KNOT EXTERIOR IS GFERF D. D. LONG and A. W. REID Abstract We prove that the fundamental group of the double of the figure-eight knot exterior admits

More information

RELATIVE CUBULATIONS AND GROUPS WITH A 2 SPHERE BOUNDARY

RELATIVE CUBULATIONS AND GROUPS WITH A 2 SPHERE BOUNDARY RELATIVE CUBULATIONS AND GROUPS WITH A 2 SPHERE BOUNDARY EDUARD EINSTEIN AND DANIEL GROVES ABSTRACT. We introduce a new kind of action of a relatively hyperbolic group on a CAT(0) cube complex, called

More information

The automorphism group of the free group of rank two is a CAT(0) group

The automorphism group of the free group of rank two is a CAT(0) group The automorphism group of the free group of rank two is a CAT(0) group Adam Piggott, Kim Ruane and Genevieve S. Walsh February 9, 2009 Abstract We prove that the automorphism group of the braid group on

More information

STAR-FREE GEODESIC LANGUAGES FOR GROUPS

STAR-FREE GEODESIC LANGUAGES FOR GROUPS STAR-FREE GEODESIC LANGUAGES FOR GROUPS SUSAN HERMILLER 1, DEREK F. HOLT, AND SARAH REES Abstract. In this article we show that every group with a finite presentation satisfying one or both of the small

More information

arxiv: v1 [math.gr] 26 Sep 2016

arxiv: v1 [math.gr] 26 Sep 2016 ON INTERSECTIONS OF CONJUGATE SUBGROUPS arxiv:1609.07924v1 [math.gr] 26 Sep 2016 RITA GITIK Abstract. We define a new invariant of a conjugacy class of subgroups which we call the weak width and prove

More information

arxiv:math/ v1 [math.gr] 13 Jul 1995

arxiv:math/ v1 [math.gr] 13 Jul 1995 Central Extensions of Word Hyperbolic Groups Walter D. Neumann and Lawrence Reeves arxiv:math/9507201v1 [math.gr] 13 Jul 1995 Thurston has claimed (unpublished) that central extensions of word hyperbolic

More information

1. Introduction There are two difficult problems, concerning hyperbolic one relator groups:

1. Introduction There are two difficult problems, concerning hyperbolic one relator groups: A CLASSIFICATION, UP TO HYPERBOLICITY, OF GROUPS GIVEN BY 2 GENERATORS AND ONE RELATOR OF LENGTH 8 O. BOGOPOLSKI, N. BUSKIN AND A. BUTURLAKINN Abstract. We classify, up to hyperbolicity, all group given

More information

The submonoid and rational subset membership problems for graph groups

The submonoid and rational subset membership problems for graph groups The submonoid and rational subset membership problems for graph groups Markus Lohrey 1 and Benjamin Steinberg 2, 1 Universität Stuttgart, FMI, Germany 2 School of Mathematics and Statistics, Carleton University,

More information

From local to global conjugacy in relatively hyperbolic groups

From local to global conjugacy in relatively hyperbolic groups From local to global conjugacy in relatively hyperbolic groups Oleg Bogopolski Webinar GT NY, 5.05.2016 Relative presentations Let G be a group, P = {P λ } λ Λ a collection of subgroups of G, X a subset

More information

Non-amenable finitely presented torsion-by-cyclic groups

Non-amenable finitely presented torsion-by-cyclic groups Non-amenable finitely presented torsion-by-cyclic groups A.Yu. Ol shanskii, M.V. Sapir 1 Short history of the problem Hausdorff [14] proved in 1914 that one can subdivide the 2-sphere minus a countable

More information

GENERIC-CASE COMPLEXITY, DECISION PROBLEMS IN GROUP THEORY AND RANDOM WALKS

GENERIC-CASE COMPLEXITY, DECISION PROBLEMS IN GROUP THEORY AND RANDOM WALKS GENERIC-CASE COMPLEXITY, DECISION PROBLEMS IN GROUP THEORY AND RANDOM WALKS ILYA KAPOVICH, ALEXEI MYASNIKOV, PAUL SCHUPP, AND VLADIMIR SHPILRAIN Abstract. We give a precise definition of generic-case complexity

More information

arxiv:math/ v2 [math.gr] 19 Oct 2007

arxiv:math/ v2 [math.gr] 19 Oct 2007 FORMAL LANGUAGES AND GROUPS AS MEMORY Mark Kambites arxiv:math/0601061v2 [math.gr] 19 Oct 2007 School of Mathematics, University of Manchester Manchester M60 1QD, England Mark.Kambites@manchester.ac.uk

More information

Residual finiteness of infinite amalgamated products of cyclic groups

Residual finiteness of infinite amalgamated products of cyclic groups Journal of Pure and Applied Algebra 208 (2007) 09 097 www.elsevier.com/locate/jpaa Residual finiteness of infinite amalgamated products of cyclic groups V. Metaftsis a,, E. Raptis b a Department of Mathematics,

More information

MA4H4 - GEOMETRIC GROUP THEORY. Contents of the Lectures

MA4H4 - GEOMETRIC GROUP THEORY. Contents of the Lectures MA4H4 - GEOMETRIC GROUP THEORY Contents of the Lectures 1. Week 1 Introduction, free groups, ping-pong, fundamental group and covering spaces. Lecture 1 - Jan. 6 (1) Introduction (2) List of topics: basics,

More information

SOLVABLE GROUPS OF EXPONENTIAL GROWTH AND HNN EXTENSIONS. Roger C. Alperin

SOLVABLE GROUPS OF EXPONENTIAL GROWTH AND HNN EXTENSIONS. Roger C. Alperin SOLVABLE GROUPS OF EXPONENTIAL GROWTH AND HNN EXTENSIONS Roger C. Alperin An extraordinary theorem of Gromov, [Gv], characterizes the finitely generated groups of polynomial growth; a group has polynomial

More information

Automatic groups, subgroups and cosets

Automatic groups, subgroups and cosets ISSN 1464-8997 (on line) 1464-8989 (printed) 249 Geometry & Topology Monographs Volume 1: The Epstein birthday schrift Pages 249 260 Automatic groups, subgroups and cosets Derek F Holt Abstract The history,

More information

Fixed points of endomorphisms over special conuent rewriti

Fixed points of endomorphisms over special conuent rewriti Fixed points of endomorphisms over special conuent rewriting systems University of Porto (Centre of Mathematics, Faculty of Sciences) Vienna, 25th November 2010 A tale of two theorems Theorem FIN Let G

More information

Filling Length in Finitely Presentable Groups

Filling Length in Finitely Presentable Groups Filling Length in Finitely Presentable Groups S. M. Gersten T. R. Riley 8 June 2000 Abstract Filling length measures the length of the contracting closed loops in a null-homotopy. The filling length function

More information

Elementary subgroups of relatively hyperbolic groups and bounded generation.

Elementary subgroups of relatively hyperbolic groups and bounded generation. Elementary subgroups of relatively hyperbolic groups and bounded generation. D. V. Osin Abstract Let G be a group hyperbolic relative to a collection of subgroups {H λ, λ Λ}. We say that a subgroup Q G

More information

GENERIC-CASE COMPLEXITY, DECISION PROBLEMS IN GROUP THEORY AND RANDOM WALKS ILYA KAPOVICH, ALEXEI MYASNIKOV, PAUL SCHUPP, AND VLADIMIR SHPILRAIN

GENERIC-CASE COMPLEXITY, DECISION PROBLEMS IN GROUP THEORY AND RANDOM WALKS ILYA KAPOVICH, ALEXEI MYASNIKOV, PAUL SCHUPP, AND VLADIMIR SHPILRAIN GENERIC-CASE COMPLEXITY, DECISION PROBLEMS IN GROUP THEORY AND RANDOM WALKS ILYA KAPOVICH, ALEXEI MYASNIKOV, PAUL SCHUPP, AND VLADIMIR SHPILRAIN Abstract. We give a precise definition of generic-case complexity

More information

ABELIAN COVERINGS, POINCARÉ EXPONENT OF CONVERGENCE AND HOLOMORPHIC DEFORMATIONS

ABELIAN COVERINGS, POINCARÉ EXPONENT OF CONVERGENCE AND HOLOMORPHIC DEFORMATIONS Annales Academiæ Scientiarum Fennicæ Series A. I. Mathematica Volumen 20, 1995, 81 86 ABELIAN COVERINGS, POINCARÉ EXPONENT OF CONVERGENCE AND HOLOMORPHIC DEFORMATIONS K. Astala and M. Zinsmeister University

More information

Tropical Semirings. Jean-Eric Pin. LITP/IBP, CNRS-Université Paris 7 2 Place Jussieu, Paris Cedex 05, FRANCE

Tropical Semirings. Jean-Eric Pin. LITP/IBP, CNRS-Université Paris 7 2 Place Jussieu, Paris Cedex 05, FRANCE Tropical Semirings Jean-Eric Pin LITP/IBP, CNRS-Université Paris 7 2 Place Jussieu, 75251 Paris Cedex 05, FRANCE 1 Introduction It is a well-known fact that the boolean calculus is one of the mathematical

More information

Hairdressing in groups: a survey of combings and formal languages

Hairdressing in groups: a survey of combings and formal languages ISSN 1464-8997 (on line) 1464-8989 (printed) 493 Geometry & Topology Monographs Volume 1: The Epstein birthday schrift Pages 493 509 Hairdressing in groups: a survey of combings and formal languages Sarah

More information

arxiv: v2 [math.gr] 4 Dec 2014

arxiv: v2 [math.gr] 4 Dec 2014 CURVATURE AND COMPUTATION arxiv:1411.7306v2 [math.gr] 4 Dec 2014 JON MCCAMMOND Abstract. When undergraduates ask me what geometric group theorists study, I describe a theorem due to Gromov which relates

More information

A unique representation of polyhedral types. Centering via Möbius transformations

A unique representation of polyhedral types. Centering via Möbius transformations Mathematische Zeitschrift manuscript No. (will be inserted by the editor) A unique representation of polyhedral types. Centering via Möbius transformations Boris A. Springborn Boris Springborn Technische

More information

Algebraic Combinatorics, Computability and Complexity Syllabus for the TEMPUS-SEE PhD Course

Algebraic Combinatorics, Computability and Complexity Syllabus for the TEMPUS-SEE PhD Course Algebraic Combinatorics, Computability and Complexity Syllabus for the TEMPUS-SEE PhD Course Dragan Marušič 1 and Stefan Dodunekov 2 1 Faculty of Mathematics Natural Sciences and Information Technologies

More information

A CONTINUALLY DESCENDING ENDOMORPHISM OF A FINITELY GENERATED RESIDUALLY FINITE GROUP

A CONTINUALLY DESCENDING ENDOMORPHISM OF A FINITELY GENERATED RESIDUALLY FINITE GROUP A CONTINUALLY DESCENDING ENDOMORPHISM OF A FINITELY GENERATED RESIDUALLY FINITE GROUP DANIEL T. WISE Abstract Let φ : G G be an endomorphism of a finitely generated residually finite group. R. Hirshon

More information

Closed subgroups of compactly generated LCA groups are compactly generated

Closed subgroups of compactly generated LCA groups are compactly generated Closed subgroups of compactly generated LCA groups are compactly generated Ken Ross March 4, 2010 The result stated in the title is apparently due to Sidney A. Morris in 1972 [7]. The theorem is Exercise

More information

ORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS

ORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS ORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS SIMON M. SMITH Abstract. If G is a group acting on a set Ω and α, β Ω, the digraph whose vertex set is Ω and whose arc set is the orbit (α, β)

More information

FREE PRODUCTS AND BRITTON S LEMMA

FREE PRODUCTS AND BRITTON S LEMMA FREE PRODUCTS AND BRITTON S LEMMA Dan Lidral-Porter 1. Free Products I determined that the best jumping off point was to start with free products. Free products are an extension of the notion of free groups.

More information

676 JAMES W. ANDERSON

676 JAMES W. ANDERSON 676 JAMES W. ANDERSON Such a limit set intersection theorem has been shown to hold under various hypotheses. Maskit [17] shows that it holds for pairs of analytically finite component subgroups of a Kleinian

More information

A REPRESENTATION THEORETIC APPROACH TO SYNCHRONIZING AUTOMATA

A REPRESENTATION THEORETIC APPROACH TO SYNCHRONIZING AUTOMATA A REPRESENTATION THEORETIC APPROACH TO SYNCHRONIZING AUTOMATA FREDRICK ARNOLD AND BENJAMIN STEINBERG Abstract. This paper is a first attempt to apply the techniques of representation theory to synchronizing

More information

An introduction to arithmetic groups. Lizhen Ji CMS, Zhejiang University Hangzhou , China & Dept of Math, Univ of Michigan Ann Arbor, MI 48109

An introduction to arithmetic groups. Lizhen Ji CMS, Zhejiang University Hangzhou , China & Dept of Math, Univ of Michigan Ann Arbor, MI 48109 An introduction to arithmetic groups Lizhen Ji CMS, Zhejiang University Hangzhou 310027, China & Dept of Math, Univ of Michigan Ann Arbor, MI 48109 June 27, 2006 Plan. 1. Examples of arithmetic groups

More information

Two-Step Nilpotent Lie Algebras Attached to Graphs

Two-Step Nilpotent Lie Algebras Attached to Graphs International Mathematical Forum, 4, 2009, no. 43, 2143-2148 Two-Step Nilpotent Lie Algebras Attached to Graphs Hamid-Reza Fanaï Department of Mathematical Sciences Sharif University of Technology P.O.

More information

PLEASE SCROLL DOWN FOR ARTICLE

PLEASE SCROLL DOWN FOR ARTICLE This article was downloaded by: [Sun Yat-Sen University] On: 1 October 2008 Access details: Access Details: [subscription number 781195905] Publisher Taylor & Francis Informa Ltd Registered in England

More information

GENERICITY OF INFINITE-ORDER ELEMENTS IN HYPERBOLIC GROUPS

GENERICITY OF INFINITE-ORDER ELEMENTS IN HYPERBOLIC GROUPS GENERICITY OF INFINITE-ORDER ELEMENTS IN HYPERBOLIC GROUPS PALLAVI DANI 1. Introduction Let Γ be a finitely generated grou and let S be a finite set of generators for Γ. This determines a word metric on

More information

Quasi-isometry and commensurability classification of certain right-angled Coxeter groups

Quasi-isometry and commensurability classification of certain right-angled Coxeter groups Quasi-isometry and commensurability classification of certain right-angled Coxeter groups Anne Thomas School of Mathematics and Statistics, University of Sydney Groups acting on CAT(0) spaces MSRI 30 September

More information

Summary and comments to my list of publications

Summary and comments to my list of publications Summary and comments to my list of publications Goulnara ARZHANTSEVA, University of Geneva, January 2009 Goulnara.Arjantseva@math.unige.ch [1] G. N. Arzhantseva, M. Bridson, T. Januszkiewicz, I. Leary,

More information

ALGORITHMS AND TOPOLOGY OF CAYLEY GRAPHS FOR GROUPS

ALGORITHMS AND TOPOLOGY OF CAYLEY GRAPHS FOR GROUPS ALGORITHMS AND TOPOLOGY OF CAYLEY GRAPHS FOR GROUPS MARK BRITTENHAM, SUSAN HERMILLER, AND DEREK HOLT Abstract. Autostackability for finitely generated groups is defined via a topological property of the

More information

Almost Invariant Sets. M. J. Dunwoody. July 18, 2011

Almost Invariant Sets. M. J. Dunwoody. July 18, 2011 Almost Invariant Sets M. J. Dunwoody July 18, 2011 Introduction Let G be a finitely generated group with finite generating set S and let X = Cay(G, S) be the Cayley graph of G with respect to S. We say

More information

Bjorn Poonen. Cantrell Lecture 3 University of Georgia March 28, 2008

Bjorn Poonen. Cantrell Lecture 3 University of Georgia March 28, 2008 University of California at Berkeley Cantrell Lecture 3 University of Georgia March 28, 2008 Word Isomorphism Can you tile the entire plane with copies of the following? Rules: Tiles may not be rotated

More information

Not all finitely generated groups have universal acylindrical actions

Not all finitely generated groups have universal acylindrical actions arxiv:1505.02990v3 [math.gr] 20 Jan 2016 Not all finitely generated groups have universal acylindrical actions Carolyn R. Abbott Abstract The class of acylindrically hyperbolic groups, which are groups

More information

THE BOWDITCH BOUNDARY OF (G, H) WHEN G IS HYPERBOLIC

THE BOWDITCH BOUNDARY OF (G, H) WHEN G IS HYPERBOLIC THE BOWDITCH BOUNDARY OF (G, H) WHEN G IS HYPERBOLIC JASON FOX MANNING Abstract. In this note we use Yaman s dynamical characterization of relative hyperbolicity to prove a theorem of Bowditch about relatively

More information

arxiv:math/ v3 [math.gr] 21 Feb 2006

arxiv:math/ v3 [math.gr] 21 Feb 2006 arxiv:math/0407446v3 [math.gr] 21 Feb 2006 Separability of Solvable Subgroups in Linear Groups Roger Alperin and Benson Farb August 11, 2004 Abstract Let Γ be a finitely generated linear group over a field

More information

Groups up to quasi-isometry

Groups up to quasi-isometry OSU November 29, 2007 1 Introduction 2 3 Topological methods in group theory via the fundamental group. group theory topology group Γ, a topological space X with π 1 (X) = Γ. Γ acts on the universal cover

More information

An algebraic characterization of unary two-way transducers

An algebraic characterization of unary two-way transducers An algebraic characterization of unary two-way transducers (Extended Abstract) Christian Choffrut 1 and Bruno Guillon 1 LIAFA, CNRS and Université Paris 7 Denis Diderot, France. Abstract. Two-way transducers

More information

Geometric group theory Lecture Notes

Geometric group theory Lecture Notes Geometric group theory Lecture Notes M. Hull 1 Introduction One of the main themes of geometric group theory is to study a (finitely generated) group G in terms of the geometric properties of the Cayley

More information

ISOMORPHISM VERSUS COMMENSURABILITY FOR A CLASS OF FINITELY PRESENTED GROUPS

ISOMORPHISM VERSUS COMMENSURABILITY FOR A CLASS OF FINITELY PRESENTED GROUPS ISOMORPHISM VERSUS COMMENSURABILITY FOR A CLASS OF FINITELY PRESENTED GROUPS GOULNARA ARZHANTSEVA, JEAN-FRANÇOIS LAFONT, AND ASHOT MINASYAN ABSTRACT. We construct a class of finitely presented groups where

More information

Peter Wood. Department of Computer Science and Information Systems Birkbeck, University of London Automata and Formal Languages

Peter Wood. Department of Computer Science and Information Systems Birkbeck, University of London Automata and Formal Languages and and Department of Computer Science and Information Systems Birkbeck, University of London ptw@dcs.bbk.ac.uk Outline and Doing and analysing problems/languages computability/solvability/decidability

More information

Houston Journal of Mathematics. c 2000 University of Houston Volume 26, No. 4, 2000

Houston Journal of Mathematics. c 2000 University of Houston Volume 26, No. 4, 2000 Houston Journal of Mathematics c 2000 University of Houston Volume 26, No. 4, 2000 THE BOUNDARY AND THE VIRTUAL COHOMOLOGICAL DIMENSION OF COXETER GROUPS TETSUYA HOSAKA AND KATSUYA YOKOI Communicated by

More information

Collisions at infinity in hyperbolic manifolds

Collisions at infinity in hyperbolic manifolds Under consideration for publication in Math. Proc. Camb. Phil. Soc. 1 Collisions at infinity in hyperbolic manifolds By D. B. MCREYNOLDS Department of Mathematics, Purdue University, Lafayette, IN 47907,

More information

FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM

FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM ILYA KAPOVICH, ALEXEI MYASNIKOV, AND RICHARD WEIDMANN Abstract. We use Stallings-Bestvina-Feighn-Dunwoody folding sequences to analyze the solvability

More information

ONE-RELATOR GROUPS WITH TORSION ARE CONJUGACY SEPARABLE. 1. Introduction

ONE-RELATOR GROUPS WITH TORSION ARE CONJUGACY SEPARABLE. 1. Introduction ONE-RELATOR GROUPS WITH TORSION ARE CONJUGACY SEPARABLE ASHOT MINASYAN AND PAVEL ZALESSKII Abstract. We prove that one-relator groups with torsion are hereditarily conjugacy separable. Our argument is

More information

arxiv:math/ v2 [math.gr] 19 Aug 2004

arxiv:math/ v2 [math.gr] 19 Aug 2004 arxiv:math/0312331v2 [math.gr] 19 Aug 2004 Metric properties of the lamplighter group as an automata group Sean Cleary and Jennifer Taback Abstract. We examine the geometry of the Cayley graph of the lamplighter

More information

ON THE RELATION GAP AND RELATION LIFTING PROBLEM

ON THE RELATION GAP AND RELATION LIFTING PROBLEM ON THE RELATION GAP AND RELATION LIFTING PROBLEM Jens Harlander Boise State University, Boise, Idaho, USA Email: jensharlander@boisestate.edu Abstract This article surveys results in connection with the

More information

Non-abelian key agreement protocols

Non-abelian key agreement protocols Discrete Applied Mathematics 130 (2003) 3 12 www.elsevier.com/locate/dam Non-abelian key agreement protocols Iris Anshel a, Michael Anshel b, Dorian Goldfeld c a Arithmetica Inc., 31 Peter Lynas Ct, Tenay,

More information

8.8. Codimension one isoperimetric inequalities Distortion of a subgroup in a group 283

8.8. Codimension one isoperimetric inequalities Distortion of a subgroup in a group 283 Contents Preface xiii Chapter 1. Geometry and topology 1 1.1. Set-theoretic preliminaries 1 1.1.1. General notation 1 1.1.2. Growth rates of functions 2 1.1.3. Jensen s inequality 3 1.2. Measure and integral

More information

Problems, and How Computer Scientists Solve Them Manas Thakur

Problems, and How Computer Scientists Solve Them Manas Thakur Problems, and How Computer Scientists Solve Them PACE Lab, IIT Madras Content Credits Introduction to Automata Theory, Languages, and Computation, 3rd edition. Hopcroft et al. Introduction to the Theory

More information

SOME SPECIAL KLEINIAN GROUPS AND THEIR ORBIFOLDS

SOME SPECIAL KLEINIAN GROUPS AND THEIR ORBIFOLDS Proyecciones Vol. 21, N o 1, pp. 21-50, May 2002. Universidad Católica del Norte Antofagasta - Chile SOME SPECIAL KLEINIAN GROUPS AND THEIR ORBIFOLDS RUBÉN HIDALGO Universidad Técnica Federico Santa María

More information

Combinatorial Interpretations of a Generalization of the Genocchi Numbers

Combinatorial Interpretations of a Generalization of the Genocchi Numbers 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.6 Combinatorial Interpretations of a Generalization of the Genocchi Numbers Michael Domaratzki Jodrey School of Computer Science

More information

3515ICT: Theory of Computation. Regular languages

3515ICT: Theory of Computation. Regular languages 3515ICT: Theory of Computation Regular languages Notation and concepts concerning alphabets, strings and languages, and identification of languages with problems (H, 1.5). Regular expressions (H, 3.1,

More information

Homotopy and geometric perspectives on string topology

Homotopy and geometric perspectives on string topology Homotopy and geometric perspectives on string topology Ralph L. Cohen Stanford University August 30, 2005 In these lecture notes I will try to summarize some recent advances in the new area of study known

More information

A NOTE ON SPACES OF ASYMPTOTIC DIMENSION ONE

A NOTE ON SPACES OF ASYMPTOTIC DIMENSION ONE A NOTE ON SPACES OF ASYMPTOTIC DIMENSION ONE KOJI FUJIWARA AND KEVIN WHYTE Abstract. Let X be a geodesic metric space with H 1(X) uniformly generated. If X has asymptotic dimension one then X is quasi-isometric

More information

On Shalom Tao s Non-Quantitative Proof of Gromov s Polynomial Growth Theorem

On Shalom Tao s Non-Quantitative Proof of Gromov s Polynomial Growth Theorem On Shalom Tao s Non-Quantitative Proof of Gromov s Polynomial Growth Theorem Carlos A. De la Cruz Mengual Geometric Group Theory Seminar, HS 2013, ETH Zürich 13.11.2013 1 Towards the statement of Gromov

More information

THE CLASSIFICATION OF TILING SPACE FLOWS

THE CLASSIFICATION OF TILING SPACE FLOWS UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XLI 2003 THE CLASSIFICATION OF TILING SPACE FLOWS by Alex Clark Abstract. We consider the conjugacy of the natural flows on one-dimensional tiling

More information

TRANSLATION NUMBERS OF GROUPS ACTING ON QUASICONVEX SPACES

TRANSLATION NUMBERS OF GROUPS ACTING ON QUASICONVEX SPACES TRANSLATION NUMBERS OF GROUPS ACTING ON QUASICONVEX SPACES GREGORY R. CONNER Abstract. We define a group to be translation discrete if it carries a metric in which the translation numbers of the non-torsion

More information

Valentin Deaconu, University of Nevada, Reno. Based on joint work with A. Kumjian and J. Quigg, Ergodic Theory and Dynamical Systems (2011)

Valentin Deaconu, University of Nevada, Reno. Based on joint work with A. Kumjian and J. Quigg, Ergodic Theory and Dynamical Systems (2011) Based on joint work with A. Kumjian and J. Quigg, Ergodic Theory and Dynamical Systems (2011) Texas Tech University, Lubbock, 19 April 2012 Outline We define directed graphs and operator representations

More information

arxiv: v1 [math.gt] 4 Nov 2014

arxiv: v1 [math.gt] 4 Nov 2014 POLYHEDRA FOR WHICH EVERY HOMOTOPY DOMINATION OVER ITSELF IS A HOMOTOPY EQUIVALENCE DANUTA KO LODZIEJCZYK arxiv:1411.1032v1 [math.gt] 4 Nov 2014 Abstract. We consider a natural question: Is it true that

More information

ABELIAN SPLITTINGS OF RIGHT-ANGLED ARTIN GROUPS

ABELIAN SPLITTINGS OF RIGHT-ANGLED ARTIN GROUPS ABELIAN SPLITTINGS OF RIGHT-ANGLED ARTIN GROUPS DANIEL GROVES AND MICHAEL HULL Abstract. We characterize when (and how) a Right-Angled Artin group splits nontrivially over an abelian subgroup. Given a

More information

THE ISOMORPHISM PROBLEM FOR TORAL RELATIVELY HYPERBOLIC GROUPS

THE ISOMORPHISM PROBLEM FOR TORAL RELATIVELY HYPERBOLIC GROUPS THE ISOMORPHISM PROBLEM FOR TORAL RELATIVELY HYPERBOLIC GROUPS by FRANÇOIS DAHMANI and DANIEL GROVES arxiv:math/0512605v3 [math.gr] 1 Jun 2008 ABSTRACT We provide a solution to the isomorphism problem

More information

Notes on D 4 May 7, 2009

Notes on D 4 May 7, 2009 Notes on D 4 May 7, 2009 Consider the simple Lie algebra g of type D 4 over an algebraically closed field K of characteristic p > h = 6 (the Coxeter number). In particular, p is a good prime. We have dim

More information

SHUHONG GAO AND BETH NOVICK

SHUHONG GAO AND BETH NOVICK FAULT TOLERANCE OF CAYLEY GRAPHS SHUHONG GAO AND BETH NOVICK Abstract. It is a difficult problem in general to decide whether a Cayley graph Cay(G; S) is connected where G is an arbitrary finite group

More information

Random Walks on Hyperbolic Groups IV

Random Walks on Hyperbolic Groups IV Random Walks on Hyperbolic Groups IV Steve Lalley University of Chicago January 2014 Automatic Structure Thermodynamic Formalism Local Limit Theorem Final Challenge: Excursions I. Automatic Structure of

More information