Related papers: Computing square roots in quaternion algebras
The class of non-commutative hypercomplex number systems (HNS) of 4-dimension, constructed by using of non-commutative Grassmann-Clifford procedure of doubling of 2-dimensional systems is investigated in the article and established here are…
Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in log D on average (relative to the stable log-uniform measure), for counting the number of real roots…
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related…
Given a field with a set of discrete valuations $V$, we show how the genus of a division algebra over the field is related to the genus of the residue algebras at various valuations in $V$ and the ramification data. When the division…
To determine the global root number of an elliptic curve defined over a number field, one needs to understand all the local root numbers. These have been classified except at places above 2, and in this paper we attempt to complete the…
We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
We use the relations between quadrics, trace codes and algebraic curves to construct algebraic curves over finite fields with many points and to compute generalized Hamming weights of codes.
We give details of a formerly known relation between ternary quadratic forms and quaternion orders through the even Clifford algebra. Based on this and classifications of ternary quadratic forms we give a completely explicit classification…
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…
A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…
In this paper we study the properties of an algorithm for generating continued fractions in the field of p-adic numbers $\mathbb{Q}_p$. First of all, we obtain an analogue of the Galois' Theorem for classical continued fractions. Then, we…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
In this paper, we have proposed a novel VLSI-oriented approach to computing the rotation matrix entries from the quaternion coefficients. The advantage of this approach is the complete elimination of multiplications and replacing them by…
The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…
An efficient, when compared to exhaustive enumeration, algorithm for computing the number of square-free words of length $n$ over the alphabet $\{a, b, c\}$ is presented.
Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…
This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.
We propose a method for determining which integers can be written as a sum of two integral squares for quadratic fields $\Q(\sqrt{\pm p})$, where $p$ is a prime.
We present squareplus, an activation function that resembles softplus, but which can be computed using only algebraic operations: addition, multiplication, and square-root. Because squareplus is ~6x faster to evaluate than softplus on a CPU…