English
Related papers

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

200 papers

We consider classical solutions to $-\Delta u = f(u)$ in half-spaces, under homogeneous Dirichlet boundary conditions. We prove that any positive solution is strictly monotone increasing in the direction orthogonal to the boundary, provided…

Analysis of PDEs · Mathematics 2025-10-03 Berardino Sciunzi , Domenico Vuono

Let $Q_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove that $Q_n$ is non-singular with probability…

Probability · Mathematics 2007-05-23 Kevin Costello , Terence Tao , Van Vu

In many practical applications, heuristic or approximation algorithms are used to efficiently solve the task at hand. However their solutions frequently do not satisfy natural monotonicity properties of optimal solutions. In this work we…

Machine Learning · Computer Science 2020-03-24 Evangelia Gergatsouli , Brendan Lucier , Christos Tzamos

For parameters $\,c\in(0,1)\,$ and $\,\beta>0$, let $\,\ell_{2}(c,\beta)\,$ be the Hilbert space of real functions defined on $\,\mathbb{N}\,$ (i.e., real sequences), for which $$ \| f \|_{c,\beta}^2 :=…

Classical Analysis and ODEs · Mathematics 2020-07-09 Dimitar K. Dimitrov , Geno P. Nikolov

Given an F-sigma-delta subset A of the real line R of Lebesgue measure zero, we construct a monotone absolutely continuous function f from R to R such that the little Lipschitz constant of f is equal to infinity exactly at points of A.

Classical Analysis and ODEs · Mathematics 2024-01-30 Martin Rmoutil , Thomas Zürcher

We prove non-trivial lower bounds for sums of type $\sum_{p\sim P}g(\gamma\Log p)$, where $g$ is a non-negative $2\pi$-periodical function and $\gamma$ is a given parameter. As an application we prove that $\zeta(1+it)^{\pm1}\ll\Log\Log…

Number Theory · Mathematics 2024-12-17 Olivier Ramaré

The generalized smooth condition, $(L_{0},L_{1})$-smoothness, has triggered people's interest since it is more realistic in many optimization problems shown by both empirical and theoretical evidence. Two recent works established the…

Machine Learning · Computer Science 2023-10-31 Zijian Liu , Srikanth Jagabathula , Zhengyuan Zhou

In this expository and survey paper, along one of main lines of bounding the ratio of two gamma functions, we look back and analyse some inequalities, several complete monotonicity of functions involving ratios of two gamma or $q$-gamma…

Classical Analysis and ODEs · Mathematics 2012-06-21 Feng Qi

For any natural number $n\in\mathbb{N}$, $ \frac{1}{2n+\frac1{1-\gamma}-2}\le \sum_{i=1}^n\frac1i-\ln n-\gamma<\frac{1}{2n+\frac13}, $ where $\gamma=0.57721566490153286...m$ denotes Euler's constant. The constants $\frac{1}{1-\gamma}-2$ and…

Classical Analysis and ODEs · Mathematics 2012-08-21 Chao-Ping Chen , Feng Qi

We prove that any extended formulation that approximates the matching polytope on $n$-vertex graphs up to a factor of $(1+\varepsilon)$ for any $\frac2n \le \varepsilon \le 1$ must have at least $\binom{n}{{\alpha}/{\varepsilon}}$ defining…

Computational Complexity · Computer Science 2017-11-29 Makrand Sinha

We investigate adaptive sublinear algorithms for detecting monotone patterns in an array. Given fixed $2 \leq k \in \mathbb{N}$ and $\varepsilon > 0$, consider the problem of finding a length-$k$ increasing subsequence in an array $f \colon…

Data Structures and Algorithms · Computer Science 2019-11-05 Omri Ben-Eliezer , Shoham Letzter , Erik Waingarten

In this short note we prove a conjecture for the interval $(0,1)$, related to a logarithmically completely monotonic function, presented in \cite{BG}. Then, we extend by proving a more generalized theorem. At the end we pose an open problem…

Classical Analysis and ODEs · Mathematics 2016-01-05 Valmir Krasniqi , Armend Sh. Shabani

Let $F$ be an entire function represented by absolutely convergent for all $z\in\mathbb{C}$ Dirichlet series of the form $ F(z) = \sum\nolimits_{n=0}^{+\infty} a_{n}e^{z\lambda_{n}},$\ where a sequence $(\lambda_n)$ such that…

Complex Variables · Mathematics 2015-12-29 S. I. Panchuk , T. M. Salo , O. B. Skaskiv

The classic Fatou lemma states that the lower limit of a sequence of integrals of functions is greater or equal than the integral of the lower limit. It is known that Fatou's lemma for a sequence of weakly converging measures states a…

Probability · Mathematics 2019-06-19 Eugene A. Feinberg , Pavlo O. Kasyanov , Yan Liang

It is defined $\Gamma_{p,q}$ function, a generalize of $\Gamma$ function. Also, we defined $\psi_{p,q}$-analogue of the psi function as the log derivative of $\Gamma_{p,q}$. For the $\Gamma_{p,q}$ -function, are given some properties…

Classical Analysis and ODEs · Mathematics 2014-07-17 Valmir Krasniqi , Faton Merovci

Motivated by results of Figalli and Jerison and Hern\'andez, we prove the following formula: \begin{equation*} \lim_{\epsilon\to 0^+}\frac{1}{|\ln{\epsilon}|}\big\|\eta_\epsilon*u\big\|^q_{W^{1/q,q}(\Omega)}=…

Analysis of PDEs · Mathematics 2018-12-18 Arkady Poliakovsky

Let $\mu$ be a symmetric probability measure of finite entropy on a group $G$. We show that if $-\log \mu^{(2n)}(id)=o(n^{1/2})$, then the pair $(G,\mu)$ has the Liouville property (all bounded $\mu$-harmonic functions on $G$ are constant).…

Probability · Mathematics 2017-06-13 Yuval Peres , Tianyi Zheng

Algorithmic stability is a classical approach to understanding and analysis of the generalization error of learning algorithms. A notable weakness of most stability-based generalization bounds is that they hold only in expectation.…

Machine Learning · Computer Science 2019-06-25 Vitaly Feldman , Jan Vondrak

In a recent result, Knop, Lovett, McGuire and Yuan (STOC 2021) proved the log-rank conjecture for communication complexity, up to log n factor, for any Boolean function composed with AND function as the inner gadget. One of the main tools…

Computational Complexity · Computer Science 2024-06-14 Farzan Byramji , Vatsal Jha , Chandrima Kayal , Rajat Mittal

It is proved that if $T$ is sufficiently large, then uniformly for all positive integers $\ell \leqslant (\log T) / (\log_2 T)$, we have \begin{equation*} \max_{T\leqslant t\leqslant 2T}\left|\zeta^{(\ell)}\Big(1+it\Big)\right| \geqslant…

Number Theory · Mathematics 2021-08-06 Daodao Yang