Distance sequences in infinite regular tessellations

DOI10.1016/0012-365X(94)00164-0MaRDI QIDQ1903731zbMATH OpenFDO

Authors Pascal Préa

Publication date 30 May 1996

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(94)00164-0

zbMATH Keywords

distance sequencesEuclidean tessellationhyperbolic tessellationsregular tessellationstilings

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45)

Review text

The author gives formulae for calculating distance sequences in hyperbolic and Euclidean tessellation and uses them to characterize the Euclidean tessellation as the regular tessellation whose distance sequence is linear. For hyperbolic tessellations \(\{p,q\}\), the author shows that \(q\) divides the circumference \(c_n\) of the circles of radius \(n\).

Recommendations

• Counting domains in \(\{p,q\}\) tessellations
• A census of vertices by generations in regular tessellations of the plane
• Enumeration of vertices, edges and polygons in tessellations of the plane
• Distance sequences and percolation thresholds in archimedean tilings
• On the behavior of growth of polygons in semi-regular hyperbolic tessellations

Cited in

(5)

• Distances on Lozenge Tilings
• Infinite Regular Hexagon Sequences on a Triangle
• Enumeration of vertices, edges and polygons in tessellations of the plane
• A census of vertices by generations in regular tessellations of the plane
• Distance sequences and percolation thresholds in archimedean tilings

This page was built for publication: Distance sequences in infinite regular tessellations

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