An upper bound for a sequence of cevian inequalities.
An Upper Bound for the Minimum Diameter of Integral Point Sets.
Analytische Eigenschaften konvexer Funktionen auf Riemannschen Mannigfaltigkeiten.
Andreev’s Theorem on hyperbolic polyhedra
In 1970, E.M.Andreev published a classification of all three-dimensional compact hyperbolic polyhedra (other than tetrahedra) having non-obtuse dihedral angles. Given a combinatorial description of a polyhedron, , Andreev’s Theorem provides five classes of linear inequalities, depending on , for the dihedral angles, which are necessary and sufficient conditions for the existence of a hyperbolic polyhedron realizing with the assigned dihedral angles. Andreev’s Theorem also shows that the resulting...
Another abstraction of the Erdős-Szekeres happy end theorem.
Another Space-Filling Trefoil Knot.
Answer to one of Fishburn's questions: ``Isosceles planar subsets'' [Discrete Comput. Geom. 19 (1998), no. 3, 391--398]
Our short note gives the affirmative answer to one of Fishburn’s questions.
Aperiodic Tiles.
Approximately generalized convex functions.
Approximating 3-dimensional convex bodies by polytopes with a restricted number of edges.
Approximating the Ball by a Minkowski Sum of Segments with Equal Length.
Approximating the isoperimetric number of strongly regular graphs.
Approximating the Volume of Convex Bodies.
Approximation from the exterior of Carathéodory multifunctions
Approximation of Convex Bodies by Polytopes with Uniformly Bounded Valences.
Approximation of convex bodies by sums of line segments
Approximation of Convex Discs by Polygons.
Approximation of spherical caps by polygons
Approximation of symmetric convex bodies.
Approximation of the Euclidean ball by polytopes
There is a constant c such that for every n ∈ ℕ, there is an Nₙ so that for every N≥ Nₙ there is a polytope P in ℝⁿ with N vertices and where B₂ⁿ denotes the Euclidean unit ball of dimension n.