Related papers: On the RLWE/PLWE equivalence for cyclotomic number…

Learning with Errors is one of the fundamental problems in computational learning theory and has in the last years become the cornerstone of post-quantum cryptography. In this work, we study the quantum sample complexity of Learning with…

We prove upper and lower bounds for the spectral condition number of rectangular Vandermonde matrices with nodes on the complex unit circle. The nodes are "off the grid", pairs of nodes nearly collide, and the studied condition number grows…

We present several approaches on finding necessary and sufficient conditions on $n$ so that $\Phi_k(x^n)$ is irreducible where $\Phi_k$ is the $k$-th cyclotomic polynomial.

Consider the Laguerre polynomials and deform them by the introduction in the measure of an exponential singularity at zero. In [Chen Y., Its A., J. Approx. Theory 162 (2010), 270-297, arXiv:0808.3590] the authors proved that this…

Given two linear codes, the Linear Equivalence Problem (LEP) asks to find (if it exists) a linear isometry between them; as a special case, we have the Permutation Equivalence Problem (PEP), in which isometries must be permutations. LEP and…

The paper introduces the simultaneous partial-inverse problem (SPI) for polynomials and develops its application to decoding interleaved Reed--Solomon codes beyond half the minimum distance. While closely related both to standard key…

Borwein and Choi conjectured that a polynomial $P(x)$ with coefficients $\pm1$ of degree $N-1$ is cyclotomic iff $$P(x)=\pm \Phi_{p_1}(\pm x)\Phi_{p_2}(\pm x^{p_1})\cdots \Phi_{p_r}(\pm x^{p_1p_2\cdots p_{r-1}})$$ where $N=p_1p_2\cdots…

This article is devoted to rational equivalence for non-commutative polynomial algebras in a context including both the classical Gelfand-Kirillov problem and its quantum version. We introduce in this ``mixed'' context some reference…

We study skew polycyclic codes over a finite field $\mathbb{F}_q$, associated with a skew polynomial $f(x) \in \mathbb{F}_q[x;\sigma]$, where $\sigma$ is an automorphism of $\mathbb{F}_q$. We start by proving the Roos-like bound for both…

We demonstrate counterexamples to Wilmshurst's conjecture on the valence of harmonic polynomials in the plane, and we conjecture a bound that is linear in the analytic degree for each fixed anti-analytic degree. Then we initiate a…

Let $E$ be an elliptic curve with positive rank over a number field $K$ and let $p$ be an odd prime number. Let $K_{cyc}$ be the cyclotomic $\mathbb{Z}_p$-extension of $K$ and $K_n$ denote its $n$-th layer. The Mordell--Weil rank of $E$ is…

It is shown that a class of optical physical unclonable functions (PUFs) can be learned to arbitrary precision with arbitrarily high probability, even in the presence of noise, given access to polynomially many challenge-response pairs and…

The problem of minimizing the number of bidirectional SONET rings required to support a given traffic demand has been studied by several researchers. Here we study the related ``ring grooming problem'' of minimizing the number of add/drop…

Polynomial identity testing and arithmetic circuit lower bounds are two central questions in algebraic complexity theory. It is an intriguing fact that these questions are actually related. One of the authors of the present paper has…

Polynomial inequality proving is fundamental to many mathematical disciplines and finds wide applications in diverse fields. Current traditional algebraic methods are based on searching for a polynomial positive definite representation over…

In this paper we present two reductions between variants of the Code Equivalence problem. We give polynomial-time Karp reductions from Permutation Code Equivalence (PCE) to both Linear Code Equivalence (LCE) and Signed Permutation Code…

We present a more general proof that cyclotomic polynomials are irreducible over Q and other number fields that meet certain conditions. The proof provides a new perspective that ties together well-known results, as well as some new…

We show a simple reduction which demonstrates the cryptographic hardness of learning a single periodic neuron over isotropic Gaussian distributions in the presence of noise. More precisely, our reduction shows that any polynomial-time…

We establish non-asymptotic lower bounds for the estimation of principal subspaces. As applications, we obtain new results for the excess risk of principal component analysis and the matrix denoising problem.

Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an…