Related papers: On The Effective Construction of Asymmetric Chudno…
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 study the symmetric tensor rank of multiplication over finite field extensions using linearized polynomials. Via field trace, symmetric linearized polynomials are identified with symmetric bilinear forms and symmetric matrices, allowing…
Chebyshev interpolation polynomials exhibit the exponential approximation property to analytic functions on a cube. Based on the Chebyshev interpolation polynomial approximation, we propose iterative polynomial approximation algorithms to…
In a recent paper we have suggested that the finite temperature density matrix can be computed efficiently by a combination of polynomial expansion and iterative inversion techniques. We present here significant improvements over this…
This paper explores variants of the subspace iteration algorithm for computing approximate invariant subspaces. The standard subspace iteration approach is revisited and new variants that exploit gradient-type techniques combined with a…
In current textbooks the use of Chebyshev nodes with Newton interpolation is advocated as the most efficient numerical interpolation method in terms of approximation accuracy and computational effort. However, we show numerically that the…
Chebyshev interpolation is a highly effective, intensively studied method and enjoys excellent numerical properties. The interpolation nodes are known beforehand, implementation is straightforward and the method is numerically stable. For…
We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…
We prove a Polya-Vinogradov type variation of the the Chebotarev density theorem for function fields over finite fields valid for "incomplete intervals" $I \subset \mathbb{F}_p$, provided $(p^{1/2}\log p)/|I| = o(1)$. Applications include…
We present a novel technique for work-efficient parallel derandomization, for algorithms that rely on the concentration of measure bounds such as Chernoff, Hoeffding, and Bernstein inequalities. Our method increases the algorithm's…
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some of the output variables are also input variables, linked by a linear dependency. Fundamental examples…
The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set $P$ in a Cartesian square $\mathbb{F}_p^n\times\mathbb{F}_p^n$. More precisely, we perform horizontal and vertical sums…
Previous works show convergence of rational Chebyshev approximants to the Pad\'e approximant as the underlying domain of approximation shrinks to the origin. In the present work, the asymptotic error and interpolation properties of rational…
A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…
We set new speed records for multiplying long polynomials over finite fields of characteristic two. Our multiplication algorithm is based on an additive FFT (Fast Fourier Transform) by Lin, Chung, and Huang in 2014 comparing to previously…
We improve an $L^2\times L^2\to L^2$ estimate for a certain bilinear operator in the finite field of size $p$, where $p$ is a prime sufficiently large. Our method carefully picks the variables to apply the Cauchy-Schwarz inequality. As a…
For a function that is analytic on and around an interval, Chebyshev polynomial interpolation provides spectral convergence. However, if the function has a singularity close to the interval, the rate of convergence is near one. In these…
We present new convergence estimates of generalized empirical interpolation methods in terms of the entropy numbers of the parametrized function class. Our analysis is transparent and leads to sharper convergence rates than the classical…
Finite field multiplier is mainly used in error-correcting codes and signal processing. Finite field multiplier is regarded as the bottleneck arithmetic unit for such applications and it is the most complicated operation over finite field…
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,…