Related papers: RLWE and PLWE over cyclotomic fields are not equiv…

Recently, the usage of Contrastive Representation Learning (CRL) as a pre-training technique improves the performance of learning with noisy labels (LNL) methods. However, instead of pre-training, when trivially combining CRL loss with LNL…

In 1971, Ruzsa conjectured that if $f:\ \mathbb{N}\rightarrow\mathbb{Z}$ with $f(n+k)\equiv f(n)$ mod $k$ for every $n,k\in\mathbb{N}$ and $f(n)=O(\theta^n)$ with $\theta<e$ then $f$ is a polynomial. In this paper, we investigate the…

This paper presents a robust alternative to the Maximum Likelihood Estimator (MLE) for the Polytomous Logistic Regression Model (PLRM), known as the family of minimum R\`enyi Pseudodistance (RP) estimators. The proposed minimum RP…

We consider sparse variants of the classical Learning Parities with random Noise (LPN) problem. Our main contribution is a new algorithmic framework that provides learning algorithms against low-noise for both Learning Sparse Parities…

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

We classify all cyclotomic matrices over real quadratic integer rings and we show that this classification is the same as classifying cyclotomic matrices over the compositum all real quadratic integer rings. Moreover, we enumerate a related…

The Learning with Errors problem (LWE) is one of the main candidates for post-quantum cryptography. At Asiacrypt 2017, coded-BKW with sieving, an algorithm combining the Blum-Kalai-Wasserman algorithm (BKW) with lattice sieving techniques,…

We obtain polylogarithmic bounds in the polynomial Szemer\'{e}di theorem when the polynomials have distinct degrees and zero constant terms. Specifically, let $P_1, \dots, P_m \in \mathbb Z[y]$ be polynomials with distinct degrees, each…

We prove the hardness of weakly learning halfspaces in the presence of adversarial noise using polynomial threshold functions (PTFs). In particular, we prove that for any constants $d \in \mathbb{Z}^+$ and $\varepsilon > 0$, it is NP-hard…

We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…

We prove that the graph tautology principles of Alekhnovich, Johannsen, Pitassi and Urquhart have polynomial size pool resolution refutations that use only input lemmas as learned clauses and without degenerate resolution inferences. We…

We study the complexity of PAC learning halfspaces in the presence of Massart noise. In this problem, we are given i.i.d. labeled examples $(\mathbf{x}, y) \in \mathbb{R}^N \times \{ \pm 1\}$, where the distribution of $\mathbf{x}$ is…

For $\zeta$ a transcendental real number, we consider the classical Diophantine exponents $w_{n}(\zeta)$ and $\widehat{w}_{n}(\zeta)$. They measure how small $| P(\zeta)|$ can be for an integer polynomial $P$ of degree at most $n$ and naive…

We study residual polynomials, $R_{x_0,n}^{(\mathfrak{e})}$, $\mathfrak{e}\subset\mathbb{R}$, $x_0\in\mathbb{R}\setminus\mathfrak{e}$, which are the degree at most $n$ polynomials with $R(x_0)=1$ that minimize the $\sup$ norm on…

We study in this article some Sobolev-type inequalities on polynomial volume growth Lie groups. We show in particular that improved Sobolev inequalities can be extended without the use of the Littlewood-Paley decomposition to this general…

We derive semiclassical asymptotics for the orthogonal polynomials P_n(z) on the line with respect to the exponential weight \exp(-NV(z)), where V(z) is a double-well quartic polynomial, in the limit when n, N \to \infty. We assume that…

In this paper, we employ contour integration and residue calculus to derive explicit parity formulas for (cyclotomic) multiple zeta values (MZVs). A key innovation lies in applying double shuffle regularization to the contour integrals,…

Let $\mathbb{R}^m$ be endowed with the Euclidean metric. The covering radius of a lattice $\Lambda \subset \mathbb{R}^m$ is the least distance $r$ such that, given any point of $\mathbb{R}^m$, the distance from that point to $\Lambda$ is…

Let $N$ be a large prime and $P, Q \in \mathbb{Z}[x]$ two linearly independent polynomials with $P(0) = Q(0) = 0$. We show that if a subset $A$ of $\mathbb{Z}/N\mathbb{Z}$ lacks a progression of the form $(x, x + P(y), x + Q(y), x + P(y) +…

In this work, we study the solution of shortest vector problems (SVPs) arising in terms of learning with error problems (LWEs). LWEs are linear systems of equations over a modular ring, where a perturbation vector is added to the right-hand…