A 2-chain can interlock with a k-chain
Julie Glass, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink,, Jianyuan K. Zhong
TL;DR
This paper proves that a flexible 2-chain can interlock with a flexible, open 16-chain, addressing an open problem about the minimal k for interlocking with a 2-chain.
Contribution
It establishes the existence of a specific k (16) for which a flexible open chain can interlock with a 2-chain, confirming a long-standing open problem.
Findings
A flexible 2-chain can interlock with a flexible open 16-chain.
The paper confirms the existence of such interlocking configurations.
Addresses an open problem in chain interlocking theory.
Abstract
One of the open problems posed in [3] is: what is the minimal number k such that an open, flexible k-chain can interlock with a flexible 2-chain? In this paper, we establish the assumption behind this problem, that there is indeed some k that achieves interlocking. We prove that a flexible 2-chain can interlock with a flexible, open 16-chain.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Optimization Algorithms · Interconnection Networks and Systems · Modular Robots and Swarm Intelligence