Related papers: Sur le minimum de la fonction de Brjuno

We prove that if $f:I\subset \Bbb R\to \Bbb R$ is of bounded variation, then the noncentered maximal function $Mf$ is absolutely continuous, and its derivative satisfies the sharp inequality $\|DMf\|_1\le |Df|(I)$. This allows us obtain,…

Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…

Extremal functions for the $n$th coefficient in the Krzy\.z conjecture are atomic singular inner functions with at most $n$ atoms. This paper gives a lower bound on the number of atoms $N$ of the form $N\geq cn$, marking progress toward…

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 study densities of functionals over uniformly bounded triangulations of a Delaunay set of vertices, and prove that the minimum is attained for the Delaunay triangulation if this is the case for finite sets.

We consider the partial theta function $\theta (q,z):=\sum _{j=0}^{\infty}q^{j(j+1)/2}z^j$, where $(q,z)\in \mathbb{C}^2$, $|q|<1$. We show that for any $0<\delta _0<\delta <1$, there exists $n_0\in \mathbb{N}$ such that for any $q$ with…

In this paper, we obtain upper and lower bounds for the partition function $p(n)$ by using an elementary geometric inequality in Euclidean space, and we extend the method to generalizations of the partition function.

We establish in this paper sharp lower bounds for the $2k$-th moment of the derivative of the Riemann zeta function on the critical line for all real $k \geq 0$.

The Haraux function is an important tool in monotone operator theory and its applications. One of its salient properties for a maximally monotone operator is to be valued in $[0,+\infty]$ and to vanish only on the graph of the operator.…

By Baillon's result, it is known that maximal regularity with respect to the space of continuous functions is rare; it implies that either the involved semigroup generator is a bounded operator or the considered space contains $c_{0}$. We…

This note contains a short proof of the functional equation for the zeta function.

We give a distribution-dependent concentration inequality for functions of independent variables. The result extends Bernstein's inequality from sums to more general functions, whose variation in any argument does not depend too much on the…

The convergence of double Fourier series of functions of bounded partial $\Lambda$-variation is investigated. The sufficient and necessary conditions on the sequence $\Lambda=\{\lambda_n\}$ are found for the convergence of Fourier series of…

Submodular functions are well-studied in combinatorial optimization, game theory and economics. The natural diminishing returns property makes them suitable for many applications. We study an extension of monotone submodular functions,…

An unconditional inequality of the totient function is contributed to the literature. This result is associated with various problems about the distribution of prime numbers.

We construct a Lipschitz truncation which approximates functions of bounded variation in the area-strict metric. The Lipschitz truncation changes the original function only on a small set similar to Lusin's theorem. Previous results could…

We study minimal thinness in the half-space $H:=\{x=(\wt{x}, x_d):\, \wt{x}\in \R^{d-1}, x_d>0\}$ for a large class of rotationally invariant L\'evy processes, including symmetric stable processes and sums of Brownian motion and independent…

We consider the neutralino sector in the Minimal Non--minimal Supersymmetric Standard Model (MNSSM). We argue that there exists a theoretical upper bound on the lightest neutralino mass in the MNSSM. An approximate solution for the mass of…

Submodular function minimization is well studied, and existing algorithms solve it exactly or up to arbitrary accuracy. However, in many applications, such as structured sparse learning or batch Bayesian optimization, the objective function…

For 24 years, it has been an open problem to obtain improved bounds, for the maximal function over a sparse sequence of discrete spherical averages, going beyond the range for the full discrete spherical maximal function. I formulate a…