Abstract:
We prove that all identities of the algebra of simplified insertion on countably many generators over a field of characteristic zero follow from the right-symmetric identity. We prove that the bases of the free special Jordan algebra and the special algebra of simplified insertion coincide. We construct an infinite series of relations in the algebra of simplified insertion which hold for the words of length $k$, $k\in\mathbb N$.
Keywords:theory of DNA computing, algebra of simplified insertion, special algebra of simplified insertion, right-symmetric algebra.