Related papers: Sharp Complex Convexity Estimates
We consider the set of points chosen randomly, independently and uniformly in the $d$-dimensional spherical layer. A set of points is called $1$-convex if all its points are vertices of the convex hull of this set. In \cite{3} an estimate…
Estimates for invariant distances of convexifiable, $\C$-convexifiable and planar domains are given.
We develop techniques to convexify a set that is invariant under permutation and/or change of sign of variables and discuss applications of these results. First, we convexify the intersection of the unit ball of a permutation and…
We prove a two-sided estimate on the sharp $L^p$ Poincar\'e constant of a general open set, in terms of a capacitary variant of its inradius. This extends a result by Maz'ya and Shubin, originally devised for the case $p=2$, in the…
We obtain the sharp constant for the Hardy-Sobolev inequality involving the distance to the origin. This inequality is equivalent to a limiting Caffarelli-Kohn-Nirenberg inequality. In three dimensions, in certain cases the sharp constant…
We consider two non-convex formulations for computing the optimal constant in the Brascamp-Lieb inequality corresponding to a given datum, and show that they are geodesically log-concave on the manifold of positive definite matrices endowed…
Three results in p-convex geometry are established. First is the analogue of the Levi problem in several complex variables, namely: local p-convexity implies global p-convexity. The second asserts that the support of a minimal p-dimensional…
Let $\Omega \subset \mathbb{R}^n$ be a convex. If $u: \Omega \rightarrow \mathbb{R}$ has mean 0, then we have the classical Poincar\'{e} inequality $$ \|u \|_{L^p} \leq c_p \mbox{diam}(\Omega) \| \nabla u \|_{L^p}$$ with sharp constants…
The corner polyhedron is described by minimal valid inequalities from maximal lattice-free convex sets. For the Relaxed Corner Polyhedron (RCP) with two free integer variables and any number of non-negative continuous variables, it is known…
We consider a spectral stability estimate by Burenkov and Lamberti concerning the variation of the eigenvalues of second order uniformly elliptic operators on variable open sets in the N-dimensional euclidean space, and we prove that it is…
The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a…
The sharp constants in the classical John--Nirenberg inequality are found by using Bellman function approach.
This paper is essentially derived from the observation that some results used for improving constants in the Lieb-Thirring inequalities for Schrodinger operators in L2(-\infty,\infty) can be translated to the discrete Schrodinger op-…
Given a compact convex domain $C\subset \mathbb{R}^k$ and bounded measurable functions $f_1,\ldots,f_n:C\to \mathbb{R}$, define the sup-convolution $(f_1\ast \ldots \ast f_n)(z)$ to be the supremum average value of…
The problem of imaging of a moving target is formulated as a Coefficient Inverse Problem for a hyperbolic equation with its coefficient depending on all three spatial variables and time. As the initial condition, the point source running…
We consider a Serrin-type problem in convex cones in the Euclidean space and motivated by recent rigidity results we study the quantitative stability issue for this problem. In particular, we prove both sharp Lipschitz estimates for an…
We investigate the problem of estimating a smooth invertible transformation f when observing independent samples X_1, ..., X_n ~ P \circ f, where P is a known measure. We focus on the two dimensional case where P and f are defined on R^2.…
We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…
In this research paper, the problem of optimization of a quadratic form over the convex hull generated by the corners of hypercube is attempted and solved. Some results related to stable states/vectors, anti-stable states/vectors (over the…
In this paper, we study a class of bilevel programming problem where the inner objective function is strongly convex. More specifically, under some mile assumptions on the partial derivatives of both inner and outer objective functions, we…