Lyndon word decompositions and pseudo orbits on q-nary graphs
arXiv:1610.03808
Abstract
A foundational result in the theory of Lyndon words (words that are strictly earlier in lexicographic order than their cyclic permutations) is the Chen-Fox-Lyndon theorem which states that every word has a unique non-increasing decomposition into Lyndon words. This article extends this factorization theorem, obtaining the proportion of these decompositions that are strictly decreasing. This result is then used to count primitive pseudo orbits (sets of primitive periodic orbits) on q-nary graphs. As an application we obtain a diagonal approximation to the variance of the characteristic polynomial coefficients q-nary quantum graphs.
arXiv comment10 pages
References in corpus (5)
- Periodic Orbit Theory and Spectral Statistics for Quantum Graphs
- Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics
- Secular determinants of random unitary matrices
- Finite pseudo orbit expansions for spectral quantities of quantum graphs
- Sorting suffixes of a text via its Lyndon Factorization