Operators on eigenmaps between spheres
Densest Packings of Typical Convex Sets Are Not Lattice-Like .
Finite Coverings by Translates of Centrally Symmetric Convex Domains.
Covering the Plane with Two Kinds of Circles.
Verified methods for computing Pareto sets: General algorithmic analysis
In many engineering problems, we face multi-objective optimization, with several objective functions f₁,...,fₙ. We want to provide the user with the Pareto set-a set of all possible solutions x which cannot be improved in all categories (i.e., for which for all j and for some j is impossible). The user should be able to select an appropriate trade-off between, say, cost and durability. We extend the general results about (verified) algorithmic computability of maxima locations to show that Pareto...
Note to a paper of Bambah, Rogers and Zassenhaus
Finite Sphere Packing and Sphere Covering.
Highly Saturated Packings and Reduced Coverings.
Mehrfache gitterförmige Kreis- und Kugelanordnungen.
A generalization of the Erdös-Szekeres convex n-gon theorem.
Blichfeldt's density bound revisted.
Page 1