English
Related papers

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

200 papers

We construct a $1$-bounded completely multiplicative function $f$ whose logarithmically-averaged partial sums satisfy $$ \limsup_{x \rightarrow \infty} \frac{\left|\sum_{n \leq x} \frac{f(n)}{n}\right|}{1+\exp\left(\sum_{p \leq x}…

Number Theory · Mathematics 2026-05-29 Alexander P. Mangerel

The spectral norm of a Boolean function $f:\{0,1\}^n \to \{-1,1\}$ is the sum of the absolute values of its Fourier coefficients. This quantity provides useful upper and lower bounds on the complexity of a function in areas such as learning…

Computational Complexity · Computer Science 2012-05-25 Anil Ada , Omar Fawzi , Hamed Hatami

We consider the problem of jointly minimizing forms of two Boolean functions $f, g \colon \{0,1\}^J \to \{0,1\}$ such that $f + g \leq 1$ and so as to separate disjoint sets $A \cup B \subseteq \{0,1\}^J$ such that $f(A) = \{1\}$ and $g(B)…

Machine Learning · Computer Science 2022-09-09 David Stein , Bjoern Andres

We present a regularity lemma for Boolean functions $f:\{-1,1\}^n \to \{-1,1\}$ based on noisy influence, a measure of how locally correlated $f$ is with each input bit. We provide an application of the regularity lemma to weaken the…

Computational Complexity · Computer Science 2016-10-25 Chris Jones

A boolean function $f(x_1,...,x_n)$ is \textit{weakly symmetric} if it is invariant under a transitive permutation group on its variables. A boolean function $f(x_1,...,x_n)$ is \textit{elusive} if we have to check all $x_1$,..., $x_n$ to…

Computational Complexity · Computer Science 2017-01-11 Guangmo Tong , Weili Wu , Ding-Zhu Du

In this paper, we prove that most of the boolean functions, $f : \{-1,1\}^n \rightarrow \{-1,1\}$ satisfy the Fourier Entropy Influence (FEI) Conjecture due to Friedgut and Kalai (Proc. AMS'96). The conjecture says that the Entropy of a…

Combinatorics · Mathematics 2011-10-21 Bireswar Das , Manjish Pal , Vijay Visavaliya

This work presents a study of perturbations of symmetric Boolean functions. In particular, it establishes a connection between exponential sums of these perturbations and Diophantine equations of the form $$ \sum_{l=0}^n \binom{n}{l}…

Combinatorics · Mathematics 2018-01-12 Francis N. Castro , Oscar E. González , Luis A. Medina

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…

Computational Complexity · Computer Science 2015-02-05 Chia-Jung Lee , Satya V. Lokam , Shi-Chun Tsai , Ming-Chuan Yang

We prove the Courtade-Kumar conjecture, for certain classes of $n$-dimensional Boolean functions, $\forall n\geq 2$ and for all values of the error probability of the binary symmetric channel, $\forall 0 \leq p \leq \frac{1}{2}$. Let…

Information Theory · Computer Science 2017-02-15 Septimia Sarbu

Recently a functional limit theorem for sums of moving averages with random coefficients and i.i.d. heavy tailed innovations has been obtained under the assumption that all partial sums of the series of coefficients are a.s. bounded between…

Probability · Mathematics 2021-09-27 Danijel Krizmanić

We study functional convergence of sums of moving averages with random coefficients and heavy-tailed innovations. Under some standard moment conditions and the assumption that all partial sums of the series of coefficients are a.s. bounded…

Probability · Mathematics 2018-08-22 Danijel Krizmanić

This paper concerns the approximation by the Boolean sums of Jackson operators $\oplus^rJ_{k,s}(f)$ on the unit sphere $\mathbb S^{n-1}$ of $\mathbb{R}^{n}$. We prove the following the direct and inverse theorem for $\oplus^rJ_{k,s}(f)$:…

Classical Analysis and ODEs · Mathematics 2014-09-16 Yuguang Wang , Feilong Cao

Suppose that $Y^n$ is obtained by observing a uniform Bernoulli random vector $X^n$ through a binary symmetric channel with crossover probability $\alpha$. The "most informative Boolean function" conjecture postulates that the maximal…

Information Theory · Computer Science 2017-05-03 Wasim Huleihel , Or Ordentlich

A sum rule is an identity connecting the entropy of a measure with coefficients involved in the construction of its orthogonal polynomials (Jacobi coefficients). Our paper is an extension of Gamboa, Nagel and Rouault (2016), where we have…

Probability · Mathematics 2020-04-29 Fabrice Gamboa , Jan Nagel , Alain Rouault

We establish several sum-product estimates over finite fields that involve polynomials and rational functions. First, |f(A)+f(A)|+|AA| is substantially larger than |A| for an arbitrary polynomial f over F_p. Second, a characterization is…

Combinatorics · Mathematics 2014-02-26 Boris Bukh , Jacob Tsimerman

We study approximation of Boolean functions by low-degree polynomials over the ring $\mathbb{Z}/2^k\mathbb{Z}$. More precisely, given a Boolean function $F:\{0,1\}^n \rightarrow \{0,1\}$, define its $k$-lift to be $F_k:\{0,1\}^n \rightarrow…

Computational Complexity · Computer Science 2020-05-08 Abhishek Bhrushundi , Prahladh Harsha , Srikanth Srinivasan

For linear processes with independent identically distributed innovations that are regularly varying with tail index $\alpha \in (0, 2)$, we study functional convergence of the joint partial sum and partial maxima processes. We derive a…

Probability · Mathematics 2018-07-20 Danijel Krizmanic

The purpose of this paper is to introduce the notion of a generalized derivation which derivates a prescribed family of smooth vector-valued functions of several variables. The basic calculus rules are established and then a result derived…

Classical Analysis and ODEs · Mathematics 2020-06-22 Richárd Grünwald , Zsolt Páles

We study functions on the infinite-dimensional Hamming cube $\{-1,1\}^\infty$, in particular Boolean functions into $\{-1,1\}$, generalising results on analysis of Boolean functions on $\{-1,1\}^n$ for $n\in\mathbb{N}$. The notion of noise…

Probability · Mathematics 2019-06-11 Vilhelm Agdur

Let $f(n)$ be a multiplicative function satisfying $|f(n)|\leq 1$, $q$ $(\leq N^2)$ be a positive integer and $a$ be an integer with $(a,\,q)=1$. In this paper, we shall prove that $$\sum_{\substack{n\leq N\\ (n,\,q)=1}}f(n)e({a\bar{n}\over…

Number Theory · Mathematics 2014-03-14 Ke Gong , Chaohua Jia