In this paper we introduce two new classes of stationary random simplicial tessellations, the so-called $\beta$ - and $\beta^{\prime}$ -Delaunay tessellations. Their construction is based on a space–time paraboloid hull process and generalizes that of the classical Poisson–Delaunay tessellation. We explicitly identify the distribution of volume-power-weighted typical cells, establishing thereby a remarkable connection to the classes of $\beta$ - and $\beta^{\prime}$ -polytopes. These representations are used to determine the principal characteristics of such cells, including volume moments, expected angle sums, and cell intensities.

A new approach to prove weak convergence of random polytopes on the space of compact convex sets is presented. This is used to show that the profile of the rescaled Schläfli random cone of a random conical tessellation, generated by n independent and uniformly distributed random linear hyperplanes in $\mathbb {R}^{d+1}$ , weakly converges to the typical cell of a stationary and isotropic Poisson hyperplane tessellation in $\mathbb {R}^d$ , as $n\to \infty $ .

The Gaussian polytope $\mathcal P_{n,d}$ is the convex hull of n independent standard normally distributed points in $\mathbb{R}^d$ . We derive explicit expressions for the probability that $\mathcal P_{n,d}$ contains a fixed point $x\in\mathbb{R}^d$ as a function of the Euclidean norm of x, and the probability that $\mathcal P_{n,d}$ contains the point $\sigma X$ , where $\sigma\geq 0$ is constant and X is a standard normal vector independent of $\mathcal P_{n,d}$ . As a by-product, we also compute the expected number of k-faces and the expected volume of $\mathcal P_{n,d}$ , thus recovering the results of Affentranger and Schneider (Discr. and Comput. Geometry, 1992) and Efron (Biometrika, 1965), respectively. All formulas are in terms of the volumes of regular spherical simplices, which, in turn, can be expressed through the standard normal distribution function $\Phi(z)$ and its complex version $\Phi(iz)$ . The main tool used in the proofs is the conic version of the Crofton formula.

This article builds on a recent paper coauthored by the present author, H. Hosni and F. Montagna. It is meant to contribute to the logical foundations of probability theory on many-valued events and, specifically, to a deeper understanding of the notion of strict coherence. In particular, we will make use of geometrical, measure-theoretical and logical methods to provide three characterizations of strict coherence on formulas of infinite-valued Łukasiewicz logic.

We investigate how the Minkowski sum of two polytopes affects their graph and, in particular, their diameter. We show that the diameter of the Minkowski sum is bounded below by the diameter of each summand and above by, roughly, the product between the diameter of one summand and the number of vertices of the other. We also prove that both bounds are sharp. In addition, we obtain a result on polytope decomposability. More precisely, given two polytopes $P$ and $Q$, we show that $P$ can be written as a Minkowski sum with a summand homothetic to $Q$ if and only if $P$ has the same number of vertices as its Minkowski sum with $Q$.

We investigate the property of strict coherence in the setting of many-valued logics. Our main results read as follows: (i) a map from an MV-algebra to [0,1] is strictly coherent if and only if it satisfies Carnap’s regularity condition, and (ii) a [0,1]-valued book on a finite set of many-valued events is strictly coherent if and only if it extends to a faithful state of an MV-algebra that contains them. Remarkably this latter result allows us to relax the rather demanding conditions for the Shimony-Kemeny characterisation of strict coherence put forward in the mid 1950s in this Journal.

A fundamental idea in toric topology is that classes of manifolds with well-behaved torus actions (simply, toric spaces) are classified by pairs of simplicial complexes and (non-singular) characteristic maps. In a previous paper, the authors provided a new way to find all characteristic maps on a simplicial complex $K(J)$ obtainable by a sequence of wedgings from $K$.The main idea was that characteristic maps on $K$ theoretically determine all possible characteristic maps on a wedge of $K$.

We further develop our previous work for classification of toric spaces. For a star-shaped simplicial sphere $K$ of dimension $n-1$ with $m$ vertices, the Picard number Pic$(K)$ of $K$ is $m-n$. We call $K$ a seed if $K$ cannot be obtained by wedgings. First, we show that for a fixed positive integer $\ell $, there are at most finitely many seeds of Picard number $\ell $ supporting characteristic maps. As a corollary, the conjecture proposed by V. V. Batyrev in is solved affirmatively.

Secondly, we investigate a systematicmethod to find all characteristic maps on $K(J)$ using combinatorial objects called (realizable) puzzles that only depend on a seed $K$. These two facts lead to a practical way to classify the toric spaces of fixed Picard number.

Combinatorial discrepancy is a complexity measure of a collection of sets which quantifies how well the sets in the collection can be simultaneously balanced. More precisely, we are given an $n$-point set $P$, and a collection ${\mathcal{F}}=\{F_{1},\ldots ,F_{m}\}$ of subsets of $P$, and our goal is color $P$ with two colors, red and blue, so that the maximum over the $F_{i}$ of the absolute difference between the number of red elements and the number of blue elements (the discrepancy) is minimized. Combinatorial discrepancy has many applications in mathematics and computer science, including constructions of uniformly distributed point sets, and lower bounds for data structures and private data analysis algorithms. We investigate the combinatorial discrepancy of geometrically defined systems, in which $P$ is an $n$-point set in $d$-dimensional space, and ${\mathcal{F}}$ is the collection of subsets of $P$ induced by dilations and translations of a fixed convex polytope $B$. Such set systems include systems of sets induced by axis-aligned boxes, whose discrepancy is the subject of the well-known Tusnády problem. We prove new discrepancy upper and lower bounds for such set systems by extending the approach based on factorization norms previously used by the author, Matoušek, and Talwar. We also outline applications of our results to geometric discrepancy, data structure lower bounds, and differential privacy.

We present a first example of a flag vector of a polyhedral sphere that is not the flag vector of any polytope. Namely, there is a unique $3$-sphere with the parameters $(f_{0},f_{1},f_{2},f_{3};f_{02})=(12,40,40,12;120)$, but this sphere is not realizable by a convex $4$-polytope. The $3$-sphere, which is $2$-simple and $2$-simplicial, was found by Werner [Linear constraints on face numbers of polytopes. PhD Thesis, TU Berlin, Germany, 2009]; we present results of a computer enumeration which imply that the sphere with these parameters is unique. We prove that it is non-polytopal in two ways: first, we show that it has no oriented matroid, and thus it is not realizable; this proof was found by computer, but can be verified by hand. The second proof is again a computer-based oriented matroid proof and shows that for exactly one of the facets this sphere does not even have a diagram based on this facet. Using the non-polytopality, we finally prove that the sphere is not even embeddable as a polytopal complex.

In an earlier paper, Romanowska, Ślusarski and Smith described a duality between the category of polytopes (finitely generated real convex sets considered as barycentric algebras) and a certain category of intersections of hypercubes, considered as barycentric algebras with additional constant operations. The present paper provides an extension of this duality to a much more general class of so-called quasipolytopes, that is, convex sets with polytopes as closures. The dual spaces of quasipolytopes are Płonka sums of open polytopes, which are considered as barycentric algebras with some additional operations. In constructing this duality, we use several known and new dualities: the Hofmann–Mislove–Stralka duality for semilattices; the Romanowska–Ślusarski–Smith duality for polytopes; a new duality for open polytopes; and a new duality for injective Płonka sums of polytopes.

Generalizing a result (the case $k= 1$) due to M. A. Perles, we show that any polytopal upper bound sphere of odd dimension $2k+ 1$ belongs to the generalized Walkup class ${ \mathcal{K} }_{k} (2k+ 1)$, i.e., all its vertex links are $k$-stacked spheres. This is surprising since it is far from obvious that the vertex links of polytopal upper bound spheres should have any special combinatorial structure. It has been conjectured that for $d\not = 2k+ 1$, all $(k+ 1)$-neighborly members of the class ${ \mathcal{K} }_{k} (d)$ are tight. The result of this paper shows that the hypothesis $d\not = 2k+ 1$ is essential for every value of $k\geq 1$.

We construct, for all $d\,\ge \,4$, a cellulation of ${{\mathbb{S}}^{d-1}}$. We prove that these cellulations cannot be polytopal with maximal combinatorial symmetry. Such non-realizability phenomenon was first described in dimension 4 by Bokowski, Ewald and Kleinschmidt, and, to the knowledge of the author, until now there have not been any known examples in higher dimensions. As a starting point for the construction, we introduce a new class of (Wythoffian) uniform polytopes, which we call duplexes. In proving our main result, we use some tools that we developed earlier while studying perfect polytopes. In particular, we prove perfectness of the duplexes; furthermore, we prove and make use of the perfectness of another new class of polytopes which we obtain by a variant of the so-called $E$-construction introduced by Eppstein, Kuperberg and Ziegler.

It is proved that, given a convex polytope $P$ in $\mathbb{R}^n$, together with a collection of compact convex subsets in the interior of each facet of $P$, there exists a smooth convex body arbitrarily close to $P$ that coincides with each facet precisely along the prescribed sets, and has positive curvature elsewhere.

Let d ≥ 2, and K ⊂ ℝd be a convex body with 0 ∈ int K. We consider the intersection body IK, the cross-section body CK and the projection body ΠK of K, which satisfy IK ⊂ CK ⊂ ΠK. We prove that [bd(IK)] ∩ [bd(CK)] ≠ (a joint observation with R. J. Gardner), while for d ≥ 3 the relation [CK] ⊂ int(ΠK) holds for K in a dense open set of convex bodies, in the Hausdorff metric. If IK = c ˙ CK for some constant c > 0, then K is centred, and if both IK and CK are centred balls, then K is a centred ball. If the chordal symmetral and the difference body of K are constant multiples of each other, then K is centred; if both are centred balls, then K is a centred ball. For d ≥ 3 we determine the minimal number of facets, and estimate the minimal number of vertices, of a convex d-polytope P having no plane shadow boundary with respect to parallel illumination (this property is related to the inclusion [CP] ⊂ int(ΠP)).