Related papers: Fourier bounds and pseudorandom generators for pro…

Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…

Let $\{q_n^{(\alpha,\beta,m)}(x)\}_{n\ge 0}$ be the orthonormal polynomials respect to the Sobolev-type inner product \begin{equation*} \langle f,g\rangle_{\alpha,\beta,m}=\sum_{k=0}^m \int_{-1}^{1}f^{(k)}(x)g^{(k)}(x)\,…

We obtain a bounded generation theorem over $\mathcal O/\mathfrak a$, where $\mathcal O$ is the ring of integers of a number field and $\mathfrak a$ a general ideal of $\mathcal O$. This addresses a conjecture of Salehi-Golsefidy. Along the…

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

We study generative compressed sensing when the measurement matrix is randomly subsampled from a unitary matrix (with the DFT as an important special case). It was recently shown that $\textit{O}(kdn\| \boldsymbol{\alpha}\|_{\infty}^{2})$…

We improve both upper and lower bounds for the distribution-free testing of monotone conjunctions. Given oracle access to an unknown Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$ and sampling oracle access to an unknown distribution…

Lie algebras provide a useful framework for theoretical analysis in quantum machine learning, particularly in hybrid quantum-classical learning. From the viewpoint of function approximation, expectation values of parameterized quantum…

We prove that any submodular function f: {0,1}^n -> {0,1,...,k} can be represented as a pseudo-Boolean 2k-DNF formula. Pseudo-Boolean DNFs are a natural generalization of DNF representation for functions with integer range. Each term in…

For any positive integer $k$ and nonnegative integer $m$, we consider the symmetric function $G\left( k,m\right)$ defined as the sum of all monomials of degree $m$ that involve only exponents smaller than $k$. We call $G\left( k,m\right)$ a…

We construct a total Boolean function $f$ satisfying $R(f)=\tilde{\Omega}(Q(f)^{5/2})$, refuting the long-standing conjecture that $R(f)=O(Q(f)^2)$ for all total Boolean functions. Assuming a conjecture of Aaronson and Ambainis about…

Motivated by a spectral analysis of the generator of completely positive trace-preserving semigroup, we analyze a real functional $$ A,B \in M_n(\mathbb{C}) \to r(A,B) = \frac{1}{2}\Bigl(\langle [B,A],BA\rangle + \langle [B,A^\ast],BA^\ast…

Let $S_n f$ be the $n$th partial sum of the Fourier series of a function $f$ in $L^1(\D)$, where $\D$ is the ring of integers of a local field $K$. For $1<p<\infty$, we characterize all weight functions $w$ so that the partial sum operators…

Let $(r_k)$ be an increasing sequence and $(w_k)$ a positive sequence. We study the following question: is it true that for every sequence $(a_k)$ satisfying $\sum_{k=0}^\infty |a_k|^2 w_k^2 < \infty$ there exists a function $f\in…

We give improved and almost optimal testers for several classes of Boolean functions on $n$ inputs that have concise representation in the uniform and distribution-free model. Classes, such as $k$-junta, $k$-linear functions, $s$-term DNF,…

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…

We consider iterated function systems (IFS) in ${\mathbb R}^d$ for $d\ge 3$ of the form $\{f_j(x) = \lambda {\mathcal O} x + a_j\}_{j=0}^m$, with $a_0=0$ and $m\ge 1$. Here $\lambda\in (0,1)$ is the contraction ratio and ${\mathcal O}$ is…

We study correlation bounds under pairwise independent distributions for functions with no large Fourier coefficients. Functions in which all Fourier coefficients are bounded by $\delta$ are called $\delta$-{\em uniform}. The search for…

We study the problem of estimating a monotone function $f:\{0,1\}^d\to[0,1]$ from noisy observations at uniformly random vertices of the Boolean hypercube. As a measure of complexity for the target~$f$, we use the total $L^1$-influence…

For a positive integer $N$ divisible by $4,5,6,7$ or $9$, let $\mathcal{O}_{1,N}(\mathbb{Q})$ be the ring of weakly holomorphic modular functions for the congruence subgroup $\Gamma_1(N)$ with rational Fourier coefficients. We present…

We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…