English
Related papers

Related papers: Fourier Entropy-Influence Conjecture for Random Li…

200 papers

This paper studies two classical inequalities, namely the Hausdorff-Young inequality and equal-exponent Young's convolution inequality, for discrete functions supported in the binary cube $\{0,1\}^d\subset\mathbb{Z}^d$. We characterize the…

Classical Analysis and ODEs · Mathematics 2025-07-03 Tonći Crmarić , Vjekoslav Kovač , Shobu Shiraki

We consider the space $A(\mathbb T)$ of all continuous functions $f$ on the circle $\mathbb T$ such that the sequence of Fourier coefficients $\hat{f}=\{\hat{f}(k), ~k \in \mathbb Z\}$ belongs to $l^1(\mathbb Z)$. The norm on $A(\mathbb T)$…

Classical Analysis and ODEs · Mathematics 2012-06-28 Vladimir Lebedev

Let $f$ be a real-valued, degree-$d$ Boolean function defined on the $n$-dimensional Boolean cube $\{\pm 1\}^{n}$, and $f(x) = \sum_{S \subset \{1,\ldots,d\}} \widehat{f}(S) \prod_{k \in S} x_k$ its Fourier-Walsh expansion. The main result…

Functional Analysis · Mathematics 2017-06-13 Andreas Defant , Mieczysław Mastyło , Antonio Pérez

We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…

Combinatorics · Mathematics 2015-09-28 Antoine Genitrini , Bernhard Gittenberger , Veronika Kraus , Cécile Mailler

We introduce a simply stated conjecture regarding the maximum mutual information a Boolean function can reveal about noisy inputs. Specifically, let $X^n$ be i.i.d. Bernoulli(1/2), and let $Y^n$ be the result of passing $X^n$ through a…

Information Theory · Computer Science 2013-07-16 Gowtham R. Kumar , Thomas A. Courtade

The classical Density Functional Theory (DFT) is introduced as an application of entropic inference for inhomogeneous fluids at thermal equilibrium. It is shown that entropic inference reproduces the variational principle of DFT when…

Statistical Mechanics · Physics 2021-09-14 Ahmad Yousefi , Ariel Caticha

We study two conjectures posed in the analysis of Boolean functions $f : \{-1, 1\}^n \to \{-1, 1\}$, in both of which, the Majority function plays a central role: the "Majority is Least Stable" (Benjamini et al., 1999) and the…

Computational Complexity · Computer Science 2026-04-09 Pritish Kamath , Ravi Kumar , Pasin Manurangsi

There is a class of physical filtration processes where the input is adequately modeled by a continuous periodic function f (x) of bounded variation over its period, and the output depends only on certain harmonics of the Fourier expansion…

General Mathematics · Mathematics 2024-12-17 Vladimir Sluchak

In this note we consider Boolean functions defined on the discrete cube equipped with a biased product probability measure. We prove that if the spectrum of such a function is concentrated on the first two Fourier levels, then the function…

Combinatorics · Mathematics 2013-11-14 Piotr Nayar

Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem. All lower bounds so far have made strong restrictions on the computational model.…

Computational Complexity · Computer Science 2013-05-22 Nir Ailon

Shearer's inequality bounds the sum of joint entropies of random variables in terms of the total joint entropy. We give another lower bound for the same sum in terms of the individual entropies when the variables are functions of…

Probability · Mathematics 2021-03-23 Endre Csóka , Viktor Harangi , Bálint Virág

A formulation of the density functional theory is constructed on the foundations of entropic inference. The theory is introduced as an application of maximum entropy for inhomogeneous fluids in thermal equilibrium. It is shown that entropic…

Statistical Mechanics · Physics 2023-12-29 Ahmad Yousefi , Ariel Caticha

The probability density function of the random flight with isotropic initial conditions is obtained by an expansion in the number of collisions and the in the spatial harmonics of the solution, as in a Fourier series. The method holds for…

Mathematical Physics · Physics 2024-06-11 Ricardo García-Pelayo

The main purpose of this paper is to provide threshold functions for the events that a random subset of the points of a finite vector space has certain properties related to point-flat incidences. Specifically, we consider the events that…

Combinatorics · Mathematics 2022-12-26 Jeong Han Kim , Ben Lund , Thang Pham , Semin Yoo

Boolean functions on the space $F_{2}^m$ are not only important in the theory of error-correcting codes, but also in cryptography, where they occur in private key systems. In these two cases, the nonlinearity of these function is a main…

Number Theory · Mathematics 2015-06-26 Francois Rodier

Motivated by the problem of determining the values of $\alpha>0$ for which $f_\alpha(x)=e^\alpha - (1+1/x)^{\alpha x},\ x>0$ is a completely monotonic function, we combine Fourier analysis with complex analysis to find a family…

Classical Analysis and ODEs · Mathematics 2021-01-19 Christian Berg , Eugenio Massa , Ana P. Peron

We consider, over both the integers and finite fields, Szemer\'{e}di's theorem on $k$-term arithmetic progressions where the set $S$ of allowed common differences in those progressions is restricted and random. Fleshing out a line of…

Number Theory · Mathematics 2019-11-01 Daniel Altman

In this paper we prove pointwise and distributional Fourier transform inversion theorems for functions on the real line that are locally of bounded variation, while in a neighbourhood of infinity are Lebesgue integrable or have polynomial…

Classical Analysis and ODEs · Mathematics 2022-03-29 Erik Talvila

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

Computational Complexity · Computer Science 2009-11-29 Ido Ben-Eliezer , Shachar Lovett , Ariel Yadin

We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. Using a decomposition theorem and a…

Combinatorics · Mathematics 2013-08-20 Hamed Hatami , Pooya Hatami , James Hirst