On the Volume of Equichordal Sets.
On the volume of the double stochastic matrices.
On the volume of the polytope of doubly stochastic matrices.
On the volume of unbounded polyhedra in the hyperbolic space.
On the volumes of hyperbolic 5-orthoschemes and the Trilogarithm.
On the Weight of Minor Faces in Triangle-Free 3-Polytopes
The weight w(f) of a face f in a 3-polytope is the degree-sum of vertices incident with f. It follows from Lebesgue’s results of 1940 that every triangle-free 3-polytope without 4-faces incident with at least three 3-vertices has a 4-face with w ≤ 21 or a 5-face with w ≤ 17. Here, the bound 17 is sharp, but it was still unknown whether 21 is sharp. The purpose of this paper is to improve this 21 to 20, which is best possible.
On the Zone of a Surface in a Hyperplane Arrangement.
On the ψ₂-behaviour of linear functionals on isotropic convex bodies
The slicing problem can be reduced to the study of isotropic convex bodies K with , where is the isotropic constant. We study the ψ₂-behaviour of linear functionals on this class of bodies. It is proved that for all θ in a subset U of with measure σ(U) ≥ 1 - exp(-c√n). However, there exist isotropic convex bodies K with uniformly bounded geometric distance from the Euclidean ball, such that . In a different direction, we show that good average ψ₂-behaviour of linear functionals on an isotropic...
On tropical Kleene star matrices and alcoved polytopes
In this paper we give a short, elementary proof of a known result in tropical mathematics, by which the convexity of the column span of a zero-diagonal real matrix is characterized by being a Kleene star. We give applications to alcoved polytopes, using normal idempotent matrices (which form a subclass of Kleene stars). For a normal matrix we define a norm and show that this is the radius of a hyperplane section of its tropical span.
On Tucker's key theorem.
On two classes of Banach spaces with uniform normal structure
On Two Conjectures of Franz Hering About Convex Surfaces.
On Two Finite Covering Problems of Bambah, Rogers, Woods and Zassenhaus.
On unit balls and isoperimetrices in normed spaces
The purpose of this paper is to continue the investigations on the homothety of unit balls and isoperimetrices in higher-dimensional Minkowski spaces for the Holmes-Thompson measure and the Busemann measure. Moreover, we show a strong relation between affine isoperimetric inequalities and Minkowski geometry by proving some new related inequalities.
On Weak Tail Domination of Random Vectors
Motivated by a question of Krzysztof Oleszkiewicz we study a notion of weak tail domination of random vectors. We show that if the dominating random variable is sufficiently regular then weak tail domination implies strong tail domination. In particular, a positive answer to Oleszkiewicz's question would follow from the so-called Bernoulli conjecture. We also prove that any unconditional logarithmically concave distribution is strongly dominated by a product symmetric exponential measure.
On weighted parallel volumes.
On α(·)-monotone multifunctions and differentiability of γ-paraconvex functions
Let (X,d) be a metric space. Let Φ be a family of real-valued functions defined on X. Sufficient conditions are given for an α(·)-monotone multifunction to be single-valued and continuous on a weakly angle-small set. As an application it is shown that a γ-paraconvex function defined on an open convex subset of a Banach space having separable dual is Fréchet differentiable on a residual set.
One functional-analytical idea by Alexandrov in convex geometry.
One-adhesive polymatroids
Adhesive polymatroids were defined by F. Matúš motivated by entropy functions. Two polymatroids are adhesive if they can be glued together along their joint part in a modular way; and are one-adhesive, if one of them has a single point outside their intersection. It is shown that two polymatroids are one-adhesive if and only if two closely related polymatroids have joint extension. Using this result, adhesive polymatroid pairs on a five-element set are characterized.
On-line algorithms for the -adic covering of the unit interval and for covering a cube by cubes.