Growth Functions and Automatic Groups

DOI10.1080/10586458.1996.10504595zbMath0892.20022OpenAlexW1991512985MaRDI QIDQ4347270

Uri Zwick, Anthony R. Iano-Fletcher, David B. A. Epstein

Publication date: 9 August 1998

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.em/1047565448

zbMATH Keywords

fast algorithmsgeneratorsCayley graphshyperbolic groupsgrowth functionsautomatic groupsword-hyperbolic groupsrelatorsgeodesic automatic structuresnumbers of finite graphs

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (11)

An Approach to the Herzog-Schönheim Conjecture Using Automata ⋮ Geodesic growth of right-angled Coxeter groups based on trees ⋮ About an extension of the Davenport-Rado result to the Herzog-Schonheim conjecture for free groups ⋮ A necessary condition for representatives of elements of Artin groups of dihedral type to be geodesic. ⋮ Combinatorics of normal sequences of braids ⋮ On the growth of Artin-Tits monoids and the partial theta function ⋮ The growth rates for pure Artin groups of dihedral type. ⋮ Counting subgraphs in hyperbolic graphs with symmetry ⋮ Herzog–Schönheim conjecture, vanishing sums of roots of Unity and convex polygons ⋮ Limit elements in the configuration algebra for a cancellative monoid ⋮ Counting subgraphs in fftp graphs with symmetry

Cites Work

• Unnamed Item
• Unnamed Item
• Growth functions of surface groups
• Matrix multiplication via arithmetic progressions
• Fast algorithms for the characteristic polynomial
• Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
• The use of Knuth-Bendix methods to solve the word problem in automatic groups
• Solving sparse linear equations over finite fields
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• Shift-register synthesis and BCH decoding

This page was built for publication: Growth Functions and Automatic Groups