Related papers: Constant Degree Direct Product Testers with Small …

The approximate degree of a Boolean function $f\colon\{0,1\}^n\to\{0,1\}$ is the minimum degree of a real polynomial $p$ that approximates $f$ pointwise: $|f(x)-p(x)|\leq1/3$ for all $x\in\{0,1\}^n.$ For every $\delta>0,$ we construct CNF…

We study quantum property testing for directed graphs with maximum in-degree and out-degree bounded by some universal constant $d$. For a proximity parameter $\varepsilon$, we show that any property that can be tested with…

Recent works have shown that expansion of pseudorandom sets is of great importance. However, all current works on pseudorandom sets are limited only to product (or approximate product) spaces, where Fourier Analysis methods could be…

We give a "regularity lemma" for degree-d polynomial threshold functions (PTFs) over the Boolean cube {-1,1}^n. This result shows that every degree-d PTF can be decomposed into a constant number of subfunctions such that almost all of the…

Let $f(x) \in \mathbb{Z}[x]$. Set $f_{0}(x) = x$ and, for $n \geq 1$, define $f_{n}(x)$ $=$ $f(f_{n-1}(x))$. We describe several infinite families of polynomials for which the infinite product \prod_{n=0}^{\infty} (1 + \frac{1}{f_{n}(x)})…

Invariance with respect to linear or affine transformations of the domain is arguably the most common symmetry exhibited by natural algebraic properties. In this work, we show that any low complexity affine-invariant property of…

Let $f$ be an analytic polynomial of degree at most $K-1$. A classical inequality of Bernstein compares the supremum norm of $f$ over the unit circle to its supremum norm over the sampling set of the $K$-th roots of unity. Many extensions…

We introduce a high-dimensional cubical complex, for any dimension t>0, and apply it to the design of quantum locally testable codes. Our complex is a natural generalization of the constructions by Panteleev and Kalachev and by Dinur et. al…

We present a construction that produces infinite classes of K\"ahler groups that arise as fundamental groups of fibres of maps to higher dimensional tori. Following the work of Delzant and Gromov, there is great interest in knowing which…

The method of direct computation of universal (fibred) product in the category of commutative associative algebras of finite type with unity over a field is given and proven. The field of coefficients is not supposed to be algebraically…

We address Heath-Brown's and Serre's dimension growth conjecture (proved by Salberger), when the degree $d$ grows. Recall that Salberger's dimension growth results give bounds of the form $O_{X, \varepsilon} (B^{\dim X+\varepsilon})$ for…

We study the stability of covers of simplicial complexes. Given a map $f:Y\to X$ that satisfies almost all of the local conditions of being a cover, is it close to being a genuine cover of $X$? Complexes $X$ for which this holds are called…

In property testing, a tester makes queries to (an oracle for) a graph and, on a graph having or being far from having a property P, it decides with high probability whether the graph satisfies P or not. Often, testers are restricted to a…

A fundamental question in computer science is: Is it harder to solve $n$ instances independently than to solve them simultaneously? This question, known as the direct sum question or direct sum theorem, has been paid much attention in…

This paper explores the connection between classical isoperimetric inequalities, their directed analogues, and monotonicity testing. We study the setting of real-valued functions $f : [0,1]^d \to \mathbb{R}$ on the solid unit cube, where…

Let $p \in (0, \infty)$ be a constant and let $\{\xi_n\} \subset L^p(\Omega, {\mathcal F}, \P)$ be a sequence of random variables. For any integers $m, n \ge 0$, denote $S_{m, n} = \sum_{k=m}^{m + n} \xi_k$. It is proved that, if there…

A simplicial complex $X$ is said to be tight with respect to a field $\mathbb{F}$ if $X$ is connected and, for every induced subcomplex $Y$ of $X$, the linear map $H_\ast (Y; \mathbb{F}) \rightarrow H_\ast (X; \mathbb{F})$ (induced by the…

For $k\ge 1$, the homogeneous symmetric functions $G(k,m)$ of degree $m$ defined by $\sum_{m\ge 0} G(k,m) z^m=\prod_{i\ge 1} \big(1+x_iz+x^2_iz^2+\cdots+x^{k-1}_iz^{k-1}\big)$ are called \emph{Petrie symmetric functions}. As derived by…

We provide a unified method for constructing explicit distributions which are difficult for restricted models of computation to generate. Our constructions are based on a new notion of robust extractors, which are extractors that remain…

We show that if a closed discrete subset $A \subseteq \mathbf{R}^d$ is denser than a certain critical threshold, then $A$ is a Fourier uniqueness set, while if $A$ is sparser, then uniqueness fails and one can prescribe arbitrary values for…