Related papers: Asymptotically optimal Boolean functions

Let $f$ be a Rademacher or Steinhaus random multiplicative function. For various arithmetically interesting subsets $\mathcal A\subseteq [1, N]\cap\mathbb N$ such that the distribution of $\sum_{n\in \mathcal A} f(n)$ is approximately…

We show that there are harmonic functions on a ball ${\mathbb{B}_n}$ of $\mathbb{R}^n$, $n\ge 2$, that are continuous up to the boundary (and even H\"older continuous) but not in the Sobolev space $H^s(\mathbb{B}_n)$ for any $s$…

The $n$-dimensional hypercube has $n+1$ distinct eigenvalues $n-2i$, $0\leq i\leq n$, with corresponding eigenspaces $U_i(n)$. In 2021 it was proved by the author that if a function with non-empty support belongs to the direct sum…

Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In…

We study the $L^2$ spectral gap of a large system of strongly coupled diffusions on unbounded state space and subject to a double-well potential. This system can be seen as a spatially discrete approximation of the stochastic Allen-Cahn…

The r-th order nonlinearity of a Boolean function is the minimum number of elements that have to be changed in its truth table to arrive at a Boolean function of degree at most r. It is shown that the (suitably normalised) r-th order…

Non-linearity of a Boolean function indicates how far it is from any linear function. Despite there being several strong results about identifying a linear function and distinguishing one from a sufficiently non-linear function, we found a…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

For a real-valued and essentially bounded arithmetic function $f$, i.e., $f(n)\ll_{\varepsilon}\!n^{\varepsilon},\,\forall\varepsilon\!>\!0$, we \enspace give some optimal links between non-trivial bounds for the sums $\sum_{h\le…

We develop a special multilinear complex interpolation theorem that allows us to prove an optimal version of the bilinear H\"ormander multiplier theorem concerning symbols that lie in the Sobolev space $L^r_s(\mathbb R^{2n})$, $2\le…

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…

We consider 1-dimensional location estimation, where we estimate a parameter $\lambda$ from $n$ samples $\lambda + \eta_i$, with each $\eta_i$ drawn i.i.d. from a known distribution $f$. For fixed $f$ the maximum-likelihood estimate (MLE)…

The sensitivity of a Boolean function f is the maximum over all inputs x, of the number of sensitive coordinates of x. The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean…

We consider optimization of nonlinear objective functions that balance $d$ linear criteria over $n$-element independence systems presented by linear-optimization oracles. For $d=1$, we have previously shown that an $r$-best approximate…

The $\epsilon$-approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within $\epsilon$ in the $\ell_\infty$ norm. We prove several lower bounds on this…

We study codes with parameters of $q$-ary shortened Hamming codes, i.e., $(n=(q^m-q)/(q-1), q^{n-m}, 3)_q$. Firstly, we prove the fact mentioned in 1998 by Brouwer et al. that such codes are optimal, generalizing it to a bound for multifold…

Consider the family of all perfect matchings of the complete graph $K_{2n}$ with $2n$ vertices. Given any collection $\mathcal M$ of perfect matchings of size $s$, there exists a maximum number $f(n,x)$ such that if $s\leq f(n,x)$, then…

We consider the problem of finding $A_2(n,\{d_1,d_2\})$ defined as the maximal size of a binary (non-linear) code of length $n$ with two distances $d_1$ and $d_2$. Binary codes with distances $d$ and $d+2$ of size…

We study the problem of approximating and learning coverage functions. A function $c: 2^{[n]} \rightarrow \mathbf{R}^{+}$ is a coverage function, if there exists a universe $U$ with non-negative weights $w(u)$ for each $u \in U$ and subsets…

Threshold phenomena are investigated using a general approach, following Talagrand [Ann. Probab. 22 (1994) 1576--1587] and Friedgut and Kalai [Proc. Amer. Math. Soc. 12 (1999) 1017--1054]. The general upper bound for the threshold width of…