The geometry of discotopes

We study a class of semialgebraic convex bodies called discotopes. These are instances of zonoids, objects of interest in real algebraic geometry and random geometry. We focus on the face structure and on the boundary hypersurface of discotopes, highlighting interesting birational properties which may be investigated using tools from algebraic geometry. When a discotope is the Minkowski sum of two-dimensional discs, the Zariski closure of its set of extreme points is an irreducible hypersurface. In this case, we provide an upper bound for the degree of the hypersurface, drawing connections to the theory of classical determinantal varieties

Intersection Bodies of Polytopes: Translations and Convexity

We continue the study of intersection bodies of polytopes, focusing on the behavior of $IP$ under translations of $P$. We introduce an affine hyperplane arrangement and show that the polynomials describing the boundary of $I(P+t)$ can be extended to polynomials in variables $t\in \mathbb{R}^d$ within each region of the arrangement. In dimension $2$, we give a full characterization of those polygons such that their intersection body is convex. We give a partial characterization for general dimensions

On smooth functions with two critical values

We prove that every smooth closed manifold admits a smooth real-valued function with only two critical values. We call a function of this type a \emph{Reeb function}. We prove that for a Reeb function we can prescribe the set of minima (or maxima), as soon as this set is a PL subcomplex of the manifold. In analogy with Reeb's Sphere Theorem, we use such functions to study the topology of the underlying manifold. In dimension $3$, we give a characterization of manifolds having a Heegaard splitting of genus $g$ in terms of the existence of certain Reeb functions. Similar results are proved in dimension $n\geq 5$

The algebraic degree of the Wasserstein distance

Given two rational univariate polynomials, the Wasserstein distance of their associated measures is an algebraic number. We determine the algebraic degree of the squared Wasserstein distance, serving as a measure of algebraic complexity of the corresponding optimization problem. The computation relies on the structure of a subpolytope of the Birkhoff polytope, invariant under a transformation induced by complex conjugation.Comment: 17 pages, 3 figure

Convex Hulls of Curves: Volumes and Signatures

Taking the convex hull of a curve is a natural construction in computational geometry. On the other hand, path signatures, central in stochastic analysis, capture geometric properties of curves, although their exact interpretation for levels larger than two is not well understood. In this paper, we study the use of path signatures to compute the volume of the convex hull of a curve. We present sufficient conditions for a curve so that the volume of its convex hull can be computed by such formulae. The canonical example is the classical moment curve, and our class of curves, which we call cyclic, includes other known classes such as $d$-order curves and curves with totally positive torsion. We also conjecture a necessary and sufficient condition on curves for the signature volume formula to hold. Finally, we give a concrete geometric interpretation of the volume formula in terms of lengths and signed areas.Comment: 15 pages, 5 figures. Comments are welcome

Maximizing Slice-Volumes of Semialgebraic Sets using Sum-of-Squares Programming

This paper presents an algorithm to maximize the volume of an affine slice through a given semialgebraic set. This slice-volume task is formulated as an infinite-dimensional linear program in continuous functions, inspired by prior work in volume computation of semialgebraic sets. A convergent sequence of upper-bounds to the maximal slice volume are computed using the moment-Sum-of-Squares hierarchy of semidefinite programs in increasing size. The computational complexity of this scheme can be reduced by utilizing topological structure (in dimensions 2, 3, 4, 8) and symmetry. This numerical convergence can be accelerated through the introduction of redundant Stokes-based constraints. Demonstrations of slice-volume calculation are performed on example sets.Comment: 28 pages, 5 figures, 10 table