Related papers: Optimal Thresholds for Monotone Non-Boolean Functi…

We give a upper bound of Lebesgue measure $V(S(f,h,\Omega))$ of the set $S(f,h,\Omega)$ of points $q\in Q_h^d$ for which the triple $(h,q,\Omega)$ is dynamically robust when $f$ is monotonic and satisfies certain condition on some compact…

Monotonicity criteria are established for the generalized Marcum Q-function, $\emph{Q}_{M}$, the standard Nuttall Q-function, $\emph{Q}_{M,N}$, and the normalized Nuttall Q-function, $\mathcal{Q}_{M,N}$, with respect to their real order…

We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…

For each $q\in{\mathbb{N}}_0$, we construct positive linear polynomial approximation operators $M_n$ that simultaneously preserve $k$-monotonicity for all $0\leq k\leq q$ and yield the estimate \[ |f(x)-M_n(f, x)| \leq c…

In the article we present necessary and sufficient conditions for a function involving the logarithm of the gamma function to be completely monotonic and apply these results to bound the gamma function $\Gamma(x)$, the $n$-th harmonic…

The purpose of this paper is to estimate the intensity of a Poisson process $N$ by using thresholding rules. In this paper, the intensity, defined as the derivative of the mean measure of $N$ with respect to $ndx$ where $n$ is a fixed…

A key fact in the theory of Boolean functions $f : \{0,1\}^n \to \{0,1\}$ is that they often undergo sharp thresholds. For example: if the function $f : \{0,1\}^n \to \{0,1\}$ is monotone and symmetric under a transitive action with…

We show a procedure that, given oracle access to a function $f\colon \{0,1\}^n\to\{0,1\}$, produces oracle access to a function $f'\colon \{0,1\}^{n'}\to\{0,1\}$ such that if $f$ is monotone, then $f'$ is monotone, and if $f$ is…

We study the problem of estimating a monotone function $f:\{0,1\}^d\to[0,1]$ from noisy observations at uniformly random vertices of the Boolean hypercube. As a measure of complexity for the target~$f$, we use the total $L^1$-influence…

We study the pointwise supremum of convex integral functionals $\mathcal{I}_{f,\gamma}(\xi)= \sup_{Q} \left( \int_\Omega f(\omega,\xi(\omega))Q(d\omega)-\gamma(Q)\right)$ on $L^\infty(\Omega,\mathcal{F},\mathbb{P})$ where…

Given query access to a monotone function $f\colon\{0,1\}^n\to\{0,1\}$ with certificate complexity $C(f)$ and an input $x^{\star}$, we design an algorithm that outputs a size-$C(f)$ subset of $x^{\star}$ certifying the value of…

For $m,n\in \mathbb{N}$, let $0 < \alpha_i,\beta_j,\lambda_{ij} \leq 1$ be such that $\sum_{j=1}^n \lambda_{ij} = \alpha_i$, $\sum_{i=1}^m \lambda_{ij} = \beta_j$, and $\sum_{i=1}^m \alpha_i = \sum_{j=1}^n \beta_j \leq 1$. We prove that the…

We show that if $(X, \mu, T)$ is a probability measure-preserving dynamical system, and $\mathscr{P}$ is a countable partition of $(X, \mu)$, then the limit $$ \lim_{n, k \to \infty} \mathbb{E} \left[ \frac{1}{k} \sum_{j = 0}^{k - 1} f…

We generalize the celebrated isoperimetric inequality of Khot, Minzer, and Safra~(SICOMP 2018) for Boolean functions to the case of real-valued functions $f \colon \{0,1\}^d\to\mathbb{R}$. Our main tool in the proof of the generalized…

We consider positive solutions to $\displaystyle -\Delta_p u=\frac{1}{u^\gamma}+f(u)$ under zero Dirichlet condition in the half space. Exploiting a prio-ri estimates and the moving plane technique, we prove that any solution is monotone…

We study positive solutions to the problem $-\Delta_p u + \vartheta |\nabla u|^q = \frac{1}{u^\gamma} + f(u)$ in $\mathbb{R}^N_+$ with the zero Dirichlet boundary condition, where $p>1$, $\gamma>0$, $0<q\le p$, $\vartheta\ge0$ and…

We show that the $L^1$ norm of an exponential sum of length $X$ and with coefficients equal to the Liouville or M\"{o}bius function is at least $\gg_{\varepsilon} X^{1/4 - \varepsilon}$ for any given $\varepsilon$. For the Liouville…

This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex. We show that no algorithm can reach an error $\epsilon$ in minimizing all functions from…

We prove the (optimal) $W^{1,\infty}$-regularity of weak solutions to the equation $-\Delta u = Q \; \mathcal{H}^{n-1} \llcorner \Gamma$ in a domain $\Omega \subset \mathbb{R}^n$ with Dirichlet boundary conditions, where $\Gamma \subset…

We study the problem of finding a function u verifying --$\Delta$u = 0 in $\Omega$ under the boundary condition $\partial$u $\partial$n + g(u) = $\mu$ on $\partial$$\Omega$ where $\Omega$ $\subset$ R N is a smooth domain, n the normal unit…