Header logo is

Dipole codes attractively encode glue functions




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 g has a set of dipole words, called a dipole code, that attractively encodes g: the pairwise attractions (positive or non-positive bond strength) between the words are identical to those of g. Moreover, we give such word sets of asymptotically optimal length. Similar results are obtained for a commonly used subclass of glue functions.

Author(s): Ipparthi, Dhananjay and Mastrangeli, Massimo and Winslow, Andrew
Journal: Theoretical Computer Science
Volume: 671
Pages: 19 - 25
Year: 2017
Month: August
Day: 11

Department(s): Physical Intelligence
Bibtex Type: Article (article)

DOI: https://doi.org/10.1016/j.tcs.2016.02.038
Note: Computational Self-Assembly
URL: http://www.sciencedirect.com/science/article/pii/S0304397516002000


  title = {Dipole codes attractively encode glue functions},
  author = {Ipparthi, Dhananjay and Mastrangeli, Massimo and Winslow, Andrew},
  journal = {Theoretical Computer Science},
  volume = {671},
  pages = {19 - 25},
  month = aug,
  year = {2017},
  note = {Computational Self-Assembly},
  url = {http://www.sciencedirect.com/science/article/pii/S0304397516002000},
  month_numeric = {8}