Staircases in Z^2
Number Theory
2009-06-08 v1 Combinatorics
Abstract
A staircase is the set of points in Z^2 below a given rational line in the plane that have Manhattan Distance less than 1 to the line. Staircases are closely related to Beatty and Sturmian sequences of rational numbers. Connecting the geometry and the number theoretic concepts, we obtain three equivalent characterizations of Sturmian sequences of rational numbers, as well as a new proof of Barvinok's Theorem in dimension two, a recursion formula for Dedekind-Carlitz polynomials and a partially new proof of White's characterization of empty lattice tetrahedra. Our main tool is a recursive description of staircases in the spirit of the Euclidean Algorithm.
Cite
@article{arxiv.0906.1191,
title = {Staircases in Z^2},
author = {Felix Breuer and Frederik von Heymann},
journal= {arXiv preprint arXiv:0906.1191},
year = {2009}
}
Comments
32 pages, 11 figures