English
Related papers

Related papers: Asymptotically optimal Boolean functions

200 papers

We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…

Information Theory · Computer Science 2025-02-17 Zijie Chen , Amin Gohari , Chandra Nair

Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity. We prove lower bounds on the second-order, third-order, and higher-order…

Cryptography and Security · Computer Science 2023-09-21 Jinjie Gao , Haibin Kan , Yuan Li , Jiahua Xu , Qichun Wang

We consider the task of recovering a Sobolev function on a connected compact Riemannian manifold $M$ when given a sample on a finite point set. We prove that the quality of the sample is given by the $L_\gamma(M)$-average of the geodesic…

Numerical Analysis · Mathematics 2024-09-23 David Krieg , Mathias Sonnleitner

For integer $n\geqslant 1$ and real $u$, let $\Delta(n,u):=|\{d:d\mid n,\,{\rm e}^u<d\leqslant {\rm e}^{u+1}\}|$. The Erd\H{o}s--Hooley Delta-function is then defined by $\Delta(n):=\max_{u\in{\mathbb R}}\Delta(n,u).$ We improve a recent…

Number Theory · Mathematics 2025-02-14 Régis de la Bretèche , Gérald Tenenbaum

In 1990, Tiet\"av\"ainen showed that if the only information we know about a linear code is its dual distance $d$, then its covering radius $R$ is at most $\frac{n}{2}-(\frac{1}{2}-o(1))\sqrt{dn}$. While Tiet\"av\"ainen's bound was later…

Information Theory · Computer Science 2017-07-04 Louay Bazzi

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

We introduce a new arithmetic function $a(n)$ defined to be the number of random multiplications by residues modulo $n$ before the running product is congruent to 0 modulo $n$. We give several formulas for computing the values of this…

Number Theory · Mathematics 2017-05-17 Nathan McNew

Let $\mathcal{N}\mathcal{F}$ be the class of smooth non-flat curves near the origin and near infinity previously introduced by the second author and let $\gamma\in\mathcal{N}\mathcal{F}$. We show - via a unifying approach relative to the…

Classical Analysis and ODEs · Mathematics 2020-06-08 Alejandra Gaitan , Victor Lie

The number of $n$-ary bent functions is less than $2^{3\cdot2^{n-3}(1+o(1))}$ as $n$ is even and $n\rightarrow\infty$. Keywords: Boolean function, bent function, upper bound

Information Theory · Computer Science 2023-03-30 Vladimir N. Potapov

How many strict local maxima can a real quadratic function on $\{0,1\}^n$ have? Holzman conjectured a maximum of $n \choose \lfloor n/2 \rfloor$. The aim of this paper is to prove this conjecture. Our approach is via a generalization of…

Combinatorics · Mathematics 2019-02-20 Hunter Spink

For integer $n\geqslant 1$ and real $u$, let $\Delta(n,u):=|\{d:d\mid n,\,{\rm e}^u<d\leqslant {\rm e}^{u+1}\}|$. The Erd\H{o}s--Hooley Delta-function is then defined by $\Delta(n):=\max_{u\in{\mathbb R}}\Delta(n,u).$ We improve the current…

Number Theory · Mathematics 2022-10-26 Régis de la Bretèche , Gérald Tenenbaum

It is proved an amplification of Cusick-Cheon's conjecture on balanced Boolean functions in the cosets of the binary Reed-Muller code RM(k,m) of order k and length 2^m, in the cases where k = 1 or k >= (m-1)/2.

Information Theory · Computer Science 2008-04-14 Yuri L. Borissov

We call a metric space $s$-negligible iff its $s$-dimensional Hausdorff measure vanishes. We show that every countably $m$-rectifiable subset of $\mathbb{R}^{2n}$ can be displaced from every $(2n-m)$-negligible subset by a Hamiltonian…

Symplectic Geometry · Mathematics 2024-09-09 Yann Guggisberg , Fabian Ziltener

A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…

Probability · Mathematics 2019-07-25 Pierre Baldi , Roman Vershynin

It is a well-known fact that Riemann Hypothesis will follows if the function identically equal to -1 can be arbitrarily approximated in the norm $\norma{.}$ of $L^{2}([0,1],dx)$ by functions of the form $f(x)=\sum_{k=1}^{n}a_{k}…

Number Theory · Mathematics 2007-05-23 F. Auil

We establish a lower bound for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of $n$ variables - a set containing a Boolean formula to represent each…

Computational Complexity · Computer Science 2014-06-24 Samuel C. Hsieh

We prove a lower bound of $\Omega(n^{1/2 - c})$, for all $c>0$, on the query complexity of (two-sided error) non-adaptive algorithms for testing whether an $n$-variable Boolean function is monotone versus constant-far from monotone. This…

Computational Complexity · Computer Science 2014-12-19 Xi Chen , Anindya De , Rocco A. Servedio , Li-Yang Tan

In this paper, we address the random sampling problem for the class of Mellin band-limited functions BT which is concentrated on a bounded cube. It is established that any function in BT can be approximated by an element in a…

Functional Analysis · Mathematics 2023-05-25 Shivam Bajpeyi , Dhiraj Patel , S. Sivananthan

It is known that the order of correlation immunity of a nonconstant unbalanced Boolean function in $n$ variables cannot exceed $2n/3-1$; moreover, it is $2n/3-1$ if and only if the function corresponds to an equitable $2$-partition of the…

Combinatorics · Mathematics 2023-04-11 Denis S. Krotov , Konstantin V. Vorob'ev

Let $\{X_{k,i};i\geq 1,k\geq 1\}$ be an array of i.i.d. random variables and let $\{p_n;n\geq 1\}$ be a sequence of positive integers such that $n/p_n$ is bounded away from 0 and $\infty$. For $W_n=\max_{1\leq i<j\leq…

Probability · Mathematics 2007-05-23 Deli Li , Andrew Rosalsky
‹ Prev 1 3 4 5 6 7 10 Next ›