A geometric inequality involving a mobile point in the place of the triangle.
A geometric proof of some inequalities involving mixed volumes.
A Geometric Realization Without Self-Intersections Does Exist for Dyck's Regular Map.
A Geometrical Characterization of Choquet Simplexes.
A Geometrical Isoperimetric Inequality and Applications to Problems of Mathematical Physics
A geometrical method in combinatorial complexity
A lower bound for the number of comparisons is obtained, required by a computational problem of classification of an arbitrarily chosen point of the Euclidean space with respect to a given finite family of polyhedral (non-convex, in general) sets, covering the space. This lower bound depends, roughly speaking, on the minimum number of convex parts, into which one can decompose these polyhedral sets. The lower bound is then applied to the knapsack problem.
A Hajós type result on factoring finite abelian groups by subsets. II
It is proved that if a finite abelian group is factored into a direct product of lacunary cyclic subsets, then at least one of the factors must be periodic. This result generalizes Hajós's factorization theorem.
A Hajós-type result on factoring finite Abelian groups by subsets.
A Helly number for unions of two boxes in .
A Helmholtz-Lie Type Characterization of Ellipsoids, I .
A "hidden" characterization of approximatively polyhedral convex sets in Banach spaces
A closed convex subset C of a Banach space X is called approximatively polyhedral if for each ε > 0 there is a polyhedral (= intersection of finitely many closed half-spaces) convex set P ⊂ X at Hausdorff distance < ε from C. We characterize approximatively polyhedral convex sets in Banach spaces and apply the characterization to show that a connected component of the space of closed convex subsets of X endowed with the Hausdorff metric is separable if and only if contains a polyhedral convex...
A "hidden" characterization of polyhedral convex sets
We prove that a closed convex subset C of a complete linear metric space X is polyhedral in its closed linear hull if and only if no infinite subset A ⊂ X∖ C can be hidden behind C in the sense that [x,y]∩ C ≠ ∅ for any distinct x,y ∈ A.
A large dihedral symmetry of the set of alternating sign matrices.
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon.
A linear-time construction of Reuleaux polygons.
A literature review on circle and sphere packing problems: models and methodologies.
À l'ombre de Loewner
A lower bound on packing density.
A Markoff-Type Chain for the View-Obstruction Problem for Spheres in R4.
A mean-square bound for the lattice discrepancy of bodies of rotation with flat points on the boundary