Related papers: Tight Chang's-lemma-type bounds for Boolean functi…
We aim at providing a foundation of a theory of "good" SAT representations F of boolean functions f. We argue that the hierarchy UC_k of unit-refutation complete clause-sets of level k, introduced by the authors, provides the most basic…
We consider two-dimensional Rayleigh-B\'enard convection with Navier-slip and fixed temperature boundary conditions at the two horizontal rough walls described by the height function $h$. We prove rigorous upper bounds on the Nusselt number…
In this paper, we prove almost Schur Lemma on closed smooth metric measure spaces, which implies the results of X. Cheng and De Lellis-Topping whenever the weighted function f is constant.
A classical theorem of Nisan and Szegedy says that a boolean function with degree $d$ as a real polynomial depends on at most $d2^{d-1}$ of its variables. In recent work by Chiarelli, Hatami and Saks, this upper bound was improved to $C…
In this paper, we introduce and develop the notion of spanning of integers along functions $f:\mathbb{N}\longrightarrow \mathbb{R}$. We apply this method to a class of problems that requires to determine if the equations of the form…
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…
Submodular and fractionally subadditive (or equivalently XOS) functions play a fundamental role in combinatorial optimization, algorithmic game theory and machine learning. Motivated by learnability of these classes of functions from random…
We prove a $k^{-\Omega(\log(\varepsilon_2 - \varepsilon_1))}$ lower bound for adaptively testing whether a Boolean function is $\varepsilon_1$-close to or $\varepsilon_2$-far from $k$-juntas. Our results provide the first superpolynomial…
Let $\chi$ be a non-principal Dirichlet character of modulus $q$ with associated \textit{L}-function $L(s,\chi)$. We prove that $$|L(1,\chi)|\le\left(\frac{1}{2}+O\Big(\frac{\log\log q}{\log q}\Big)\right)\frac{\varphi(q)}{q}\log q\,,$$…
For any large prime $q$, $1 \leq x \leq q$ and any real $0 \leq k \leq 1$, we prove an upper bound for the following $2k$-th moment $$\displaystyle \sum_{\substack{\chi \bmod q}} \Big| \sum_{n\leq x} \chi(n)\lambda(n)\Big|^{2k},$$ where…
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…
The subject of this textbook is the analysis of Boolean functions. Roughly speaking, this refers to studying Boolean functions $f : \{0,1\}^n \to \{0,1\}$ via their Fourier expansion and other analytic means. Boolean functions are perhaps…
We show that every algorithm for testing $n$-variate Boolean functions for monotonicity must have query complexity $\tilde{\Omega}(n^{1/4})$. All previous lower bounds for this problem were designed for non-adaptive algorithms and, as a…
We establish upper bounds for shifted moments of modular $L$-functions to a fixed modulus as well as quadratic twists of modular $L$-functions under the generalized Riemann hypothesis. Our results are then used to establish bounds for…
We establish nearly tight bounds on the expected shrinkage of decision lists and DNF formulas under the $p$-random restriction $\mathbf R_p$ for all values of $p \in [0,1]$. For a function $f$ with domain $\{0,1\}^n$, let $\mathrm{DL}(f)$…
As for the Fourier transforms of positive and integrable functions supported in the unit interval, we make a list of improvements for P\'olya's results on the distribution of their positive zeros and give new sufficient conditions under…
Solutions to many important partial differential equations satisfy bounds constraints, but approximations computed by finite element or finite difference methods typically fail to respect the same conditions. Chang and Nakshatrala enforce…
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.…
In this paper, we broaden Shiu's Brun-Titchmarsh theorem to allow for functions that are larger and/or smooth-supported. In particular, let $f$ be a nonnegative multiplicative function. We prove that if there exists a $\beta<1$ such that…
In this paper, we provide explicit upper and lower bounds for the argument of the Riemann zeta-function and its antiderivatives in the critical strip under the assumption of the Riemann hypothesis. This extends the previously known bounds…