Dipole Codes Attractively Encode Glue Functions
Formal Languages and Automata Theory
2015-12-03 v1
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.
Cite
@article{arxiv.1512.00779,
title = {Dipole Codes Attractively Encode Glue Functions},
author = {Dhananjay Ipparthi and Massimo Mastrangeli and Andrew Winslow},
journal= {arXiv preprint arXiv:1512.00779},
year = {2015}
}
Comments
To appear in Theoretical Computer Science