Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders
From MaRDI portal
Publication:5236807
DOI10.1090/conm/719/14472zbMath1425.05065arXiv1812.01546OpenAlexW2963192353MaRDI QIDQ5236807
Publication date: 16 October 2019
Published in: Unimodularity in Randomly Generated Graphs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.01546
Random graphs (graph-theoretic aspects) (05C80) Combinatorics on words (68R15) Extensions, wreath products, and other compositions of groups (20E22) Symbolic dynamics (37B10) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lamplighters, metabelian groups, and horocyclic products
- Random walks on the lamplighter group
- A simple shift rule for \(k\)-ary de Bruijn sequences
- The Collatz conjecture and de Bruijn graphs
- On the spectrum of lamplighter groups and percolation clusters
- de Bruijn sequences and de Bruijn graphs for a general language
- A condition for minimal interval exchange maps to be uniquely ergodic
- Random walks on discrete groups: Boundary and entropy
- Graphs on alphabets as models for large interconnection networks
- Iteration of the number-theoretic function \(f(2n)=n\), \(f(2n+1)=3n+2\)
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Subshifts of quasi-finite type
- Arc fault tolerance of Kautz digraphs
- The spectra of subKautz and cyclic Kautz digraphs
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
- Schreir graphs: Transitivity and coverings
- What is a horocyclic product, and how is it related to lamplighters?
- On the lattice of subgroups of the lamplighter group
- Lamplighter groups, de Brujin graphs, spider-web graphs and their spectra
- The 3x + 1 Problem and Its Generalizations
- A stopping time problem on the positive integers
- Symmetric Gibbs measures
- Automatic Sequences
- An Introduction to Symbolic Dynamics and Coding
- The diameter of cyclic Kautz digraphs
- Formal Languages, Automata and Numeration Systems 2
- Infinite words with uniform frequencies, and invariant measures
- Digraphs
This page was built for publication: Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders