Let $\hat {\mathbb {R}}^n$ be the one-point compactification of $\mathbb {R}^n$ obtained by adding a point at infinity. We say that a subset $A\subseteq \hat {\mathbb {R}}^n$ is $\mathbf {u}$-convex if for every pair of points $\mathbf {z}_1, \mathbf {z}_2 \in A$, the arc of the unique circle through $\mathbf {u}, \mathbf {z}_1$ and $\mathbf {z}_2$, from $\mathbf {z}_1$ to $\mathbf {z}_2$ and not containing $\mathbf {u}$, is contained in A. In this case, we call $\mathbf {u}$ a pole of A. When the pole $\mathbf {u}$ approaches infinity, $\mathbf {u}$-convex sets become convex in the classical sense.

The notion of polar convexity in the complex plane has been used to analyze the behavior of critical points of polynomials. In this paper, we extend the notion to finite-dimensional Euclidean spaces. The goal of this paper is to start building the theory of polar convexity and to show that the introduction of a pole creates a richer theory. For example, polar convexity enjoys a beautiful duality (see Theorem 4.3) that does not exist in classical convexity. We formulate polar analogues of several classical results of the alternatives, such as Gordan’s and Farkas’ lemmas; see Section 5. Finally, we give a full description of the convex hull of finitely many points with respect to finitely many poles; see Theorem 6.7.

In this paper, we consider the discrete Orlicz chord Minkowski problem and solve the existence of this problem, which is the nontrivial extension of the discrete $L_{p}$ chord Minkowski problem for ${0<p<1}$.

Describing the equality conditions of the Alexandrov–Fenchel inequality [Ale37] has been a major open problem for decades. We prove that in the case of convex polytopes, this description is not in the polynomial hierarchy unless the polynomial hierarchy collapses to a finite level. This is the first hardness result for the problem and is a complexity counterpart of the recent result by Shenfeld and van Handel [SvH23], which gave a geometric characterization of the equality conditions. The proof involves Stanley’s [Sta81] order polytopes and employs poset theoretic technology.

We address the problem of optimal transport with a quadratic cost functional and a constraint on the flux through a constriction along the path. The constriction, conceptually represented by a toll station, limits the flow rate across. We provide a precise formulation which, in addition, is amenable to generalization in higher dimensions. We work out in detail the case of transport in one dimension by proving existence and uniqueness of solution. Under suitable regularity assumptions, we give an explicit construction of the transport plan. Generalization of flux constraints to higher dimensions and possible extensions of the theory are discussed.

In this paper, we give necessary and sufficient conditions for the rigidity of the perimeter inequality under Schwarz symmetrization. The term rigidity refers to the situation in which the equality cases are only obtained by translations of the symmetric set. In particular, we prove that the sufficient conditions for rigidity provided in M. Barchiesi, F. Cagnetti and N. Fusco [Stability of the Steiner symmetrization of convex sets. J. Eur. Math. Soc. 15 (2013), 1245-1278.] are also necessary.

The Hankel index of a real variety X is an invariant that quantifies the difference between nonnegative quadrics and sums of squares on X. In [5], the authors proved an intriguing bound on the Hankel index in terms of the Green–Lazarsfeld index, which measures the ‘linearity’ of the minimal free resolution of the ideal of X. In all previously known cases, this bound was tight. We provide the first class of examples where the bound is not tight; in fact, the difference between Hankel index and Green–Lazarsfeld index can be arbitrarily large. Our examples are outer projections of rational normal curves, where we identify the center of projection with a binary form F. The Green–Lazarsfeld index of the projected curve is given by the complex Waring border rank of F [16]. We show that the Hankel index is given by the almost real rank of F, which is a new notion that comes from decomposing F as a sum of powers of almost real forms. Finally, we determine the range of possible and typical almost real ranks for binary forms.

We establish power-series expansions for the asymptotic expectations of the vertex number and missed area of random disc-polygons in planar convex bodies with $C^{k+1}_+$-smooth boundaries. These results extend asymptotic formulas proved in Fodor et al. (2014).

We present extensions of the colorful Helly theorem for d-collapsible and d-Leray complexes, providing a common generalization to the matroidal versions of the theorem due to Kalai and Meshulam, the ‘very colorful’ Helly theorem introduced by Arocha, Bárány, Bracho, Fabila and Montejano and the ‘semi-intersecting’ colorful Helly theorem proved by Montejano and Karasev.

As an application, we obtain the following extension of Tverberg’s theorem: Let A be a finite set of points in ${\mathbb R}^d$ with $|A|>(r-1)(d+1)$. Then, there exist a partition $A_1,\ldots ,A_r$ of A and a subset $B\subset A$ of size $(r-1)(d+1)$ such that $\cap _{i=1}^r \operatorname {\mathrm {\text {conv}}}( (B\cup \{p\})\cap A_i)\neq \emptyset $ for all $p\in A\setminus B$. That is, we obtain a partition of A into r parts that remains a Tverberg partition even after removing all but one arbitrary point from $A\setminus B$.

Tao and Vu showed that every centrally symmetric convex progression $C\subset \mathbb{Z}^d$ is contained in a generalized arithmetic progression of size $d^{O(d^2)} \# C$. Berg and Henk improved the size bound to $d^{O(d\log d)} \# C$. We obtain the bound $d^{O(d)} \# C$, which is sharp up to the implied constant and is of the same form as the bound in the continuous setting given by John’s theorem.

We prove a weak version of the cross-product conjecture: $\textrm {F}(k+1,\ell ) \hskip .06cm \textrm {F}(k,\ell +1) \ge (\frac 12+\varepsilon ) \hskip .06cm \textrm {F}(k,\ell ) \hskip .06cm \textrm {F}(k+1,\ell +1)$, where $\textrm {F}(k,\ell )$ is the number of linear extensions for which the values at fixed elements $x,y,z$ are k and $\ell $ apart, respectively, and where $\varepsilon>0$ depends on the poset. We also prove the converse inequality and disprove the generalized cross-product conjecture. The proofs use geometric inequalities for mixed volumes and combinatorics of words.

Building on work of Furstenberg and Tzkoni, we introduce $\mathbf {r}$-flag affine quermassintegrals and their dual versions. These quantities generalize affine and dual affine quermassintegrals as averages on flag manifolds (where the Grassmannian can be considered as a special case). We establish affine and linear invariance properties and extend fundamental results to this new setting. In particular, we prove several affine isoperimetric inequalities from convex geometry and their approximate reverse forms. We also introduce functional forms of these quantities and establish corresponding inequalities.

We investigate the convexity of the radial sum of two convex bodies containing the origin. Generally, the radial sum of two convex bodies containing the origin is not convex. We show that the radial sum of a star body (with respect to the origin) and any large centered ball is convex, which produces a pair of convex bodies containing the origin whose radial sum is convex.

We also investigate the convexity of the intersection body of a convex body containing the origin. Generally, the intersection body of a convex body containing the origin is not convex. Busemann’s theorem states that the intersection body of any centered convex body is convex. We are interested in how to construct convex intersection bodies from convex bodies without any symmetry (especially, central symmetry). We show that the intersection body of the radial sum of a star body (with respect to the origin) and any large centered ball is convex, which produces a convex body with no symmetries whose intersection body is convex.

In 1993, E. Lutwak established a minimax inequality for inscribed cones of origin symmetric convex bodies. In this work, we re-prove Lutwak’s result using a maxmin inequality for circumscribed cylinders. Furthermore, we explore connections between the maximum volume of inscribed double cones of a centered convex body and the minimum volume of circumscribed cylinders of its polar body.

This paper relies on nested postulates of separate, linear and arc-continuity of functions to define analogous properties for sets that are weaker than the requirement that the set be open or closed. This allows three novel characterisations of open or closed sets under convexity or separate convexity postulates: the first pertains to separately convex sets, the second to convex sets and the third to arbitrary subsets of a finite-dimensional Euclidean space. By relying on these constructions, we also obtain new results on the relationship between separate and joint continuity of separately quasiconcave, or separately quasiconvex functions. We present examples to show that the sufficient conditions we offer cannot be dispensed with.

Let $\mathcal {S}$ be a family of nonempty sets with VC-codensity less than $2$. We prove that, if $\mathcal {S}$ has the $(\omega ,2)$-property (for any infinitely many sets in $\mathcal {S}$, at least two among them intersect), then $\mathcal {S}$ can be partitioned into finitely many subfamilies, each with the finite intersection property. If $\mathcal {S}$ is definable in some first-order structure, then these subfamilies can be chosen definable too.

This is a strengthening of the case $q=2$ of the definable $(p,q)$-conjecture in model theory [9] and the Alon–Kleitman–Matoušek $(p,q)$-theorem in combinatorics [6].

Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed random variables on the random infinite connected component. We provide sufficient conditions for the existence of the asymptotic shape, and we show that the shape is a Euclidean ball. We give some examples exhibiting the result for Bernoulli percolation and the Richardson model. In the latter case we further show that it converges weakly to a nonstandard branching process in the joint limit of large intensities and slow passage times.

Magnitude is a numerical invariant of compact metric spaces, originally inspired by category theory and now known to be related to myriad other geometric quantities. Generalizing earlier results in $\ell _1^n$ and Euclidean space, we prove an upper bound for the magnitude of a convex body in a hypermetric normed space in terms of its Holmes–Thompson intrinsic volumes. As applications of this bound, we give short new proofs of Mahler’s conjecture in the case of a zonoid and Sudakov’s minoration inequality.

We investigate the weighted $L_p$ affine surface areas which appear in the recently established $L_p$ Steiner formula of the $L_p$ Brunn–Minkowski theory. We show that they are valuations on the set of convex bodies and prove isoperimetric inequalities for them. We show that they are related to f divergences of the cone measures of the convex body and its polar, namely the Kullback–Leibler divergence and the Rényi divergence.

Let $n\geq 2$ random lines intersect a planar convex domain D. Consider the probabilities $p_{nk}$ , $k=0,1, \ldots, {n(n-1)}/{2}$ that the lines produce exactly k intersection points inside D. The objective is finding $p_{nk}$ through geometric invariants of D. Using Ambartzumian’s combinatorial algorithm, the known results are instantly reestablished for $n=2, 3$ . When $n=4$ , these probabilities are expressed by new invariants of D. When D is a disc of radius r, the simplest forms of all invariants are found. The exact values of $p_{3k}$ and $p_{4k}$ are established.

First, we build a computational procedure to reconstruct the convex body from a pre-given surface area measure. Nontrivially, we prove the convergence of this procedure. Then, the sufficient and necessary conditions of a Sobolev binary function to be a lightness function of a convex body are investigated. Finally, we present a computational procedure to compute the curvature function from a pre-given lightness function, and then we reconstruct the convex body from this curvature function by using the first procedure. The convergence is also proved. The main computations in both procedures are simply about the spherical harmonics.