English
Related papers

Related papers: On the Analysis of Boolean Functions and Fourier-E…

200 papers

Consider any Dirichlet series sum a_n/n^z with nonnegative coefficients a_n and finite sum function f(z)=f(x+iy) when x is greater than 1. Denoting the partial sum a_1+...+a_N by s_N, the paper gives the following necessary and sufficient…

Number Theory · Mathematics 2008-07-04 Jacob Korevaar

We obtain reasonably tight upper and lower bounds on the sum $\sum_{n \leqslant x} \varphi \left( \left\lfloor{x/n}\right\rfloor\right)$, involving the Euler functions $\varphi$ and the integer parts $\left\lfloor{x/n}\right\rfloor$ of the…

Number Theory · Mathematics 2018-10-17 Olivier Bordellès , Lixia Dai , Randell Heyman , Hao Pan , Igor E. Shparlinski

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

Computational Complexity · Computer Science 2018-01-16 Alexander A. Sherstov

This paper considers the Fourier transform over the slice of the Boolean hypercube. We prove a relationship between the Fourier coefficients of a function over the slice, and the Fourier coefficients of its restrictions. As an application,…

Combinatorics · Mathematics 2021-11-08 Shravas Rao

The Courtade-Kumar conjecture posits that dictatorship functions maximize the mutual information between the function's output and a noisy version of its input over the Boolean hypercube. We present two significant advancements related to…

Information Theory · Computer Science 2026-01-15 Adel Javanmard , David P. Woodruff

Consider a monotone Boolean function $f:\{0,1\}^n\to\{0,1\}$ and the canonical monotone coupling $\{\eta_p:p\in[0,1]\}$ of an element in $\{0,1\}^n$ chosen according to product measure with intensity $p\in[0,1]$. The random point…

Probability · Mathematics 2018-10-08 Daniel Ahlberg , Jeffrey E. Steif , Gábor Pete

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The asymptotic formula for the new finite sum over the primes $ \sum_{p\leq…

General Mathematics · Mathematics 2021-07-02 N. A. Carella

In this paper, we establish a new inequality tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We…

Information Theory · Computer Science 2017-02-07 Farhad Shirani , S. Sandeep Pradhan

The Riemann-Lebesque Theorem is commonly proved in a few strokes using the theory of Lebesque integration. Here, the upper bound $2\pi|c_k(f)|\le S_k(f)-s_k(f)$ for the Fourier coefficients $c_k$ is proved in terms of majoring and minoring…

funct-an · Mathematics 2008-02-03 Maurice H. P. M. van Putten

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

Number Theory · Mathematics 2021-01-01 Adam J. Harper

This paper considers the problem of approximating a Boolean function $f$ using another Boolean function from a specified class. Two classes of approximating functions are considered: $k$-juntas, and linear Boolean functions. The $n$ input…

Information Theory · Computer Science 2019-07-09 Mohsen Heidari , S. Sandeep Pradhan , Ramji Venkataramanan

For a (possibly partial) Boolean function $f\colon\{0,1\}^n\to\{0,1\}$ as well as a query complexity measure $M$ which maps Boolean functions to real numbers, define the composition limit of $M$ on $f$ by $M^*(f)=\lim_{k\to\infty}…

Computational Complexity · Computer Science 2026-01-14 Bandar Al-Dhalaan , Shalev Ben-David

Given a Boolean function $f:\{-1,1\}^n\to \{-1,1\}$, the Fourier distribution assigns probability $\widehat{f}(S)^2$ to $S\subseteq [n]$. The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai asks if there exist a universal…

Computational Complexity · Computer Science 2021-09-20 Srinivasan Arunachalam , Sourav Chakraborty , Michal Koucký , Nitin Saurabh , Ronald de Wolf

$\newcommand{\sp}{\mathsf{sparsity}}\newcommand{\s}{\mathsf{s}}\newcommand{\al}{\mathsf{alt}}$ The well-known Sensitivity Conjecture states that for any Boolean function $f$, block sensitivity of $f$ is at most polynomial in sensitivity of…

Computational Complexity · Computer Science 2019-02-12 Krishnamoorthy Dinesh , Jayalal Sarma

In this paper we investigate the properties of the Euler functions. By using the Fourier transform for the Euler function, we derive the interesting formula related to the infinite series. Finally we give some interesting identities between…

Number Theory · Mathematics 2008-08-14 Taekyun Kim

Let X be a complex projective manifold and f a dominating rational map from X onto X. We show that the topological entropy h(f) of f is bounded from above by the logarithm of its maximal dynamical degree.

Dynamical Systems · Mathematics 2007-05-23 T. C. Dinh , N. Sibony

We investigate the randomized decision tree complexity of a specific class of read-once threshold functions. A read-once threshold formula can be defined by a rooted tree, every internal node of which is labeled by a threshold function…

Computational Complexity · Computer Science 2023-10-19 Nikos Leonardos

We introduce new classes of informational functionals, called \emph{upper moments}, respectively \emph{down-Fisher measures}, obtained by applying classical functionals such as $p$-moments and the Fisher information to the recently…

Mathematical Physics · Physics 2025-05-28 Razvan Gabriel Iagar , David Puertas-Centeno

New sufficient conditions for representation of a function via the absolutely convergent Fourier integral are obtained in the paper. In the main result, Theorem 1.1, this is controlled by the behavior near infinity of both the function and…

Classical Analysis and ODEs · Mathematics 2009-06-01 E. Liflyand , R. Trigub

It is well known that the entropy $H(X)$ of a discrete random variable $X$ is always greater than or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tight…

Information Theory · Computer Science 2017-12-22 Ferdinando Cicalese , Luisa Gargano , Ugo Vaccaro
‹ Prev 1 3 4 5 6 7 10 Next ›