000220914 001__ 220914
000220914 005__ 20181203024329.0
000220914 0247_ $$2doi$$a10.1016/j.tcs.2016.02.038
000220914 037__ $$aARTICLE
000220914 245__ $$aDipole codes attractively encode glue functions
000220914 269__ $$a2016
000220914 260__ $$c2016
000220914 336__ $$aJournal Articles
000220914 520__ $$aDipole 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.
000220914 6531_ $$aself-assembly
000220914 6531_ $$acoding
000220914 6531_ $$amagnetics
000220914 700__ $$aIpparthi, Dhananjay
000220914 700__ $$0244528$$aMastrangeli, Massimo$$g208618
000220914 700__ $$aWinslow, Andrew
000220914 773__ $$j671$$q19-25$$tTheoretical Computer Science
000220914 8564_ $$s761327$$uhttps://infoscience.epfl.ch/record/220914/files/Ipparthi%20-%20Dipole%20codes%20attractively%20encode%20glue%20functions.pdf$$yPostprint$$zPostprint
000220914 909C0 $$0252371$$pSTI$$xU10274
000220914 909CO $$ooai:infoscience.tind.io:220914$$pSTI$$particle
000220914 917Z8 $$x208618
000220914 917Z8 $$x148230
000220914 917Z8 $$x208618
000220914 917Z8 $$x148230
000220914 937__ $$aEPFL-ARTICLE-220914
000220914 973__ $$aOTHER$$rREVIEWED$$sPUBLISHED
000220914 980__ $$aARTICLE