English
Related papers

Related papers: Convex order for convolution polynomials of Borel …

200 papers

We study the complexity with respect to Borel reducibility of the relations of isometry and isometric embeddability between ultrametric Polish spaces for which a set $D$ of possible distances is fixed in advance. These are, respectively, an…

Logic · Mathematics 2018-12-06 Riccardo Camerlo , Alberto Marcone , Luca Motto Ros

General extensions of an inequality due to Rogozin, concerning the essential supremum of a convolution of probability density functions on the real line, are obtained. While a weak version of the inequality is proved in the very general…

Probability · Mathematics 2017-05-03 Mokshay Madiman , James Melbourne , Peng Xu

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…

Optimization and Control · Mathematics 2024-06-17 Martin Plávala , Laurens T. Ligthart , David Gross

We study the descriptive complexity of sets of points defined by placing restrictions on statistical behaviour of their orbits in dynamical systems on Polish spaces. A particular examples of such sets are the set of generic points of a…

Dynamical Systems · Mathematics 2025-08-13 Konrad Deka , Steve Jackson , Dominik Kwietniak , Bill Mance

Poincar\'{e}-Sobolev-type inequalities involving rearrangement-invariant norms on the entire $\mathbb{R}^n$ are provided. Namely, inequalities of the type $\|u-P\|_{Y(\mathbb{R}^n)}\leq C\|\nabla^m u\|_{X(\mathbb{R}^n)}$, where $X$ and $Y$…

Functional Analysis · Mathematics 2021-07-07 Zdeněk Mihula

We show that for any log-concave measure $\mu$ on $\mathbb{R}^n$, any pair of symmetric convex sets $K$ and $L$, and any $\lambda\in [0,1],$ $$\mu((1-\lambda) K+\lambda L)^{c_n}\geq (1-\lambda) \mu(K)^{c_n}+\lambda\mu(L)^{c_n},$$ where…

Metric Geometry · Mathematics 2026-05-14 Galyna V. Livshyts

Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Euclid, through classical results of Newton, Muirhead and Gantmacher, to…

Combinatorics · Mathematics 2026-05-14 Colin McSwiggen , Siddhartha Sahi

To the families of geometric measures of convex bodies (the area measures of Aleksandrov-Fenchel-Jessen, the curvature measures of Federer, and the recently discovered dual curvature measures) a new family is added. The new family of…

Metric Geometry · Mathematics 2025-02-13 Erwin Lutwak , Dongmeng Xi , Deane Yang , Gaoyong Zhang

We prove that the (B) conjecture and the Gardner-Zvavitch conjecture are true for all log-concave measures that are rotationally invariant, extending previous results known for Gaussian measures. Actually, our result apply beyond the case…

Metric Geometry · Mathematics 2022-10-03 Dario Cordero-Erausquin , Liran Rotem

For the multivariate trigonometric polynomials we study convolution with the corresponding the de la Vallee Poussin kernel from the point of view of discretization. In other words, we replace the normalized Lebesgue measure by a discrete…

Numerical Analysis · Mathematics 2022-01-04 V. N. Temlyakov

A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for certain parameter ranges. The conjecture would provide a unified…

Functional Analysis · Mathematics 2011-08-09 Sergey Bobkov , Mokshay Madiman , Liyao Wang

The aim of this paper is to study properties of sections of convex bodies with respect to different types of measures. We present a formula connecting the Minkowski functional of a convex symmetric body K with the measure of its sections.…

Metric Geometry · Mathematics 2007-05-23 Artem Zvavitch

Sumset estimates, which provide bounds on the cardinality of sumsets of finite sets in a group, form an essential part of the toolkit of additive combinatorics. In recent years, probabilistic or entropic analogs of many of these…

Metric Geometry · Mathematics 2022-06-06 Matthieu Fradelizi , Mokshay Madiman , Artem Zvavitch

We study the Hopf monoid of convex geometries, which contains partial orders as a Hopf submonoid, and investigate the combinatorial invariants arising from canonical characters. Each invariant consists of a pair: a polynomial and a more…

Combinatorics · Mathematics 2025-06-30 Yichen Ma

The Brunn-Minkowski and Pr\'{e}kopa-Leindler inequalities admit a variety of proofs that are inspired by convexity. Nevertheless, the former holds for compact sets and the latter for integrable functions so it seems that convexity has no…

Metric Geometry · Mathematics 2019-12-17 Peter Pivovarov , Jesus Rebollo Bueno

If Poincar{\'e} inequality has been studied by Bobkov for radial measures, few is known about the logarithmic Sobolev inequalty in the radial case. We try to fill this gap here using different methods: Bobkov's argument and…

Functional Analysis · Mathematics 2019-12-24 Patrick Cattiaux , Arnaud Guillin , Liming Wu

We present a class of modified logarithmic Sobolev inequality, interpolating between Poincar\'e and logarithmic Sobolev inequalities, suitable for measures of the type $\exp(-|x|^\al)$ or more complex $\exp(-|x|^\al\log^\beta(2+|x|))$…

Probability · Mathematics 2016-09-07 Ivan Gentil , Arnaud Guillin , Laurent Miclo

We use a generalization of Vinogradov's mean value theorem of S. Parsell, S. Prendiville and T. Wooley and ideas of W. Schmidt to give nontrivial bounds for the number of solutions to polynomial congruences, for arbitrary polynomials, when…

Number Theory · Mathematics 2013-02-27 Bryce Kerr

This paper describes the theory of Minkowski problems for geometric measures in convex geometric analysis. The theory goes back to Minkowski and Aleksandrov and has been developed extensively in recent years. The paper surveys classical and…

Metric Geometry · Mathematics 2025-02-11 Yong Huang , Deane Yang , Gaoyang Zhzng

The aim of this paper is to implement some new techniques, based on conjugate duality in convex optimization, for proving the existence of global error bounds for convex inequality systems. We deal first of all with systems described via…

Optimization and Control · Mathematics 2010-07-13 Radu Ioan Bot , Ernö Robert Csetnek