pith. sign in

arxiv: cs/0410052 · v1 · submitted 2004-10-20 · 💻 cs.CG · cs.DM

A 2-chain can interlock with a k-chain

Julie Glass , Stefan Langerman , Joseph O'Rourke , Jack Snoeyink , Jianyuan K. Zhong This is my paper
classification 💻 cs.CG cs.DM
keywords chainflexibleinterlockopenk-chainachievesassumptionbehind
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.