Three distance theorem and grid graph.

DOI10.1016/S0012-365X(00)00098-4zbMATH Open1034.11018OpenAlexW1981914297MaRDI QIDQ1587619FDOQ1587619

Authors: Nicolas Chevallier 

Publication date: 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00098-4

Recommendations

• Some constructions for the higher-dimensional three-distance theorem
• Cyclic Groups and the Three Distance Theorem
• A Five Distance Theorem for Kronecker Sequences
• Eleven Euclidean distances are enough
• Generalization of a theorem of Steinhaus

zbMATH Keywords

connected componentirrational rotationthree distance theorem

Mathematics Subject Classification ID

Distance in graphs (05C12) Other combinatorial number theory (11B75) Distribution modulo one (11J71)

Cited In (10)

• A Five Distance Theorem for Kronecker Sequences
• Patterns for multigrid equidistributed functions: application to general parabolas and length estimation
• Higher-dimensional gap theorems for the maximum metric
• Stepped hyperplane and extension of the three distance theorem
• Title not available (Why is that?)
• A generalization of the 3d distance theorem
• Some constructions for the higher-dimensional three-distance theorem
• Nearest neighbor distances on a circle: Multidimensional case
• Billiards and the five distance theorem
• Eleven Euclidean distances are enough

This page was built for publication: Three distance theorem and grid graph.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587619)