English
Related papers

Related papers: Hypercontractive Inequality for Pseudo-Boolean Fun…

200 papers

We call a smooth function of one variable a degree n pseudopolynomial if its n-th derivative has no (real) zeros. An n pseudopolynomial is called hyperbolic if it has exactly n simple zeros. In this short note we describe the necessary and…

Classical Analysis and ODEs · Mathematics 2007-05-23 B. Shapiro , M. Shapiro

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…

Computational Complexity · Computer Science 2022-11-24 Siddharth Bhandari , Prahladh Harsha , Tulasimohan Molli , Srikanth Srinivasan

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

Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which…

Combinatorics · Mathematics 2017-03-24 Shizuo Kaji , Toshiaki Maeno , Koji Nuida , Yasuhide Numata

Every Boolean function can be uniquely represented as a multilinear polynomial. The entropy and the total influence are two ways to measure the concentration of its Fourier coefficients, namely the monomial coefficients in this…

Computational Complexity · Computer Science 2017-11-03 Rani Hod

A key fact in the theory of Boolean functions $f : \{0,1\}^n \to \{0,1\}$ is that they often undergo sharp thresholds. For example: if the function $f : \{0,1\}^n \to \{0,1\}$ is monotone and symmetric under a transitive action with…

Combinatorics · Mathematics 2010-11-17 Gil Kalai , Elchanan Mossel

Let $0 < \epsilon < 1/2$ be a noise parameter, and let $T_{\epsilon}$ be the noise operator acting on functions on the boolean cube $\{0,1\}^n$. Let $f$ be a nonnegative function on $\{0,1\}^n$. We upper bound the entropy of $T_{\epsilon}…

Information Theory · Computer Science 2016-06-23 Alex Samorodnitsky

Let $f:\{-1,1\}^{n}\rightarrow \{-1,1\}$ be a Boolean valued function having total degree $d$. Then a conjecture due to Servedio and Gopalan asserts that $\sum_{i=1}^{n}\widehat{f}(i)\leq \sum_{j=1}^{d}\widehat{\text{Maj}}_{d}(j)$ where…

Computational Complexity · Computer Science 2016-11-08 Sumit Kumar Jha

Let $I\subseteq{\mathbb{R_+}}$ be a non empty and non singleton interval where ${\mathbb{R_+}}$ denotes the set of all non negative numbers. A function $\Phi: I\to {\mathbb{R_+}}$ is said to be subadditive if for any $x,y$ and $x+y\in I$,…

General Mathematics · Mathematics 2023-08-03 Angshuman R. Goswami

The $2 q$-th pseudomoment $\Psi_{2q,\alpha}(x)$ of the $\alpha$-th power of the Riemann zeta function is defined to be the $2 q$-th moment of the partial sum up to $x$ of $\zeta^\alpha$ on the critical line. Using probabilistic methods of…

Number Theory · Mathematics 2019-09-24 Maxim Gerspach

We show that any sequence of well-behaved (e.g. bounded and non-constant) real-valued functions of $n$ boolean variables $\{f_n\}$ admits a sequence of coordinates whose $L^1$ influence under the $p$-biased distribution, for any…

Discrete Mathematics · Computer Science 2024-06-18 Andrew J. Young , Henry D. Pfister

The logarithmic Sobolev inequality for the Hamming cube {0,1}^n states that for any real-valued function f on the cube holds E(f,f) \ge 2 Ent(f^2), where E(f,f) is the appropriate Dirichlet form (also known as "sum of influences"). We show…

Combinatorics · Mathematics 2008-07-11 Alex Samorodnitsky

In this paper upper bounds are given for the successive differences $A_{n+1}-A_{n}$ and B$_{n}-B_{n-1}$ where $A_{n}=1/(n-1) \tsum_{r=1}^{n-1}f(r/n)$, $B_{n}=1/(n+1) \tsum_{r=0}^{n}f(r/n)$ and $f$ is superquadratic function. We obtain…

Numerical Analysis · Mathematics 2011-10-25 Shoshana Abramovich , Josipa Barić , Marko Matić , Josip Pečarić

Consider a class of functions of one real variable with the following uniqueness property: if a function f(x) from the class vanishes on a set of positive measure, then f is the zero function. In many instances, we would like to have a…

Classical Analysis and ODEs · Mathematics 2007-05-23 F. Nazarov , M. Sodin , A. Volberg

A function $f$ from a domain in $\mathbb{R}^3$ to the quaternions is said to be inframonogenic if $\overline{\partial}\, f\overline{\partial} =0$, where $\overline{\partial} = \partial/\partial x_0+ (\partial/\partial…

Complex Variables · Mathematics 2024-10-08 C. Álvarez , J. Morais , R. Michael Porter

In this paper, we consider Barron functions $f : [0,1]^d \to \mathbb{R}$ of smoothness $\sigma > 0$, which are functions that can be written as \[ f(x) = \int_{\mathbb{R}^d} F(\xi) \, e^{2 \pi i \langle x, \xi \rangle} \, d \xi \quad…

Functional Analysis · Mathematics 2022-08-17 Felix Voigtlaender

A real valued function $f$ defined on a convex $K$ is anemconvex function iff it satisfies $$ f((x+y)/2) \le (f(x)+f(y))/2 + 1. $$ A thorough study of approximately convex functions is made. The principal results are a sharp universal upper…

Metric Geometry · Mathematics 2007-05-23 S. J. Dilworth , Ralph Howard , James W. Roberts

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…

Number Theory · Mathematics 2025-09-26 Thomas Wright

The degree-$d$ Chow parameters of a Boolean function $f: \{-1,1\}^n \to \mathbb{R}$ are its degree at most $d$ Fourier coefficients. It is well-known that degree-$d$ Chow parameters uniquely characterize degree-$d$ polynomial threshold…

Machine Learning · Computer Science 2018-11-09 Ilias Diakonikolas , Daniel M. Kane

For a function $f$ over the discrete cube, the total $L_1$ influence of $f$ is defined as $\sum_{i=1}^n \|\partial_i f\|_1$, where $\partial_i f$ denotes the discrete derivative of $f$ in the direction $i$. In this work, we show that the…

Computational Complexity · Computer Science 2014-04-15 Artūrs Bačkurs , Mohammad Bavarian