Related papers: New algorithms for modular inversion and represent…
Modular composition is the problem of computing the composition of two univariate polynomials modulo a third one. For a long time, the fastest algebraic algorithm for this problem was that of Brent and Kung (1978). Recently, we improved…
An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…
We decompose a matrix Y into a sum of bilinear terms in a stepwise manner, by considering Y as a mapping from a finite dimensional Banach space into another finite dimensional Banach space. We provide transition formulas, and represent them…
In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of…
We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…
We give a moduli interpretation to the quotient of (nondegenerate) binary cubic forms with respect to the natural $\text{GL}_2$-action on the variables. In particular, we show that these $\text{GL}_2$ orbits are in bijection with pairs of…
Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when applied to (non-)commutative polynomials. The running time of the algorithm is dependent on the size of the coefficients of the remainders.…
We present robust algorithms for set operations and Euclidean transformations of curved shapes in the plane using approximate geometric primitives. We use a refinement algorithm to ensure consistency. Its computational complexity is…
Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations. Using the "Sender-Receiver" model, we propose quantum algorithms for matrix operations such as matrix-vector product,…
Representations of quantum computations are almost always based on a tensor product $\otimes$-structure. This coincides with what we are able to execute in our experiments, as well as what we observe in Nature, but it makes certain familiar…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
Integrable two-dimensional models which possess an integral of motion cubic or quartic in velocities are governed by a single prepotential, which obeys a nonlinear partial differential equation. Taking into account the latter's invariance…
A way to construct and classify the three dimensional polynomially deformed algebras is given and the irreducible representations is presented. for the quadratic algebras 4 different algebras are obtained and for cubic algebras 12 different…
In this paper we generalize the result of Fouvry and Iwaniec dealing with prime values of the quadratic form $x^2 + y^2$ with one input restricted to a thin subset of the integers. We prove the same result with an arbitrary primitive…
We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…
We examine a bias towards the zero residue class for the integers represented by binary quadratic forms. In many cases, we are able to prove that the bias comes from a secondary term in the associated asymptotic expansion (unlike…
We obtain estimates for the number of integral solutions in large balls, of inequalities of the form $|Q(x, y)| < \epsilon$, where $Q$ is an indefinite binary quadratic form, in terms of the Hurwitz continued fraction expansions of the…
Suppose $k$ is a positive integer. In this work, we establish formulas for for the number of representations of integers by the quadratic forms $$ x_{1}^{2}+\cdots+x_{k}^{2}+l\left(x_{k+1}^{2}+\cdots+x_{2k}^{2}\right) $$ for $l\in\{2,4\}$.
In a previous work, we developed the idea to solve Kepler's equation with a CORDIC-like algorithm, which does not require any division, but still multiplications in each iteration. Here we overcome this major shortcoming and solve Kepler's…
Bayesian probabilistic numerical methods are a set of tools providing posterior distributions on the output of numerical methods. The use of these methods is usually motivated by the fact that they can represent our uncertainty due to…