We describe the parameter spaces of some families of quadrilaterals, such as parallelograms, rectangles, rhombuses, cyclic quadrilaterals and trapezoids. For this purpose, we prove that the closed $n$-disc $\mathbb{D}^{n}$ is the unique topological $n$-manifold (with boundary) whose boundary and interior are homeomorphic to $\mathbb{S}^{n-1}$ and $\mathbb{R}^{n}$, respectively. Roughly speaking, our main result states that the natural compactifications of the parameter spaces of cyclic quadrilaterals and of trapezoids, modulo similarity, are both homeomorphic to $\mathbb{D}^{3}$.

We provide a unified approach that encompasses some integral formulas for functions of the visual angle of a compact convex set due to Crofton, Hurwitz and Masotti. The basic tool is an integral formula that also allows us to integrate new functions of the visual angle. Also, we establish some upper and lower bounds for the considered integrals, generalizing, in particular, those obtained by Santaló for Masotti’s integral.

Using previous results about shadow systems and Steiner symmetrization, we prove that the local maximizers of the volume product of convex bodies are actually the global maximizers, that is: ellipsoids.

A flag area measure on an $n$-dimensional euclidean vector space is a continuous translation-invariant valuation with values in the space of signed measures on the flag manifold consisting of a unit vector $v$ and a $(p+1)$-dimensional linear subspace containing $v$ with $0\leqslant p\leqslant n-1$. Using local parallel sets, Hinderer constructed examples of $\text{SO}(n)$-covariant flag area measures. There is an explicit formula for his flag area measures evaluated on polytopes, which involves the squared cosine of the angle between two subspaces. We construct a more general sequence of smooth $\text{SO}(n)$-covariant flag area measures via integration over the normal cycle of appropriate differential forms. We provide an explicit description of our measures on polytopes, which involves an arbitrary elementary symmetric polynomial in the squared cosines of the principal angles between two subspaces. Moreover, we show that these flag area measures span the space of all smooth $\text{SO}(n)$-covariant flag area measures, which gives a classification result in the spirit of Hadwiger’s theorem.

We consider the positive centre sets of regular $n$-gons, rectangles and half discs, and conjecture a Bonnesen type inequality concerning positive centre sets which is stronger than the classical isoperimetric inequality.

The study of high-dimensional distributions is of interest in probability theory, statistics, and asymptotic convex geometry, where the object of interest is the uniform distribution on a convex set in high dimensions. The ℓp-spaces and norms are of particular interest in this setting. In this paper we establish a limit theorem for distributions on ℓp-spheres, conditioned on a rare event, in a high-dimensional geometric setting. As part of our proof, we establish a certain large deviation principle that is also relevant to the study of the tail behavior of random projections of ℓp-balls in a high-dimensional Euclidean space.

In this paper we prove asymptotic upper bounds on the variance of the number of vertices and the missed area of inscribed random disc-polygons in smooth convex discs whose boundary is C+2. We also consider a circumscribed variant of this probability model in which the convex disc is approximated by the intersection of random circles.

We consider the random polytope Kn, defined as the convex hull of n points chosen independently and uniformly at random on the boundary of a smooth convex body in ℝd. We present both lower and upper variance bounds, a strong law of large numbers, and a central limit theorem for the intrinsic volumes of Kn. A normal approximation bound from Stein's method and estimates for surface bodies are among the tools involved.

We show that under the Eikonal abrasion model, prescribing uniform normal speed in the direction of the inward surface normal, the isoperimetric quotient of a convex shape is decreasing monotonically.

We study the classical Rosenthal–Szasz inequality for a plane whose geometry is determined by a norm. This inequality states that the bodies of constant width have the largest perimeter among all planar convex bodies of given diameter. In the case where the unit circle of the norm is given by a Radon curve, we obtain an inequality which is completely analogous to the Euclidean case. For arbitrary norms we obtain an upper bound for the perimeter calculated in the anti-norm, yielding an analogous characterisation of all curves of constant width. To derive these results, we use methods from the differential geometry of curves in normed planes.

Our main result states that whenever we have a non-Euclidean norm $\Vert \cdot \Vert$ on a two-dimensional vector space $X$, there exists some $x\neq 0$ such that for every $\unicode[STIX]{x1D706}\neq 1$, $\unicode[STIX]{x1D706}>0$, there exist $y,z\in X$ satisfying $\Vert y\Vert =\unicode[STIX]{x1D706}\Vert x\Vert$, $z\neq 0$ and $z$ belongs to the bisectors $B(-x,x)$ and $B(-y,y)$. We also give several results about the geometry of the unit sphere of strictly convex planes.

We prove a reverse Faber–Krahn inequality for the Cheeger constant, stating that every convex body in ℝ2 has an affine image such that the product between its Cheeger constant and the square root of its area is not larger than the same quantity for the regular triangle. An analogous result holds for centrally symmetric convex bodies with the regular triangle replaced by the square. We also prove a Mahler-type inequality for the Cheeger constant, stating that every axisymmetric convex body in ℝ2 has a linear image such that the product between its Cheeger constant and the Cheeger constant of its polar body is not larger than the same quantity for the square.

For a convex domain, we use Klain’s cyclic rearrangement to obtain a sequence of convex domains with increasing area and the same perimeter which converges to a disk. As a byproduct, we give a proof of the classical isoperimetric inequality in the plane.

Employing the inverse function theorem on Banach spaces, we prove that in a $C^{2}(S^{n-1})$ -neighborhood of the unit ball, the only solutions of $\unicode[STIX]{x1D6F1}^{2}K=cK$ are origin-centered ellipsoids. Here $K$ is an $n$ -dimensional convex body, $\unicode[STIX]{x1D6F1}K$ is the projection body of $K$ and $\unicode[STIX]{x1D6F1}^{2}K=\unicode[STIX]{x1D6F1}(\unicode[STIX]{x1D6F1}K).$

For a non-empty polyhedral set $P\subset \mathbb{R}^{d}$ , let ${\mathcal{F}}(P)$ denote the set of faces of $P$ , and let $N(P,F)$ be the normal cone of $P$ at the non-empty face $F\in {\mathcal{F}}(P)$ . We prove the identity

$$\begin{eqnarray}\mathop{\sum }_{F\in {\mathcal{F}}(P)}(-1)^{\operatorname{dim}F}\unicode[STIX]{x1D7D9}_{F-N(P,F)}=\left\{\begin{array}{@{}ll@{}}1\quad & \text{if }P\text{ is bounded},\\ 0\quad & \text{if }P\text{ is unbounded and line-free}.\end{array}\right.\end{eqnarray}$$

$0$

The aim of this note is to study octahedrality in vector-valued Lipschitz-free Banach spaces on a metric space, under topological hypotheses on it, by analysing the weak-star strong diameter 2 property in Lipschitz function spaces. Also, we show an example that proves that our results are optimal and that octahedrality in vector-valued Lipschitz-free Banach spaces actually relies on the underlying metric space as well as on the Banach one.

We use the probabilistic method to obtain versions of the colourful Carathéodory theorem and Tverberg's theorem with tolerance.

In particular, we give bounds for the smallest integer N = N(t,d,r) such that for any N points in ℝd, there is a partition of them into r parts for which the following condition holds: after removing any t points from the set, the convex hulls of what is left in each part intersect.

We prove a bound N = rt + O($\sqrt{t}$) for fixed r,d which is polynomial in each parameters. Our bounds extend to colourful versions of Tverberg's theorem, as well as Reay-type variations of this theorem.

We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(1.5029n ). This improves an earlier bound of O(1.6181n ) established by van Kreveld, Löffler and Pach (2012), and almost matches the current best lower bound of Ω(1.5028n ) due to the same authors. Given a planar straight-line graph G with n vertices, we also show how to compute efficiently the number of convex polygons in G.

Based on the definition of divisibility of Markovian quantum dynamics, we discuss the Markovianity of tensor products, multiplications and some convex combinations of Markovian quantum dynamics. We prove that the tensor product of two Markovian dynamics is also a Markovian dynamics and propose a new witness of non-Markovianity.

We propose a new two-phase method for reconstruction of blurred images corrupted by impulse noise. In the first phase, we use a noise detector to identify the pixels that are contaminated by noise, and then, in the second phase, we reconstruct the noisy pixels by solving an equality constrained total variation minimization problem that preserves the exact values of the noise-free pixels. For images that are only corrupted by impulse noise (i.e., not blurred) we apply the semismooth Newton's method to a reduced problem, and if the images are also blurred, we solve the equality constrained reconstruction problem using a first-order primal-dual algorithm. The proposed model improves the computational efficiency (in the denoising case) and has the advantage of being regularization parameter-free. Our numerical results suggest that the method is competitive in terms of its restoration capabilities with respect to the other two-phase methods.