Related papers: Identifying the matrix ring: algorithms for quater…
We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the…
We present an explicit basis for orders of arbitrary level N>1 in definite rational quaternion algebras. These orders have applications to computations of spaces of elliptic and quaternionic modular forms.
We design efficient algorithms to evaluate modular equations of Siegel and Hilbert type for abelian surfaces over number fields or finite fields using complex approximations. Their output is provably correct when the associated graded ring…
We construct a class of representations of the quadratic R-matrix algebra, given by the reflection equation with the spectral parameter, in terms of certain ordinary difference operators. These operators turn out to act as parameter…
We discuss a procedure to determine finite sets $\mathcal{M}$ within the commutant of an algebraic Hamiltonian in the enveloping algebra of a Lie algebra $\mathfrak{g}$ such that their generators define a quadratic algebra. Although…
Finding a Hadamard matrix (H-matrix) among the set of all binary matrices of corresponding order is a hard problem, which potentially can be solved by quantum computing. We propose a method to formulate the Hamiltonian of finding H-matrix…
We propose a new approach to the geometry of the four-qubit entanglement classes depending on parameters. More precisely, we use invariant theory and algebraic geometry to describe various stratifications of the Hilbert space by SLOCC…
Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…
In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
Matrix representations are a powerful tool for designing efficient algorithms for combinatorial optimization problems such as matching, and linear matroid intersection and parity. In this paper, we initiate the study of matrix…
Given an ideal of forms in an algebra (polynomial ring, tensor algebra, exterior algebra, Lie algebra, bigraded polynomial ring), we consider the Hilbert series of the factor ring. We concentrate on the minimal Hilbert series, which is…
We study the transference through finite index extensions of the notion of equational coherence, as well as its effective counterpart. We deduce an explicit algorithm for solving the following algorithmic problem about size two integral…
The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…
There are 13 equivalence classes of 2D second order quantum and classical superintegrable systems with nontrivial potential, each associated with a quadratic algebra of hidden symmetries. We study the finite and infinite irreducible…
This paper provides an in-depth analysis of how computational algebraic geometry can be used to deal with the problem of counting and classifying $r\times s$ partial Latin rectangles based on $n$ symbols of a given size, shape, type or…
Although there is no natural internal product for hermitian forms over an algebra with involution of the first kind, we describe how to multiply two $\varepsilon$-hermitian forms to obtain a quadratic form over the base field. This allows…
Numerous attempts have been made to replicate the success of complex-valued algebra in engineering and science to other hypercomplex domains such as quaternions, tessarines, biquaternions, and octonions. Perhaps, none have matched the…
Let $R$ be either the ring of Lipschitz quaternions, or the ring of Hurwitz quaternions. Then, $R$ is a subring of the division ring $\mathbb{D}$ of rational quaternions. For $S \subseteq R$, we study the collection $\rm{Int}(S,R) = \{f \in…
In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced…