Polynomial identities for ternary intermolecular recombination (Q542534): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / review text
 
The operation of binary intermolecular recombination [\textit{L. Landweber} and \textit{L. Kari}, ``The evolution of cellular computing: nature's solution to a computational problem'', Biosystems 52, 3--13 (1999)], originating in the theory of DNA computing, permits a natural generalization to \(n\)-ary operations. The present paper versus with the case \(n = 3\). The author uses computer algebra to determine the polynomial identities of degree \(\leq 9\) satisfied by ternary intermolecular recombination. Let \(X\) be a finite set, consider the set \[ X^* = \{x_1 x_2 \ldots x_k \mid x_1, x_2, \ldots, x_k \in X \, (k \geq 1) \} \] with the binary operation of concatenation, \[ (x_1 x_2 \ldots x_k)(x_{k + 1}x_{k + 2} \ldots x_{k + \ell}) \mapsto x_1 x_2 \ldots x_{k + \ell}, \] \textit{L. Landweber} and \textit{L. Kari} (loc. cit.) that is, the free semigroup on \(X\). Given a positive integer \(n\), denote by \(R(X, n)\) the \(\mathbb{Q}\)-vector space with basis \((X^*)^n\), the set of all \(n\)-tuples of elements of \(X^*\). The \textbf{\(n\)-ary intermolecular recombination} is the multilinear nonassociative operation, denoted \(\{a_1, a_2, \ldots, a_n\}\), and defined on basis elements \(a_i = (a_{i1}, a_{i2}, \ldots, a_{in}) \in (X^*)^n\) as follows: \[ \{a_1, a_2, \ldots, a_n\} = \sum_{\sigma \in S_n} (a_{\sigma(1), 1}, a_{\sigma(2), 2}, \ldots, a_{\sigma(n), n}), \] where \(S_n\) is the symmetric group on \(\{1, 2, \ldots, n\}\). The paper is organized as follows: in Section 2, the author recalls the main results of \textit{M. R. Bremner}, [``Jordan algebras arising from intermolecular recombination'', SIGSAM Bull. 39, No. 4, 106--117 (2005; Zbl 1226.17026)] on polynomial identities for binary intermolecular recombination. He also shows how these results can be improved by using the Hermite normal form with lattice basis reduction. Section 3 contains the main results of the paper: a complete and minimal set of polynomial identities of degree \(\leq 9\) for ternary intermolecular recombination is provided. He concludes the paper by posting, in Section 4, three interesting conjectures on polynomial identities for the general case of \(n\)-ary intermolecular recombination. As the author points out these conjectures has been proved by \textit{S. R. Sverchkov}, [``The structure and representation of \(n\)-ary algebras of DNA recombination'', Cent. Eur. J. Math. 9, No. 6, 1193--1216 (2011; Zbl 1252.17016)]. He received Sverchkov's preprint shortly before the final version of the present paper was sent to the editors.
Property / review text: The operation of binary intermolecular recombination [\textit{L. Landweber} and \textit{L. Kari}, ``The evolution of cellular computing: nature's solution to a computational problem'', Biosystems 52, 3--13 (1999)], originating in the theory of DNA computing, permits a natural generalization to \(n\)-ary operations. The present paper versus with the case \(n = 3\). The author uses computer algebra to determine the polynomial identities of degree \(\leq 9\) satisfied by ternary intermolecular recombination. Let \(X\) be a finite set, consider the set \[ X^* = \{x_1 x_2 \ldots x_k \mid x_1, x_2, \ldots, x_k \in X \, (k \geq 1) \} \] with the binary operation of concatenation, \[ (x_1 x_2 \ldots x_k)(x_{k + 1}x_{k + 2} \ldots x_{k + \ell}) \mapsto x_1 x_2 \ldots x_{k + \ell}, \] \textit{L. Landweber} and \textit{L. Kari} (loc. cit.) that is, the free semigroup on \(X\). Given a positive integer \(n\), denote by \(R(X, n)\) the \(\mathbb{Q}\)-vector space with basis \((X^*)^n\), the set of all \(n\)-tuples of elements of \(X^*\). The \textbf{\(n\)-ary intermolecular recombination} is the multilinear nonassociative operation, denoted \(\{a_1, a_2, \ldots, a_n\}\), and defined on basis elements \(a_i = (a_{i1}, a_{i2}, \ldots, a_{in}) \in (X^*)^n\) as follows: \[ \{a_1, a_2, \ldots, a_n\} = \sum_{\sigma \in S_n} (a_{\sigma(1), 1}, a_{\sigma(2), 2}, \ldots, a_{\sigma(n), n}), \] where \(S_n\) is the symmetric group on \(\{1, 2, \ldots, n\}\). The paper is organized as follows: in Section 2, the author recalls the main results of \textit{M. R. Bremner}, [``Jordan algebras arising from intermolecular recombination'', SIGSAM Bull. 39, No. 4, 106--117 (2005; Zbl 1226.17026)] on polynomial identities for binary intermolecular recombination. He also shows how these results can be improved by using the Hermite normal form with lattice basis reduction. Section 3 contains the main results of the paper: a complete and minimal set of polynomial identities of degree \(\leq 9\) for ternary intermolecular recombination is provided. He concludes the paper by posting, in Section 4, three interesting conjectures on polynomial identities for the general case of \(n\)-ary intermolecular recombination. As the author points out these conjectures has been proved by \textit{S. R. Sverchkov}, [``The structure and representation of \(n\)-ary algebras of DNA recombination'', Cent. Eur. J. Math. 9, No. 6, 1193--1216 (2011; Zbl 1252.17016)]. He received Sverchkov's preprint shortly before the final version of the present paper was sent to the editors. / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 17A40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 17A42 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 17C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 92D20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5906829 / rank
 
Normal rank
Property / zbMATH Keywords
 
intermolecular recombination
Property / zbMATH Keywords: intermolecular recombination / rank
 
Normal rank
Property / zbMATH Keywords
 
multilinear operations
Property / zbMATH Keywords: multilinear operations / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomial identities
Property / zbMATH Keywords: polynomial identities / rank
 
Normal rank
Property / zbMATH Keywords
 
nonassociative algebra
Property / zbMATH Keywords: nonassociative algebra / rank
 
Normal rank
Property / zbMATH Keywords
 
Hermite normal form
Property / zbMATH Keywords: Hermite normal form / rank
 
Normal rank
Property / zbMATH Keywords
 
lattice basis reduction
Property / zbMATH Keywords: lattice basis reduction / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963778845 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1008.2014 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:07, 18 April 2024

scientific article
Language Label Description Also known as
English
Polynomial identities for ternary intermolecular recombination
scientific article

    Statements

    Polynomial identities for ternary intermolecular recombination (English)
    0 references
    0 references
    10 June 2011
    0 references
    The operation of binary intermolecular recombination [\textit{L. Landweber} and \textit{L. Kari}, ``The evolution of cellular computing: nature's solution to a computational problem'', Biosystems 52, 3--13 (1999)], originating in the theory of DNA computing, permits a natural generalization to \(n\)-ary operations. The present paper versus with the case \(n = 3\). The author uses computer algebra to determine the polynomial identities of degree \(\leq 9\) satisfied by ternary intermolecular recombination. Let \(X\) be a finite set, consider the set \[ X^* = \{x_1 x_2 \ldots x_k \mid x_1, x_2, \ldots, x_k \in X \, (k \geq 1) \} \] with the binary operation of concatenation, \[ (x_1 x_2 \ldots x_k)(x_{k + 1}x_{k + 2} \ldots x_{k + \ell}) \mapsto x_1 x_2 \ldots x_{k + \ell}, \] \textit{L. Landweber} and \textit{L. Kari} (loc. cit.) that is, the free semigroup on \(X\). Given a positive integer \(n\), denote by \(R(X, n)\) the \(\mathbb{Q}\)-vector space with basis \((X^*)^n\), the set of all \(n\)-tuples of elements of \(X^*\). The \textbf{\(n\)-ary intermolecular recombination} is the multilinear nonassociative operation, denoted \(\{a_1, a_2, \ldots, a_n\}\), and defined on basis elements \(a_i = (a_{i1}, a_{i2}, \ldots, a_{in}) \in (X^*)^n\) as follows: \[ \{a_1, a_2, \ldots, a_n\} = \sum_{\sigma \in S_n} (a_{\sigma(1), 1}, a_{\sigma(2), 2}, \ldots, a_{\sigma(n), n}), \] where \(S_n\) is the symmetric group on \(\{1, 2, \ldots, n\}\). The paper is organized as follows: in Section 2, the author recalls the main results of \textit{M. R. Bremner}, [``Jordan algebras arising from intermolecular recombination'', SIGSAM Bull. 39, No. 4, 106--117 (2005; Zbl 1226.17026)] on polynomial identities for binary intermolecular recombination. He also shows how these results can be improved by using the Hermite normal form with lattice basis reduction. Section 3 contains the main results of the paper: a complete and minimal set of polynomial identities of degree \(\leq 9\) for ternary intermolecular recombination is provided. He concludes the paper by posting, in Section 4, three interesting conjectures on polynomial identities for the general case of \(n\)-ary intermolecular recombination. As the author points out these conjectures has been proved by \textit{S. R. Sverchkov}, [``The structure and representation of \(n\)-ary algebras of DNA recombination'', Cent. Eur. J. Math. 9, No. 6, 1193--1216 (2011; Zbl 1252.17016)]. He received Sverchkov's preprint shortly before the final version of the present paper was sent to the editors.
    0 references
    intermolecular recombination
    0 references
    multilinear operations
    0 references
    polynomial identities
    0 references
    nonassociative algebra
    0 references
    Hermite normal form
    0 references
    lattice basis reduction
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references