Related papers: On the average sensitivity of laced Boolean functi…
The paper introduces a new estimation method for the standard linear regression model. The procedure is not driven by the optimisation of any objective function rather, it is a simple weighted average of slopes from observation pairs. The…
We obtain upper estimates for the bottom (that is, greatest lower bound) of the essential spectrum of weighted Laplacian operator of a weighted manifold under assumptions of the volume growth of their geodesic balls and spheres.…
We study the Laplace operator on domains subject to Dirichlet or Neumann boundary conditions. We show that these operators admit a bounded $H^{\infty}$-functional calculus on weighted Sobolev spaces, where the weights are powers of the…
We prove that the Fourier dimension of any Boolean function with Fourier sparsity $s$ is at most $O\left(s^{2/3}\right)$. Our proof method yields an improved bound of $\widetilde{O}(\sqrt{s})$ assuming a conjecture of…
We give estimates on the rate of convergence in the Boolean central limit theorem for the L\'evy distance. In the case of measures with bounded support we obtain a sharp estimate by giving a qualitative description of this convergence.
Let $(X,d)$ be a proper ultrametric space. Given a measure $m$ on $X$ and a function $C(B)$ defined on the set of all non-singleton balls $B$ we consider the hierarchical Laplacian $L=L_{C}$. Choosing a sequence $\{\varepsilon (B)\}$ of…
In the setting of the Euclidean space equipped with an arbitrary Radon measure, we prove the equivalence between several notions of function of bounded variation present in the literature. We also study the relation between various…
We consider \L ojasiewicz inequalities for a non-degenerate holomorphic function with an isolated singularity at the origin. We give an explicit estimation of the \L ojasiewicz exponent in a slightly weaker form than the assertion in…
This is a survey of some recent applications of Boolean valued models of set theory to order bounded operators in vector lattices.
This paper is devoted to a weighted version of the one-level density of the non-trivial zeros of $L$-functions, tilted by a power of the $L$-function evaluated at the central point. Assuming the Riemann Hypothesis and the ratio conjecture,…
There are many settings where researchers are interested in estimating average treatment effects and are willing to rely on the unconfoundedness assumption, which requires that the treatment assignment be as good as random conditional on…
Recently, Bordell\'{e}s, Dai, Heyman, Pan and Shparlinski in \cite{Igor} considered a partial sum involving the Euler totient function and the integer parts $\lfloor x/n\rfloor$ function. Among other things, they obtained reasonably tight…
We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…
We give two approximation algorithms solving the Stochastic Boolean Function Evaluation (SBFE) problem for symmetric Boolean functions. The first is an $O(\log n)$-approximation algorithm, based on the submodular goal-value approach of…
It is shown that monotone Boolean functions on the Boolean cube capture the expected number of primes, under he usual identification by binary expansion. This answers a question posed by G.Kalai.
We characterize the symmetric distributions that can be (approximately) generated by shallow Boolean circuits. More precisely, let $f\colon \{0,1\}^m \to \{0,1\}^n$ be a Boolean function where each output bit depends on at most $d$ input…
In this work, we consider a class of second order uniformly elliptic operators with smooth and bounded coefficients. We provide some estimates on the norm of the semigroup generated by these operators acting on weighted Sobolev spaces,…
We address the problem of finding optimal strategies for computing Boolean symmetric functions. We consider a collocated network, where each node's transmissions can be heard by every other node. Each node has a Boolean measurement and we…
We establish explicit operator norm bounds and essential self-adjointness criteria for discrete Hodge Laplacians on weighted graphs and simplicial complexes. For unweighted $d$-regular graphs we prove the universal estimate…
We give a complexity dichotomy for the problem of computing the partition function of a weighted Boolean constraint satisfaction problem. Such a problem is parameterized by a set of rational-valued functions, which generalize constraints.…