English
Related papers

Related papers: On the maximal L1 influence of real-valued boolean…

200 papers

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

Suppose that there are n bins, and balls arrive in a Poisson process at rate \lambda n, where \lambda >0 is a constant. Upon arrival, each ball chooses a fixed number d of random bins, and is placed into one with least load. Balls have…

Probability · Mathematics 2007-05-23 Malwina J. Luczak , Colin McDiarmid

Algebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an $n$-variable…

Cryptography and Security · Computer Science 2007-05-23 Na Li , Wen-Feng Qi

Given a continuous real-valued function on [0, 1], and a closed subset E \subset [0, 1] we denote by f E the restriction of f to E, that is, the function defined only on E that takes the same values as f at every point of E >. The…

Classical Analysis and ODEs · Mathematics 2007-11-29 Jean-Pierre Kahane , Yitzhak Katznelson

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…

Discrete Mathematics · Computer Science 2013-11-13 Tom Gur , Omer Tamuz

An $n$-bit boolean function is resilient to coalitions of size $q$ if any fixed set of $q$ bits is unlikely to influence the function when the other $n-q$ bits are chosen uniformly. We give explicit constructions of depth-$3$ circuits that…

Computational Complexity · Computer Science 2024-07-01 Peter Ivanov , Emanuele Viola

We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…

Probability · Mathematics 2011-10-28 Miguel Abadi , Rodrigo Lambert

We study the arithmetic (real) function f=g*1, with g "essentially bounded" and supported over the integers of [1,Q]. In particular, we obtain non-trivial bounds, through f "correlations", for the "Selberg integral" and the "symmetry…

Number Theory · Mathematics 2011-08-25 Giovanni Coppola

Let 1\leq p<2 and let L_p=L_p[0,1] be the classical L_p-space of all (classes of) p-integrable functions on [0,1]. It is known that a sequence of independent copies of a mean zero random variable f from L_p spans in L_p a subspace…

Functional Analysis · Mathematics 2014-06-20 S. Astashkin , F. Sukochev , D. Zanin

In this note, we show that the $L\log L$ hypothesis is the strongest size condition on a homogeneous rough function on the sphere which ensures the weak type $(1,1)$ boundedness of the corresponding singular integral $T_\Omega$, provided…

Classical Analysis and ODEs · Mathematics 2023-07-19 Ankit Bhojak

We propose a representation of boolean bent functions by bent rectangles, that is, by special matrices with restrictions on rows and columns. Using this representation, we exhibit new classes of bent functions, give an algorithm to…

Combinatorics · Mathematics 2007-05-23 Sergey Agievich

We describe several families of efficiently implementable Boolean functions achieving provable trade-offs between resiliency, nonlinearity, and algebraic immunity. In particular, the following statement holds for each of the function…

Cryptography and Security · Computer Science 2026-01-13 Palash Sarkar

Under the assumption that the distribution of a nonnegative random variable $X$ admits a bounded coupling with its size biased version, we prove simple and strong concentration bounds. In particular the upper tail probability is shown to…

Probability · Mathematics 2014-07-15 Richard Arratia , Peter Baxendale

In this note we study the error term R_{n,L}(x) in the generalized circle problem for a ball of volume x and a random lattice L of large dimension n. Our main result is the following functional central limit theorem: Fix an arbitrary…

Number Theory · Mathematics 2016-11-22 Andreas Strömbergsson , Anders Södergren

In this paper, we study the behavior of the bounds of matrix-valued maximal inequality in $\mathbb{R}^n$ for large $n$. The main result of this paper is that the $L_p$-bounds ($p>1$) can be taken to be independent of $n$, which is a…

Functional Analysis · Mathematics 2014-11-06 Guixiang Hong

In this paper, a technique on constructing nonlinear resilient Boolean functions is described. By using several sets of disjoint spectra functions on a small number of variables, an almost optimal resilient function on a large even number…

Information Theory · Computer Science 2009-11-18 WeiGuo Zhang , GuoZhen Xiao

We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…

Computational Complexity · Computer Science 2009-10-21 Ilias Diakonikolas , Rocco A. Servedio

We consider $k$-dimensional central sections of the unit ball of $\ell_p^n$ (denoted $B_p^n$) and we prove that their volume are bounded by the volume of $B_p^n$ whenever $1<p<2$ and $1\le k\le (n-1)/2$ or $k=n-1$. We also consider $0<p<1$…

Functional Analysis · Mathematics 2007-05-23 Jesus Bastero , Fernando Galve , Ana Pena , Miguel Romance

In [GW09a] we conjectured that uniformity of degree $k-1$ is sufficient to control an average over a family of linear forms if and only if the $k$th powers of these linear forms are linearly independent. In this paper we prove this…

Number Theory · Mathematics 2019-06-14 W. T. Gowers , J. Wolf

We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…

Combinatorics · Mathematics 2022-05-17 Sergey Agievich