Related papers: The degeneracy of the genetic code and Hadamard ma…
Let $\boldsymbol\Lambda_3(\mathbb C)\,(=\mathbb C^{27})$ be the space of structure vectors of $3$-dimensional algebras over $\mathbb C$ considered as a $G$-module via the action of $G={\rm GL}(3,\mathbb C)$ on $\boldsymbol\Lambda_3(\mathbb…
The systematics of indices of physico-chemical properties of codons and amino acids across the genetic code are examined. Using a simple numerical labelling scheme for nucleic acid bases, data can be fitted as low-order polynomials of the 6…
A partial Hadamard matrix $H\in M_{M\times N}(\mathbb C)$ is called of "classical type" if the associated quantum semigroup $G\subset\widetilde{S}_M^+$ is classical. In combinatorial terms, if $H_1,\ldots,H_M\in\mathbb T^N$ are the rows of…
Conjugation covariants of matrices are applied to study the real algebraic variety consisting of complex Hermitian matrices with a bounded number of distinct eigenvalues. A minimal generating system of the vanishing ideal of degenerate…
We study the computational model where we can access a matrix $\mathbf{A}$ only by computing matrix-vector products $\mathbf{A}\mathrm{x}$ for vectors of the form $\mathrm{x} = \mathrm{x}_1 \otimes \cdots \otimes \mathrm{x}_q$. We prove…
Knowledge graph embedding research has mainly focused on learning continuous representations of entities and relations tailored towards the link prediction problem. Recent results indicate an ever increasing predictive ability of current…
Hypergraphs and tensors extend classic graph and matrix theory to account for multiway relationships, which are ubiquitous in engineering, biological, and social systems. While the Kronecker product is a potent tool for analyzing the…
We study the supersymmetric ground states of the Kronecker model of quiver quantum mechanics. This is the simplest quiver with two gauge groups and bifundamental matter fields, and appears universally in four-dimensional N=2 systems. The…
In a certain way, this paper presents the continuation of the previous one which discussed the harmonic structure of the genetic code (Rakocevic, 2004). Several new harmonic structures presented in this paper, through specific unity and…
All generalized Hadamard matrices of order 18 over a group of order 3, H(6,3), are enumerated in two different ways: once, as class regular symmetric (6,3)-nets, or symmetric transversal designs on 54 points and 54 blocks with a group of…
A new method of obtaining a sequence of isolated complex Hadamard matrices (CHM) for dimensions $N\geqslant 7$, based on block-circulant structures, is presented. We discuss, several analytic examples resulting from a modification of the…
Let $A$ be a gentle algebra. For every collection of string and band diagrammes, we consider the constructible subset of the variety of representations containing all modules with this underlying diagramme. We study degenerations of such…
The quantum enveloping algebra U_q(sl(2) \oplus sl(2)) in the limit q \to 0 is proposed as a symmetry algebra for the genetic code. In this approach the triplets of nucleotids or codons in the DNA chain are classified in crystal bases,…
A representation of the genetic code as a six-dimensional Boolean hypercube is proposed. It is assumed here that this structure is the result of the hierarchical order of the interaction energies of the bases in codon-anticodon recognition.…
A considerable amount of the standard model's three-generation structure can be realised from just the $8\hspace{.3mm}\mathbb{C}$-dimensional algebra of the complex octonions. Indeed, it is a little-known fact that the complex octonions can…
In this paper we study the structure of specific linear codes called DNA codes. The first attempts on studying such codes have been proposed over four element rings which are naturally matched with DNA four letters. Later, double (pair) DNA…
Convex neural codes are combinatorial structures describing the intersection pattern of a collection of convex sets. Inductively pierced codes are a particularly nice subclass of neural codes introduced in the information visualization…
Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…
This paper initiates the study of the "Laplacian simplex" $T_G$ obtained from a finite graph $G$ by taking the convex hull of the columns of the Laplacian matrix for $G$. Basic properties of these simplices are established, and then a…
We associate to every matroid M a polynomial with integer coefficients, which we call the Kazhdan-Lusztig polynomial of M, in analogy with Kazhdan-Lusztig polynomials in representation theory. We conjecture that the coefficients are always…