2024/05/27 by Tom Goertzen, Goertzen, Tom
Engineering · #Combinatorics (math.CO) #FOS: Mathematics #Scheduling and Optimization Algorithms
paper · pdf · doi:10.48550/arxiv.2405.17644
openalex publication_date 2024/05/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The study of interlocking assemblies is an emerging field with applications in various disciplines. However, to this day, the mathematical treatment of these assemblies has been sparse. In this work, we develop a comprehensive mathematical theory for interlocking assemblies, providing a precise definition and a method for proving the interlocking property based on infinitesimal motions. We consider assemblies with crystallographic symmetries and verify interlocking properties for such assemblies. Our analysis includes the development of an infinite polytope with crystallographic symmetries to ensure that the interlocking property holds. For a certain block, called the RhomBlock, that can be assembled in numerous ways, characterised by the combinatorial theory of lozenges, we rigorously prove the interlocking property. By conclusively showing that any assembly of the RhomBlock is interlocking, we provide a robust framework for further exploration and application of interlocking assemblies.