English
Related papers

Related papers: On the Sum of Linear Coefficients of a Boolean Val…

200 papers

Bourgain showed that any noise stable Boolean function $f$ can be well-approximated by a junta. In this note we give an exponential sharpening of the parameters of Bourgain's result under the additional assumption that $f$ is a halfspace.

Computational Complexity · Computer Science 2012-03-01 Ilias Diakonikolas , Ragesh Jaiswal , Rocco A. Servedio , Li-Yang Tan , Andrew Wan

This note is concerned with an extension, at second order, of an inequality on the discrete cube $C_n=\{-1,1\}$ (equipped with the uniform measure) due to Talagrand (\cite{TalL1L2}). As an application, the main result of this note is a…

Probability · Mathematics 2019-10-22 Kevin Tanguy

We make progress on a conjecture of Cilleruelo on the growth of the least common multiple of consecutive values of an irreducible polynomial $f$ on the additional hypothesis that the polynomial be even. This strengthens earlier work of…

Number Theory · Mathematics 2024-01-12 Marc Technau

Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulates that the maximum sensitivity of a Boolean function is…

Computational Complexity · Computer Science 2014-11-14 Andris Ambainis , Mohammad Bavarian , Yihan Gao , Jieming Mao , Xiaoming Sun , Song Zuo

The {\em Total Influence} ({\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \ifnum\plusminus=1 $f: \{\pm1\}^n…

Data Structures and Algorithms · Computer Science 2011-01-28 Dana Ron , Ronitt Rubinfeld , Muli Safra , Omri Weinstein

Recently, for the joint partial sum and partial maxima processes constructed from linear processes with independent identically distributed innovations that are regularly varying with tail index $\alpha \in (0, 2)$, a functional limit…

Probability · Mathematics 2018-03-07 Danijel Krizmanic

The discrete Fourier transform of the greatest common divisor is a multiplicative function that generalises both the gcd-sum function and Euler's totient function. On the one hand it is the Dirichlet convolution of the identity with…

Number Theory · Mathematics 2012-01-17 Peter H. van der Kamp

In earlier papers we have developed an algebraic theory of discrete tomography. In those papers the structure of the functions $f: A \to \{0,1\}$ and $f: A \to \mathbb{Z}$ having given line sums in certain directions have been analyzed.…

Combinatorics · Mathematics 2012-07-18 Lajos Hajdu , Rob Tijdeman

For $m,n\in \mathbb{N}$, let $0 < \alpha_i,\beta_j,\lambda_{ij} \leq 1$ be such that $\sum_{j=1}^n \lambda_{ij} = \alpha_i$, $\sum_{i=1}^m \lambda_{ij} = \beta_j$, and $\sum_{i=1}^m \alpha_i = \sum_{j=1}^n \beta_j \leq 1$. We prove that the…

Classical Analysis and ODEs · Mathematics 2019-11-07 Frédéric Ouimet

Let $\Delta_x f(x,y)=f(x+1,y)-f(x,y)$ and $\Delta_y f(x,y)=f(x,y+1)-f(x,y)$ be the difference operators with respect to $x$ and $y$. A rational function $f(x,y)$ is called summable if there exist rational functions $g(x,y)$ and $h(x,y)$…

Symbolic Computation · Computer Science 2014-08-12 Qing-Hu Hou , Rong-Hua Wang

The goal of this article is to prove the Sum of Squares Conjecture for real polynomials $r(z,\bar{z})$ on $\mathbb{C}^3$ with diagonal coefficient matrix. This conjecture describes the possible values for the rank of $r(z,\bar{z}) \|z\|^2$…

Complex Variables · Mathematics 2021-08-02 Jennifer Brooks , Dusty Grundmeier

We show that a Boolean degree $d$ function on the slice $\binom{[n]}{k}$ is a junta if $k \geq 2d$, and that this bound is sharp. We prove a similar result for $A$-valued degree $d$ functions for arbitrary finite $A$, and for functions on…

Combinatorics · Mathematics 2022-03-15 Yuval Filmus

We exhibit a class of "relatively curved" $\vec{\gamma}(t) := (\gamma_1(t),\dots,\gamma_n(t))$, so that the pertaining multi-linear maximal function satisfies the sharp range of H\"{o}lder exponents, \[ \left\| \sup_{r > 0} \ \frac{1}{r}…

Classical Analysis and ODEs · Mathematics 2020-07-28 Ben Krause

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

Number Theory · Mathematics 2011-08-26 Michael Coons

We extend the classical Lebesgue and Fubini differentiation theorems to functions of several variables, using the notions of joint derivative and joint monotonicity. Our first main result shows that for a function $f$ of bounded variation,…

Functional Analysis · Mathematics 2025-10-21 Xianrui Zhang

A conjecture of Bombieri states that the coefficients of a normalized univalent function $f$ should satisfy $$ \liminf_{f\to K} \frac{n-{\rm Re\,}a_n}{m-{\rm Re\,}a_m} = \min_{t\in{\mathbb R}} \, \frac{n\sin t -\sin(nt)}{m\sin t -\sin(mt)},…

Complex Variables · Mathematics 2017-10-24 Iason Efraimidis

A function from $\Bbb F_{2^n}$ to $\Bbb F_{2^n}$ is said to be {\em $k$th order sum-free} if the sum of its values over each $k$-dimensional $\Bbb F_2$-affine subspace of $\Bbb F_{2^n}$ is nonzero. This notion was recently introduced by C.…

Number Theory · Mathematics 2025-10-17 Alyssa Ebeling , Xiang-dong Hou , Ashley Rydell , Shujun Zhao

Cusick's conjecture on the binary sum of digits $s(n)$ of a nonnegative integer $n$ states the following: for all nonnegative integers $t$ we have \[ c_t=\lim_{N\rightarrow\infty}\frac 1N\left\lvert\{n<N:s(n+t)\geq s(n)\}\right\rvert>1/2.…

Number Theory · Mathematics 2019-04-19 Lukas Spiegelhofer

The spectrum of a complex-valued function $f$ on $\mathbb{Z}_{q}^n$ is the set $\{|u|:u\in \mathbb{Z}_q^n~\mathrm{and}~\widehat{f}(u)\neq 0\}$, where $|u|$ is the Hamming weight of $u$ and $\widehat{f}$ is the Fourier transform of $f$. Let…

Combinatorics · Mathematics 2024-04-17 Alexandr Valyuzhenich

The seminal result of Kahn, Kalai and Linial shows that a coalition of $O(\frac{n}{\log n})$ players can bias the outcome of any Boolean function $\{0,1\}^n \to \{0,1\}$ with respect to the uniform measure. We extend their result to…

Discrete Mathematics · Computer Science 2019-02-21 Yuval Filmus , Lianna Hambardzumyan , Hamed Hatami , Pooya Hatami , David Zuckerman
‹ Prev 1 3 4 5 6 7 10 Next ›