Dipole Codes Attractively Encode Glue Functions
Dhananjay Ipparthi, Massimo Mastrangeli, Andrew Winslow

TL;DR
This paper introduces dipole codes, a novel way to encode glue functions using magnetic dipole sequences, with optimal length and broad applicability.
Contribution
It proves that every glue function can be attractively encoded by dipole codes and provides asymptotically optimal constructions.
Findings
Dipole codes can encode any glue function accurately.
Optimal length dipole codes are achievable for general and specific glue functions.
The method offers a new approach to modeling bonding interactions.
Abstract
Dipole words are sequences of magnetic dipoles, in which alike elements repel and opposite elements attract. Magnetic dipoles contrast with more general sets of bonding types, called glues, in which pairwise bonding strength is specified by a glue function. We prove that every glue function has a set of dipole words, called a dipole code, that attractively encodes : the pairwise attractions (positive or non-positive bond strength) between the words are identical to those of . Moreover, we give such word sets of asymptotically optimal length. Similar results are obtained for a commonly used subclass of glue functions.
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
TopicsDNA and Biological Computing · Cellular Automata and Applications · semigroups and automata theory
