Abstract
The operation of binary intermolecular recombination, originating in the theory of DNAcomputing, permits a natural generalization to $n$-ary operations which performsimultaneous recombination of $n$ molecules. In the case $n = 3$, we use computeralgebra to determine the polynomial identities of degree $\le 9$ satisfied by this trilinearnonassociative operation. Our approach requires computing a basis for the nullspace ofa large integer matrix, and for this we compare two methods: the row canonical form, andthe Hermite normal form with lattice basis reduction. In the conclusion, we formulatesome conjectures for the general case of $n$-ary intermolecular recombination.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
