Related papers: Splitting quaternion algebras over quadratic numbe…

We describe an algorithm to compute the essentially different factorizations of a given image primitive integer-valued polynomial $f(X)=g(X)/d\in\Q[X]$, where $g\in\Z[X]$ and $d\in\N$ is square-free, assuming that the factorization of…

We study partitions of totally positive integers in real quadratic fields. We develop an algorithm for computing the number of partitions, prove a result about the parity of the partition function, and characterize the quadratic fields such…

There are four division algebras over $\mathbb{R}$, namely real numbers, complex numbers, quaternions, and octonions. Lack of commutativity and associativity make it difficult to investigate algebraic and geometric properties of octonions.…

We present a novel idea to compute square roots over finite fields, without being given any quadratic nonresidue, and without assuming any unproven hypothesis. The algorithm is deterministic and the proof is elementary. In some cases, the…

Let p and q be two positive primes. In this paper we obtain a complete characterization of quaternion division algebras H_K(p,q) over the composite K of n quadratic number fields. Also, in Section 6, we obtain a characterization of…

We provide an algorithm that, given any order $O$ in a quaternion algebra over a global field, computes representatives of all right equivalence classes of right $O$-ideals, including the non-invertible ones. The theory is developed for a…

In this work, a rationalized algorithm for calculating the quotient of two quaternions is presented which reduces the number of underlying real multiplications. Hardware for fast multiplication is much more expensive than hardware for fast…

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…

We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…

{\small In this paper, we find a class of division quaternion algebras over the field }$\mathbb{Q}\left( i\right) ${\small \ and a class of division symbol algebras over a cyclotomic field.}

In this paper we presents an algorithm for finding a solution of the linear nonhomogeneous quaternionic-valued differential equations. Moveover, several examples shows the feasibility of our algorithm.

Let $\K$ be an algebraic number field of degree $d$ and discriminant $\Delta$ over $\Q$. Let $\A$ be an associative algebra over $\K$ given by structure constants such that $\A\cong M_n(\K)$ holds for some positive integer $n$. Suppose that…

We give a Euclidean division algorithm for the real quadratic fields $\mathbb{Q}(\sqrt{m})$ for $m \in \{2, 3, 6, 7, 11, 19\}$, with the property that the norm of the remainder depends on the first Euclidean minimum of the field. In each…

Let d be a squarefree integer. Does there exist four squares in arithmetic progression over Q(sqrt{d})? We shall give a partial answer to this question, depending on the value of d. In the affirmative case, we construct explicit arithmetic…

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

In this paper, an exact algorithm in polynomial time is developed to solve unrestricted binary quadratic programs. The computational complexity is $O\left( n^{\frac{15}{2}}\right) $, although very conservative, it is sufficient to prove…

Working over the split octonions over an algebraically closed field, we solve all polynomial equations in which all the coefficients but the constant term are scalar. As a consequence, we calculate the n-th roots of an octonion.

We study solutions of a homogeneous quadratic equation $q(x_0,\dots, x_n)=0$, defined over a field $K$, where the $x_i$ are themselves homogeneous polynomials of some degree $d$ in $r+1$ variables. Equivalently, we are looking at rational…

Quartic eigenvalue problem $(\lambda^4 A + \lambda^3 B + \lambda^2C + \lambda D + E)x = \mathbf{0}$ naturally arises e.g. when solving the Orr-Sommerfeld equation in the analysis of the stability of the {Poiseuille} flow, in theoretical…

We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…