Self-avoiding walks on Cayley graphs through the lens of symbolic dynamics

DOI10.37236/13065MaRDI QIDQ6635179

Nathalie Aubrun, Nicolas Bitar

Publication date: 9 November 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Cayley graphsconfigurationsone-dimensional subshiftssofic skeletons

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Symbolic dynamics (37B10) Dynamical systems involving maps of trees and graphs (37E25) Multidimensional shifts of finite type (37B51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
• Bounds on connective constants of regular graphs
• Algorithmically finite groups.
• The language of geodesics for Garside groups
• Counting self-avoiding walks on free products of graphs
• Factorization of 3-manifolds
• Infinite paths that contain only shortest paths
• Vertex-transitive graphs and accessibility
• Self-avoiding walks and amenability
• Locality of connective constants
• Automatic structures, rational growth, and geometrically finite hyperbolic groups
• A general bridge theorem for self-avoiding walks
• Rewriting systems, plain groups, and geodetic graphs
• Another approach to non-repetitive colorings of graphs of bounded degree
• Cubic graphs and the golden mean
• Über unendliche Wege in Graphen
• Extendable self-avoiding walks
• A characterisation of virtually free groups.
• Poincaré complexes. I
• Automorphisms and endomorphisms of infinite locally finite graphs
• Burnside's problem, spanning trees and tilings.
• Über die Enden diskreter Räume und Gruppen
• Enden offener Räume und unendliche diskontinuierliche Gruppen
• The language of self-avoiding walks
• Geodesic growth in virtually abelian groups
• Finite generating sets of relatively hyperbolic groups and applications to geodesic languages
• Endless self-avoiding walks
• Artin groups of large type are shortlex automatic with regular geodesics
• ON GROUPS WHOSE GEODESIC GROWTH IS POLYNOMIAL
• Strict Inequalities for Connective Constants of Transitive Graphs
• On the growth constant for square-lattice self-avoiding walks
• Self-Avoiding Walks and Connective Constants
• The entropies of topological Markov shifts and a related class of algebraic integers
• Random self-avoiding walks on one-dimensional lattices
• Cellular Automata and Groups
• Groups and Simple Languages
• The Classification of the Virtually Cyclic Subgroups of the Sphere Braid Groups
• An Introduction to Symbolic Dynamics and Coding
• Connective constants and height functions for Cayley graphs
• On the Number of Self-Avoiding Walks
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
• A Finitely Generated Infinite Simple Group
• Self-avoiding walks and multiple context-free languages
• On quotients of Coxeter groups
• Domino Snake Problems on Groups

This page was built for publication: Self-avoiding walks on Cayley graphs through the lens of symbolic dynamics