Functional analogs of the Shephard, Busemann-Petty, and Milman problems
Vadim Gorev, Egor Kosov

TL;DR
This paper explores functional versions of classical convex geometry problems, providing bounds that generalize known results for convex sets, thereby extending the scope of these geometric inequalities.
Contribution
It introduces and analyzes functional analogs of the Shephard, Busemann-Petty, and Milman problems, offering new bounds and generalizations.
Findings
Established bounds for functional Shephard problem
Extended Busemann-Petty problem to functional setting
Generalized Milman problem bounds for functions
Abstract
The paper studies possible functional analogs of classical problems from convex geometry. In particular, we provide some bounds in the functional Shephard, Busemann-Petty, and Milman problems generalizing known bounds in this problems for convex sets.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Graph theory and applications · Limits and Structures in Graph Theory
