Counting subgraphs in fftp graphs with symmetry

Abstract

Following ideas that go back to Cannon, we show the rationality of various generating functions of growth sequences counting embeddings of convex subgraphs in locally-finite, vertex-transitive graphs with the (relative) falsification by fellow traveler property (fftp). In particular, we recover results of Cannon, of Epstein, Iano-Fletcher and Zwick, and of Calegari and Fujiwara. One of our applications concerns Schreier coset graphs of hyperbolic groups relative to quasi-convex subgroups, we show that these graphs have rational growth, the falsification by fellow traveler property, and the existence of a lower bound for the growth rate independent of the finite generating set and the infinite index quasi-convex subgroup.

arXiv commentversion 2, 27 pages, 3 figures, exposition improved after the comments of the referee

References in corpus (9)

• Peripheral fillings of relatively hyperbolic groups
• Automatic structures, rational growth and geometrically finite hyperbolic groups
• Artin groups of large type are shortlex automatic with regular geodesics
• Finite generating sets of relatively hyperbolic groups and applications to geodesic languages
• The non-amenability of Schreier graphs for infinite index quasiconvex subgroups of hyperbolic groups
• Finiteness and the falsification by fellow traveler property
• Regular geodesic languages and the falsification by fellow traveler property
• Growth of quasiconvex subgroups
• A Cayley graph for $F_2\times F_2$ which is not minimally almost convex