Related papers: Optimal Testing of Reed-Muller Codes

We give a unateness tester for functions of the form $f:[n]^d\rightarrow R$, where $n,d\in \mathbb{N}$ and $R\subseteq \mathbb{R}$ with query complexity $O(\frac{d\log (\max(d,n))}{\epsilon})$. Previously known unateness testers work only…

We establish a correspondence between inverse sumset theorems (which can be viewed as classifications of approximate (abelian) groups) and inverse theorems for the Gowers norms (which can be viewed as classifications of approximate…

We study finite-sample inference for the trade-off function of two unknown probability distributions, the function that traces the optimal type I/type II error frontier in binary testing. Given samples from distributions $P$ and $Q$, we…

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

We study the probabilistic degree over reals of the OR function on $n$ variables. For an error parameter $\epsilon$ in (0,1/3), the $\epsilon$-error probabilistic degree of any Boolean function $f$ over reals is the smallest non-negative…

The objective of this manuscript is to study directly the Favard type theorem associated with the three term recurrence formula % \[ R_{n+1}(z) = \big[(1+ic_{n+1})z+(1-ic_{n+1})\big] R_{n}(z) - 4 d_{n+1} z R_{n-1}(z), \quad n \geq 1, \] %…

Let $G$ be the interior domain of a piecewise analytic Jordan curve without cusps. Let $\{p_n\}_{n=0}^\infty$ be the sequence of polynomials that are orthonormal over $G$ with respect to the area measure, with each $p_n$ having leading…

Despite their many appealing properties, kernel methods are heavily affected by the curse of dimensionality. For instance, in the case of inner product kernels in $\mathbb{R}^d$, the Reproducing Kernel Hilbert Space (RKHS) norm is often…

For $\alpha\ge 0$, let $\mathcal{W}(\alpha)$ be the class of all analytic functions in the unit disk $\mathbb{D}$ with normalization $f(0) = 0 $ and $ f'(0) = 1 $ that satisfy the relation $Re\,\{f'(z) + \alpha z f''(z)\} > 0$. This article…

A function $f\colon \{-1,1\}^n \to \{-1,1\}$ is a $k$-junta if it depends on at most $k$ of its variables. We consider the problem of tolerant testing of $k$-juntas, where the testing algorithm must accept any function that is…

We consider an unknown response function $f$ defined on $\Delta=[0,1]^d$, $1\le d\le\infty$, taken at $n$ random uniform design points and observed with Gaussian noise of known variance. Given a positive sequence $r_n\to 0$ as $n\to\infty$…

The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…

Call a function f : F_2^n -> {0,1} odd-cycle-free if there are no x_1, ..., x_k in F_2^n with k an odd integer such that f(x_1) = ... = f(x_k) = 1 and x_1 + ... + x_k = 0. We show that one can distinguish odd-cycle-free functions from those…

Using the recent proof of the polynomial Freiman-Ruzsa conjecture over $\mathbb{F}_p^n$ by Gowers, Green, Manners, and Tao, we prove a version of the polynomial Freiman-Ruzsa conjecture over function fields. In particular, we prove that if…

We study the problem of agnostic learning under the Gaussian distribution. We develop a method for finding hard families of examples for a wide class of problems by using LP duality. For Boolean-valued concept classes, we show that the…

This paper studies estimation of and inference on a distribution function $F$ that is concave on the nonnegative half line and admits a density function $f$ with potentially unbounded support. When $F$ is strictly concave, we show that the…

The best uniform polynomial approximation of the checkmark function $f(x)=|x-\alpha |$ is considered, as $\alpha$ varies in $(-1,1)$. For each fixed degree $n$, the minimax error $E_n (\alpha)$ is shown to be piecewise analytic in $\alpha$.…

Traditional hypothesis tests for differences between binomial proportions are at risk of being too liberal (Wald test) or overly conservative (Fisher's exact test). This problem is exacerbated in small samples. Regulators favour exact…

We consider random polynomials of the form $G_n(z):= \sum_{|\alpha|\leq n} \xi^{(n)}_{\alpha}p_{n,\alpha}(z)$ where $\{\xi^{(n)}_{\alpha}\}_{|\alpha|\leq n}$ are i.i.d. (complex) random variables and $\{p_{n,\alpha}\}_{|\alpha|\leq n}$ form…

We present a new approach to showing that random graphs are nearly optimal expanders. This approach is based on recent deep results in combinatorial group theory. It applies to both regular and irregular random graphs. Let G be a random…