Related papers: New algorithms for modular inversion and represent…
When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are…
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…
This paper introduces two forms of modular inverses and proves their reciprocity formulas respectively. These formulas are then applied to formulate new and generalized algorithm for computing these modular inverses. The same algorithm is…
The binary Euclidean algorithm is a variant of the classical Euclidean algorithm. It avoids multiplications and divisions, except by powers of two, so is potentially faster than the classical algorithm on a binary machine. We describe the…
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…
A unitary (Euclidean) representation of a quiver is given by assigning to each vertex a unitary (Euclidean) vector space and to each arrow a linear mapping of the corresponding vector spaces. We recall an algorithm for reducing the matrices…
We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…
In this paper we consider certain quaternary quadratic forms and octonary quadratic forms and by using the theory of modular forms, we find formulae for the number of representations of a positive integer by these quadratic forms.
This article reports the occurrence of binary quadratic forms in primitive Pythagorean triangles and their geometric interpretation. In addition to the well-known fact that the hypotenuse, z, of a right triangle, with sides of integral…
There is a classical geometric construction which uses a binary quadratic form to define an involution on the space of binary d-ics. We give a complete characterization of a general class of such involutions which are definable using…
Using modular forms we determine formulas for the number of representations of a positive integer by diagonal octonary quadratic forms with coefficients $1$, $2$, $3$ or $6$.
Consider the representation of a rational number in the form, associated with "centered" Euclidean algorithm. We prove a new formula for the limit distribution function for sequences of rationals with bounded sum of partial quotients.
We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…
This paper presents a system for solving binary-valued linear equations using quantum computers. The system is called Mod2VQLS, which stands for Modulo2 Variational Quantum Linear Solver. As far as we know, this is the first such proposal.…
It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The…
We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give…
We construct all (2+1)-dimensional PDEs depending only on 2nd-order derivatives of unknown which have the Euler-Lagrange form and determine the corresponding Lagrangians. We convert these equations and their Lagrangians to two-component…
In this paper we use the theory of modular forms to find formulas for the number of representations of a positive integer by certain class of quadratic forms in eight variables, viz., forms of the form $a_1x_1^2 + a_2 x_2^2 + a_3 x_3^2 +…
We introduce a generalization of the Euclidean algorithm for rings equipped with an involution, and completely enumerate all isomorphism classes of orders over definite, rational quaternion algebras equipped with an orthogonal involution…