Related papers: Near Quadratic Matrix Multiplication Modulo Compos…

In this paper, we study the number of representations of a positive integer $n$ by two positive integers whose product is a multiple of a polygonal number.

Multiplication is an essential step in a lot of calculations. In this paper we look at multiplication of 2 binary polynomials of degree at most $n-1$, modulo an irreducible polynomial of degree $n$ with $2n$ input and $n$ output qubits,…

This paper deals with circulant matrices. It is shown that a circulant matrix can be multiplied by a vector in time O(n log(n)) in a ring with roots of unity without making use of an FFT algorithm. With our algorithm we achieve a speedup of…

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$.

We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point…

Let $a, b, c,$ and $n$ be integers, with $a$ nonzero and $n$ at least two. Necessary and sufficient conditions on these parameters are derived which guarantee that all solutions of the congruence \[ ax^2+bx+c \equiv 0\ \textrm{mod}\ n \]…

We estimate the number of solutions of certain diagonal congruences involving factorials. We use these results to bound exponential sums with products of two factorials $n!m!$ and also derive asymptotic formulas for the number of solutions…

Matrix multiplication is a fundamental task in almost all computational fields, including machine learning and optimization, computer graphics, signal processing, and graph algorithms (static and dynamic). Twin-width is a natural complexity…

The quest for non-commutative matrix multiplication algorithms in small dimensions has seen a lot of recent improvements recently. In particular, the number of scalar multiplications required to multiply two $4\times4$ matrices was first…

We determine explicit formulas for the number of representations of a positive integer $n$ by quaternary quadratic forms with coefficients $1$, $2$, $5$ or $10$. We use a modular forms approach.

Let $p$ be a prime number, $p=2^nq+1$, where $q$ is odd. D. Shanks described an algorithm to compute square roots $\pmod{p}$ which needs $O(\log q + n^2)$ modular multiplications. In this note we describe two modifications of this…

We present a non-commutative algorithm for the multiplication of a 2 x 2 block-matrix by its adjoint, defined by a matrix ring anti-homomorphism. This algorithm uses 5 block products (3 recursive calls and 2 general products)over C or in…

This paper considers the problem of calculating the matrix multiplication of two massive matrices $\mathbf{A}$ and $\mathbf{B}$ distributedly. We provide a modulo technique that can be applied to coded distributed matrix multiplication…

This paper is devoted to octonions that are the eight-dimensional hypercomplex numbers characterized by multiplicative non-associativity. The decomposition of the product of three octonions with the conjugated central factor into the sum of…

Let $p<q$ be odd primes, $\rho_1$ and $\rho_2$ be irreducible representations of $\text{SL}(2,\mathbb{Z}_p)$ and $\text{SL}(2,\mathbb{Z}_q)$ of dimensions $\frac{p+1}{2}$ and $\frac{q+1}{2}$, respectively. We show that if…

A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…

The problem of computing modulo prime-power sums is investigated in distributed source coding as well as computation over Multiple-Access Channel (MAC). We build upon group codes and present a new class of codes called Quasi Group Codes…

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…

We observe structure in the sequences of quotients and remainders of the Euclidean algorithm with two families of inputs. Analyzing the remainders, we obtain new algorithms for computing modular inverses and representating prime numbers by…

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…