Related papers: On the average sensitivity of laced Boolean functi…
The purpose of this short article is to prove some potential estimates that naturally arise in the study of subelliptic Sobolev inequalites for functions. This will allow us to prove a local subelliptic Sobolev inequality with the optimal…
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…
The accuracy of compound Poisson approximation to the sum $S=w_1S_1+w_2S_2+...+w_NS_N$ is estimated. Here $S_i$ are sums of independent or weakly dependent random variables, and $w_i$ denote weights. The overall smoothing effect of $S$ on…
The primary objective of this paper is to employ methods from analytic number theory to investigate the mean value properties of a composite function involving the Dirichlet divisor function and a generalized minimal power function.…
We present a method of general applicability for finding exact or accurate approximations to bond percolation thresholds for a wide class of lattices. To every lattice we sytematically associate a polynomial, the root of which in $[0,1]$ is…
In this paper, we give various identities for the weighted average of the product of generalized Anderson-Apostol sums with weights concerning completely multiplicative function, completely additive function, logarithms, the Gamma function,…
We prove limit equalities between the sharp constants in weighted Nikolskii-type inequalities for multivariate polynomials on an $m$-dimensional cube and ball and the corresponding constants for entire functions of exponential type.
Weighted degrees of quasihomogeneous Hamiltonian functions of the Painlev\'{e} equations are investigated. A tuple of positive integers, called a regular weight, satisfying certain conditions related to singularity theory is classified.…
The {\em Total Influence} ({\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \ifnum\plusminus=1 $f: \{\pm1\}^n…
We investigate functions with the property that for every interval, the slope at the midpoint of the interval is the same as the average slope. More generally, we find functions whose average slopes over intervals are given by the slope at…
In this article, we extend the notion of the Laplacian spread to simple directed graphs (digraphs) using the restricted numerical range. First, we provide Laplacian spread values for several families of digraphs. Then, we prove sharp upper…
Assign independent weights to the edges of the square lattice, from the uniform distribution on $\{a,b\}$ for some $0<a<b<\infty$. The weighted graph induces a random metric on $\mathbb{Z}^2$. Let $T_n$ denote the distance between $(0,0)$…
A Boolean function $f:\{0,1\}^n \to \{0,1\}$ is said to be noise sensitive if inserting a small random error in its argument makes the value of the function almost unpredictable. Benjamini, Kalai and Schramm showed that if the sum of…
We propose a novel definition of Shapley values with uncertain value functions based on first principles using probability theory. Such uncertain value functions can arise in the context of explainable machine learning as a result of…
Boolean functions can be used to construct binary linear codes in many ways, and vice versa. The objective of this short article is to point out a connection between the weight distributions of all projective binary linear codes and the…
We prove three sharp estimates for the generalized Zalcman coefficient functional: one for the Hurwitz class, another for the Noshiro-Warschawski class, and yet another for the functions in the closed convex hull of convex univalent…
In this paper we investigate the regularity properties of weighted Bergman projections for smoothly bounded pseudo-convex domains of finite type in $\mathbb{C}^{n}$. The main result is obtained for weights equal to a non negative rational…
Level-based and share-based loss functions are asymptotically equivalent if, in the limit, their averages converge almost surely to a constant ratio. These loss functions take a target value and its realization as arguments and are often…
In the present note we prove an asymptotically tight relation between additive and multiplicative complexity of Boolean functions with respect to implementation by circuits over the basis {+,*,1}.
This paper develops a general theory on rates of convergence of penalized spline estimators for function estimation when the likelihood functional is concave in candidate functions, where the likelihood is interpreted in a broad sense that…