Related papers: The degeneracy of the genetic code and Hadamard ma…
In this paper, we propose a new erasure decoding algorithm for convolutional codes using the generator matrix. This implies that our decoding method also applies to catastrophic convolutional codes in opposite to the classic approach using…
The coupling coefficients (3j-symbols) for the symmetric (most degenerate) irreducible representations of the orthogonal groups SO(n) in a canonical basis and different semicanonical (tree) bases [with SO(n) restricted to SO(n')\times…
As observed by Kawamata, a $\mathbb{Q}$-Gorenstein smoothing of a Wahl singularity gives rise to a one-parameter flat degeneration of a matrix algebra. A similar result holds for a general smoothing of any two-dimensional cyclic quotient…
One studies certain degenerations of the generic square matrix over a field $k$ along with its main related structures, such as the determinant of the matrix, the ideal generated by its partial derivatives, the polar map defined by these…
We present a computational approach to studying the structure of the representation ring of the symmetric group in dimension six. The Kronecker coefficients and all power formulae of irreducible representations of $S_6$ are computed using…
Thomassen showed that planar graphs are 5-list-colourable, and that planar graphs of girth at least five are 3-list-colourable. An easy degeneracy argument shows that planar graphs of girth at least four are 4-list-colourable. In 2022,…
In 1934, Jordan et al. gave a necessary algebraic condition, the Jordan identity, for a sensible theory of quantum mechanics. All but one of the algebras that satisfy this condition can be described by Hermitian matrices over the complexes…
Heegaard splittings provide a natural representation of closed 3-manifolds by gluing two handlebodies along a common surface. These splittings can be equivalently given by two finite sets of meridians lying on the surface, which define a…
Let $G$ be a bridgeless cubic graph. Consider a list of $k$ 1-factors of $G$. Let $E_i$ be the set of edges contained in precisely $i$ members of the $k$ 1-factors. Let $\mu_k(G)$ be the smallest $|E_0|$ over all lists of $k$ 1-factors of…
Genetic algorithms are heuristic optimization techniques inspired by Darwinian evolution, which are characterized by successfully finding robust solutions for optimization problems. Here, we propose a subroutine-based quantum genetic…
Consider a linear realization of a matroid over a field. One associates with it a configuration polynomial and a symmetric bilinear form with linear homogeneous coefficients. The corresponding configuration hypersurface and its non-smooth…
Neural codes are binary codes that are used for information processing and representation in the brain. In previous work, we have shown how an algebraic structure, called the {\it neural ring}, can be used to efficiently encode geometric…
In the present work, 16 genetic code doublets and their cognate amino acids in the genetic code are fitted into a polyhedron model. Based on the structural regularity in nucleobases, and by using a series of common-sense topological…
This short note introduces a geometric representation for binary (or ternary) sequences. The proposed representation is linked to multivariate data plotting according to the radar chart. As an illustrative example, the binary Hamming…
Convolutional codes are constructed, designed and analysed using row and/or block structures of unit algebraic schemes. Infinite series of such codes and of codes with specific properties are derived. Properties are shown algebraically and…
A general treatment of the spectral problem of quantum graphs and tight-binding models in finite Hilbert spaces is given. The direct spectral problem and the inverse spectral problem are written in terms of simple algebraic equations…
We study the problem of finding homomorphisms into odd cycles from planar graphs with high odd-girth. The Jaeger-Zhang conjecture states that every planar graph of odd-girth at least $4k+1$ admits a homomorphism to the odd cycle $C_{2k+1}$.…
The Heegaard genus is a fundamental invariant of 3-manifolds. However, computing the Heegaard genus of a triangulated 3-manifold is NP-hard, and while algorithms exist, little work has been done in making such an algorithm efficient and…
In this paper, we study a structured family of matrices whose entries are given by products of $k$-Fibonacci and $k$-Lucas numbers. For this family, we obtain explicit and unified formulas for several classical matrix invariants, including…
This paper explores the representation of quantum computing in terms of unitary reflections (unitary transformations that leave invariant a hyperplane of a vector space). The symmetries of qubit systems are found to be supported by…