English
Related papers

Related papers: Fourier bounds and pseudorandom generators for pro…

200 papers

Consider a system of $m$ polynomial equations $\{p_i(x) = b_i\}_{i \leq m}$ of degree $D\geq 2$ in $n$-dimensional variable $x \in \mathbb{R}^n$ such that each coefficient of every $p_i$ and $b_i$s are chosen at random and independently…

Computational Complexity · Computer Science 2021-10-19 Jun-Ting Hsieh , Pravesh K. Kothari

In this note we consider Boolean functions defined on the discrete cube equipped with a biased product probability measure. We prove that if the spectrum of such a function is concentrated on the first two Fourier levels, then the function…

Combinatorics · Mathematics 2013-11-14 Piotr Nayar

We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \emph{arbitrary} critical density cannot be…

Computational Complexity · Computer Science 2024-07-17 David Gamarnik , Elchanan Mossel , Ilias Zadik

We consider the problem of locating a signal whose frequencies are "off grid" and clustered in a narrow band. Given noisy sample access to a function $g(t)$ with Fourier spectrum in a narrow range $[f_0 - \Delta, f_0 + \Delta]$, how…

Data Structures and Algorithms · Computer Science 2019-05-01 Xue Chen , Eric Price

We study the question of local testability of low (constant) degree functions from a product domain $S_1 \times \dots \times {S}_n$ to a field $\mathbb{F}$, where ${S_i} \subseteq \mathbb{F}$ can be arbitrary constant sized sets. We show…

Computational Complexity · Computer Science 2024-11-12 Prashanth Amireddy , Srikanth Srinivasan , Madhu Sudan

We consider a $G$-function $F(z)=\sum_{k=0}^{\infty} A_k z^k \in \mathbb{K}[[z]]$, where $\mathbb{K}$ is a number field, of radius of convergence $R$ and annihilated by the $G$-operator $L \in \mathbb{K}(z)[\mathrm{d}/\mathrm{d}z]$, and a…

Number Theory · Mathematics 2021-05-18 Gabriel Lepetit

In this paper, we prove the following non-linear generalization of the classical Sylvester-Gallai theorem. Let $\mathbb{K}$ be an algebraically closed field of characteristic $0$, and $\mathcal{F}=\{F_1,\cdots,F_m\} \subset…

Commutative Algebra · Mathematics 2023-10-09 Rafael Oliveira , Akash Kumar Sengupta

We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the…

Computational Complexity · Computer Science 2019-08-08 Aleksandrs Belovs , Eric Blais , Abhinav Bommireddi

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = \{a + b : a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. Sumsets are central objects of study in additive combinatorics, featuring in several influential…

Data Structures and Algorithms · Computer Science 2024-02-06 Xi Chen , Shivam Nadimpalli , Tim Randolph , Rocco A. Servedio , Or Zamir

In this paper we prove a basic theorem which says that if f : F_p^n -> [0,1] has the property that ||f^||_(1/3) is not too ``large''(actually, it also holds for quasinorms 1/2-\delta in place of 1/3), and E(f) = p^{-n} sum_m f(m) is not too…

Number Theory · Mathematics 2007-05-23 Ernie Croot

In this paper we introduce the study of quantum boolean functions, which are unitary operators f whose square is the identity: f^2 = I. We describe several generalisations of well-known results in the theory of boolean functions, including…

Quantum Physics · Physics 2010-12-20 Ashley Montanaro , Tobias J. Osborne

In this paper we prove results regarding Boolean functions with small spectral norm (the spectral norm of f is $\|\hat{f}\|_1=\sum_{\alpha}|\hat{f}(\alpha)|$). Specifically, we prove the following results for functions $f:\{0,1\}^n \to…

Computational Complexity · Computer Science 2013-05-23 Amir Shpilka , Avishay Tal , Ben lee Volk

We study for bounded multiplicative functions $f$ sums of the form \begin{align*} \sum_{\substack{n\leq x \atop n\equiv a\pmod q}}f(n), \end{align*} establishing that their variance over residue classes $a \pmod q$ is small as soon as…

Number Theory · Mathematics 2023-08-24 Oleksiy Klurman , Alexander P. Mangerel , Joni Teräväinen

Given $d,n \in \mathbb{N}$, we write a polynomial $F \in \mathbb{C}[x_1,\dots,x_n]$ to be degenerate if there exist $P\in \mathbb{C}[y_1, \dots, y_{n-1}]$ and $m_j = x_1^{v_{j,1}}\dots x_n^{v_{j,n}}$ with $v_{j,1}, \dots, v_{j,n} \in…

Combinatorics · Mathematics 2023-08-09 Akshat Mudgal

In this work we give an efficient construction of unitary $k$-designs using $\tilde{O}(k\cdot poly(n))$ quantum gates, as well as an efficient construction of a parallel-secure pseudorandom unitary (PRU). Both results are obtained by giving…

Let $\{f_i:\mathbb{F}_p^i \to \{0,1\}\}$ be a sequence of functions, where $p$ is a fixed prime and $\mathbb{F}_p$ is the finite field of order $p$. The limit of the sequence can be syntactically defined using the notion of ultralimit.…

Computational Complexity · Computer Science 2015-03-27 Yuichi Yoshida

We prove the following statement about any Siegel modular form $F$ of degree $n$ and arbitrary odd level $N$ on the group $\Gamma_{0}^{(n)}(N)$. Let $A(F,T)$ denote the Fourier coefficients of $F$ and write $T=(T(i,j))$. Suppose that $F$…

Number Theory · Mathematics 2026-02-10 Pramath Anamby , Soumya Das

We consider functions $f$ of two real variables, given as trigonometric functions over a finite set $F$ of frequencies. This set is assumed to be closed under rotations in the frequency plane of angle $\frac{2k\pi}{M}$ for some integer $M$.…

Numerical Analysis · Mathematics 2016-12-02 Jean-Paul Gauthier , Dario Prandi

We show that there exists a sequence $\{n_k, k\ge 1\}$ growing at least geometrically such that for any finite non-negative measure $\nu$ such that $\hat \nu\ge 0$, any $T>0$, $$ \int_{-2^{n_k} T}^{2^{n_k} T} \hat \nu(x) \dd x \ll_\e…

Functional Analysis · Mathematics 2017-07-20 Michel Weber

We study \emph{unimodular fake} $\mu's$, i.e. multiplicative functions $\mathfrak f: \N \to \mathbb{S}^1 \cup \{0\} $ determined by a fixed sequence $\{\varepsilon_k\}_{k\ge 0} \subset \mathbb{S}^1 \, \cup \, \{0\}$ via the rule $\mathfrak…

Number Theory · Mathematics 2026-01-01 Ali Saraeb