Related papers: Optimal L$^1$-bounds for submartingales

Let $X$ be a simplicial complex. For $1\le i\le\dim(X)$, let $X(i)$ be the set of $i$-dimensional faces of $X$, and let $f_i(X)=|X(i)|$. For $0\le i\le \dim(X)-1$, let $L_i^+(X)$ be the $i$-th upper Laplacian operator of $X$. For $\sigma\in…

Bourgain in his seminal paper [2] about the analysis of maximal functions associated to convex bodies, has estimated in a sharp way the $L^2$-operator norm of the maximal function associated to a kernel $K\in L^1,$ with differentiable…

In this article we derive the best possible upper bound for $E[\max{X_i}-\min_i{X_i}]$ under given means and variances on $n$ random variables $X_i$. The random vector $(X_1,...,X_n)$ is allowed to have any dependence structure, provided $E…

In this paper, we prove sharp upper and lower bounds for the approximation of Sobolev functions by sums of multivariate ridge functions, i.e., for approximation by functions of the form $\mathbb{R}^d \ni x \mapsto \sum_{k=1}^n \varrho_k(A_k…

A quaternionic matrix-valued regular function is a map $F: \Omega \rightarrow M_n(\mathbb{H})$ whose entries are (left) regular functions of a quaternion variable, where $\Omega$ is a domain in $\mathbb{H}$. Our aim is to bring out some…

In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first presented framework is a continuation of one of our previous…

In this paper, we obtain bounds on the $L^1$ norm of the sum $\sum_{n\le x}\tau(n) e(\alpha n)$ where $\tau(n)$ is the divisor function.

We extend an inequality of Merryfield, valid in the continuous setting, to discrete multiparameter martingales. As a consequence, we obtain the $L^p$ comparison of the maximal function with the square function: \begin{align*} E[(Sf)^p]…

In this article, we give an explicit and uniform lower bound of the arithmetic Hilbert-Samuel function of projective hypersurfaces, which has the optimal dominant term. As an application, we apply this lower bound in the determinant method.

The goal of this paper is to design compact support basis spline functions that best approximate a given filter (e.g., an ideal Lowpass filter). The optimum function is found by minimizing the least square problem ($\ell$2 norm of the…

In this paper we prove an analogue of the discrete spherical maximal theorem of Magyar, Stein, and Wainger, an analogue which concerns maximal functions associated to homogenous algebraic surfaces. Let $\mathfrak{p}$ be a homogenous…

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…

Let $f\in L^p(\mathbb{R}^d)$, $d\ge 3$, and let $A_t f(x)$ the average of $f$ over the sphere with radius $t$ centered at $x$. For a subset $E$ of $[1,2]$ we prove close to sharp $L^p\to L^q$ estimates for the maximal function $\sup_{t\in…

We study extremal properties of the function $$ F(x) := \min\{k\|x\|^{1-1/k}\colon k\ge 1\},\ x\in[0,1], $$ where $\|x\|=\min\{x,1-x\}$. In particular, we show that $F$ is the pointwise largest function of the class of all real-valued…

We establish multilinear $L^p$ bounds for a class of maximal multilinear averages of functions on one variable, reproving and generalizing the bilinear maximal function bounds of Lacey. As an application we obtain almost everywhere…

Given sparse collections of measurable sets $\mathcal S_k$, $k=1,2,\ldots ,N$, in a general measure space $(X,\mathfrak M,\mu)$, let $ \Lambda_{\mathcal S_k}$ be the sparse operator, corresponding to $\mathcal S_k$. We show that the maximal…

We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864--885], obtained by searching for an optimal probability…

We study the existing algorithms that solve the multidimensional martingale optimal transport. Then we provide a new algorithm based on entropic regularization and Newton's method. Then we provide theoretical convergence rate results and we…

This work introduces the minimax Laplace transform method, a modification of the cumulant-based matrix Laplace transform method developed in "User-friendly tail bounds for sums of random matrices" (arXiv:1004.4389v6) that yields both upper…

We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…