Related papers: A robust Khintchine inequality, and algorithms for…

We investigate numerically the optimal constants in Lieb-Thirring inequalities by studying the associated maximization problem. We use a monotonic fixed-point algorithm and a finite element discretization to obtain trial potentials which…

Let $X$ be a real-valued random variable with distribution function $F$. Set $X_1,\dots, X_m$ to be independent copies of $X$ and let $F_m$ be the corresponding empirical distribution function. We show that there are absolute constants…

Let $f$ be a real-valued, degree-$d$ Boolean function defined on the $n$-dimensional Boolean cube $\{\pm 1\}^{n}$, and $f(x) = \sum_{S \subset \{1,\ldots,d\}} \widehat{f}(S) \prod_{k \in S} x_k$ its Fourier-Walsh expansion. The main result…

The present paper is devoted to construction of an optimal quadrature formula for approximation of Fourier integrals in the Hilbert space $W_2^{(1,0)}[a,b]$ of non-periodic, complex valued functions. Here the quadrature sum consists of…

The purpose of this paper is to find optimal estimates for the Green function and the Poisson kernel for a half-line and intervals of the geometric stable process with parameter $\alpha\in(0,2]$. This process has an infinitesimal generator…

The Hermite-Hadamard inequality states that the average value of a convex function on an interval is bounded from above by the average value of the function at the endpoints of the interval. We provide a generalization to higher dimensions:…

As part of the search for the value of the smallest upper bound of the best constant for the famous Grothendieck inequality, the so-called Grothendieck constant (a hard open problem - unsolved since 1953), we provide a further approach,…

The goal of the article is to improve constants in the infimum convolution inequalities (IC for short) which were introduced by R. Lata{\l}a and J.O. Wojtaszczyk. We show that the exponential distribution satisfies IC with constant $2$ but…

In this paper, we discuss the development of a sublinear sparse Fourier algorithm for high-dimensional data. In ``Adaptive Sublinear Time Fourier Algorithm" by D. Lawlor, Y. Wang and A. Christlieb (2013), an efficient algorithm with…

We prove that for every decision tree, the absolute values of the Fourier coefficients of a given order $\ell\geq1$ sum to at most $c^{\ell}\sqrt{\binom{d}{\ell}(1+\log n)^{\ell-1}},$ where $n$ is the number of variables, $d$ is the tree…

This paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the worst-case expectation problem, which…

We study the complexity of optimizing highly smooth convex functions. For a positive integer $p$, we want to find an $\epsilon$-approximate minimum of a convex function $f$, given oracle access to the function and its first $p$ derivatives,…

This paper establishes quantitative correlation inequalities between monotone events and structured threshold objects in both the discrete cube and Gaussian space. We prove that for any increasing balanced family, there exists a linear…

We consider a unique continuation problem where the Dirichlet trace of the solution is known to have finite dimension. We prove Lipschitz stability of the unique continuation problem and design a finite element method that exploits the…

In a Hilbertian framework, for the minimization of a general convex differentiable function $f$, we introduce new inertial dynamics and algorithms that generate trajectories and iterates that converge fastly towards the minimizer of $f$…

Non-linearity of a Boolean function indicates how far it is from any linear function. Despite there being several strong results about identifying a linear function and distinguishing one from a sufficiently non-linear function, we found a…

For $0<\alpha<1$ let $V(\alpha)$ denote the supremum of the numbers $v$ such that every $\alpha$-H\"older continuous function is of bounded variation on a set of Hausdorff dimension $v$. Kahane and Katznelson (2009) proved the estimate $1/2…

Minkowski proved that any $n$-dimensional lattice of unit determinant has a nonzero vector of Euclidean norm at most $\sqrt{n}$; in fact, there are $2^{\Omega(n)}$ such lattice vectors. Lattices whose minimum distances come close to…

A function defined on the Boolean hypercube is $k$-Fourier-sparse if it has at most $k$ nonzero Fourier coefficients. For a function $f: \mathbb{F}_2^n \rightarrow \mathbb{R}$ and parameters $k$ and $d$, we prove a strong upper bound on the…

Tarski's theorem states that every monotone function from a complete lattice to itself has a fixed point. We analyze the query complexity of finding such a fixed point on the $k$-dimensional grid of side length $n$ under the $\leq$…