Related papers: Using higher-order Fourier analysis over general f…

We prove that a random linear code over F_q, with probability arbitrarily close to 1, is list decodable at radius (1-1/q-\epsilon) with list size L=O(1/\epsilon^2) and rate R=\Omega_q(\epsilon^2/(log^3(1/\epsilon))). Up to the…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{\"o}nhage and Strassen designed an algorithm that improved the multiplication time for…

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…

This paper presents a method to determine a set of basis polynomials from the extended Euclidean algorithm that allows Generalized Minimum Distance decoding of Reed-Solomon codes with a complexity of O(nd).

We introduce and study the minimum distance function of a graded ideal in a polynomial ring with coefficients in a field, and show that it generalizes the minimum distance of projective Reed-Muller-type codes over finite fields. This gives…

We present a novel randomized algorithm to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo…

Consider $f:\Omega^n_K \to \mathbf{C}$ a function from the $n$-fold product of multiplicative cyclic groups of order $K$. Any such $f$ may be extended via its Fourier expansion to an analytic polynomial on the polytorus $\mathbf{T}^n$, and…

We prove that the pushforwards of a very general class of fractal measures $\mu$ on $\mathbb{R}^d$ under a large family of non-linear maps $F \colon \mathbb{R}^d \to \mathbb{R}$ exhibit polynomial Fourier decay: there exist $C,\eta>0$ such…

In this paper, we study square functions for extension operators over finite-type, planar curves endowed with the Euclidean arclength measure. We prove new results for curves of the form $(T,\phi(T))$ where $\phi(T)$ is a polynomial of…

A 1993 result of Alon and F\"uredi gives a sharp upper bound on the number of zeros of a multivariate polynomial over an integral domain in a finite grid, in terms of the degree of the polynomial. This result was recently generalized to…

For every natural number k we introduce the notion of k-th order convolution of functions on abelian groups. We study the group of convolution preserving automorphisms of function algebras in the limit. It turns out that such groups have…

Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work.…

The aim of this paper is to provide sufficient conditions for when a polynomial or rational function over a field K is prime using its order of vanishing at infinity and the resultant.

Reed-Solomon (RS) codes are constructed over a finite field that have been widely employed in storage and communication systems. Many fast encoding/decoding algorithms such as fast Fourier transform (FFT) and modular approach are designed…

We present a new approximation algorithm for the treewidth problem which finds an upper bound on the treewidth and constructs a corresponding tree decomposition as well. Our algorithm is a faster variation of Reed's classical algorithm. For…

Random Fourier features provide a way to tackle large-scale machine learning problems with kernel methods. Their slow Monte Carlo convergence rate has motivated the research of deterministic Fourier features whose approximation error can…

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

We compute the basic parameters (dimension, length, minimum distance) of affine evaluation codes defined on a cartesian product of finite sets. Given a sequence of positive integers, we construct an evaluation code, over a degenerate torus,…