Sturmian Words and the Permutation that Orders Fractional Parts
Kevin O'Bryant
Abstract
A Sturmian word is a map W from the natural numbers into 0,1 for which the set of 0,1-vectors Fn(W):=(W(i),W(i+1),...,W(i+n-1))T : i 0 has cardinality exactly n+1 for each positive integer n. Our main result is that the volume of the simplex whose n+1 vertices are the n+1 points in Fn(W) does not depend on W. Our proof of this motivates studying algebraic properties of the permutation π (depending on an irrational x and a positive integer n) that orders the fractional parts 1 x, 2 x, ..., n x, i.e., 0 < π(1) x < π(2) x < ... < π(n) x < 1. We give a formula for the sign of π, and prove that for every irrational x there are infinitely many n such that the order of π (as an element of the symmetric group Sn) is less than n.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.