Related papers: Splitting quaternion algebras over quadratic numbe…

We consider Clifford algebras over the field of real or complex numbers as a quotient algebra without fixed basis. We present classification of Clifford algebra elements based on the notion of quaternion type. This classification allows us…

This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…

Let $p$ and $q$ be two positive primes. Let $\ell$ be an odd positive prime integer and $F$ a quadratic number field. Let $K$ be an extension of $F$ such that $K$ is a dihedral extension of $\Q$ of degree $\ell$ over $F$ or $K$ is an…

This paper proposes distributed algorithms for solving linear equations to seek a least square solution via multi-agent networks. We consider that each agent has only access to a small and imcomplete block of linear equations rather than…

We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. We show that when the Graver basis of the matrix defining the…

The literature on quaternionic polynomials and, in particular, on methods for determining and classifying their zero-sets, is fast developing and reveals a growing interest on this subject. In contrast, polynomials defined over the algebra…

Let $F \in \mathbf{Z}[\boldsymbol{x}]$ be a diagonal, non-singular quadratic form in $4$ variables. Let $\lambda(n)$ be the normalised Fourier coefficients of a holomorphic Hecke form of full level. We give an upper bound for the problem of…

Quaternions often appear in wide areas of applied science and engineering such as wireless communications systems, mechanics, etc. It is known that are two types of non-isomorphic generalized quaternion algebras, namely: the algebra of…

Let ${\mathscr A}(D)$ be an algebra of functions continuous in the disk $D=\{z\in{\mathbb C}\,|\,\,\,|z|\leqslant 1\}$ and {\it holomorphic} into $D$. The well-known fact is that the set ${\mathscr M}$ of its characters (homomorphisms…

In this article we compute the $q$th power values of the quadratic polynomials $f$ with negative squarefree discriminant such that $q$ is coprime to the class number of the splitting field of $f$ over $\mathbb{Q}$. The theory of unique…

We present two new quantum algorithms that either find a triangle (a copy of $K_{3}$) in an undirected graph $G$ on $n$ nodes, or reject if $G$ is triangle free. The first algorithm uses combinatorial ideas with Grover Search and makes…

A fundamental problem in computer science is to find all the common zeroes of $m$ quadratic polynomials in $n$ unknowns over $\mathbb{F}_2$. The cryptanalysis of several modern ciphers reduces to this problem. Up to now, the best complexity…

Minimal annihilating polynomials are very useful in a wide variety of algorithms in exact linear algebra. A new efficient method is proposed for calculating the minimal annihilating polynomials for all the unit vectors, for a square matrix…

We study systems of quadratic forms over fields and their isotropy over 2-extensions. We apply this to obtain particular splitting fields for quaternion algebras defined over a finite field extension. As a consequence, we obtain that every…

No polynomial-time algorithm is known to test whether a sparse polynomial G divides another sparse polynomial $F$. While computing the quotient Q=F quo G can be done in polynomial time with respect to the sparsities of F, G and Q, this is…

Recently developed quantum algorithms address computational challenges in numerical analysis by performing linear algebra in Hilbert space. Such algorithms can produce a quantum state proportional to the solution of a $d$-dimensional system…

Quaternion optimization has attracted significant interest due to its broad applications, including color face recognition, video compression, and signal processing. Despite the growing literature on quadratic and matrix quaternion…

Solving quadratic equations over finite fields is a fundamental task in algebraic coding theory and serves as a key subroutine for computing the roots of cubic and quartic polynomials. Notably, any quadratic polynomial over binary extension…

This paper is a sequel to "Computing diagonal form and Jacobson normal form of a matrix using Groebner bases", J. of Symb. Computation, 46 (5), 2011. We present a new fraction-free algorithm for the computation of a diagonal form of a…

Let $p_{1}, p_{2}$ be two distinct prime integers, let $n$ be a positive integer, $n$$\geq 3$ and let $\xi_{n} $ be a primitive root of order $n$ of the unity. In this paper we obtain a complete characterization for a quaternion algebra…