New bounds in some transference theorems in the geometry of numbers.
New conjectural lower bounds on the optimal density of sphere packings.
New lower bounds for Heilbronn numbers.
New Upper Bounds for Some Spherical Codes
The maximal cardinality of a code W on the unit sphere in n dimensions with (x, y) ≤ s whenever x, y ∈ W, x 6= y, is denoted by A(n, s). We use two methods for obtaining new upper bounds on A(n, s) for some values of n and s. We find new linear programming bounds by suitable polynomials of degrees which are higher than the degrees of the previously known good polynomials due to Levenshtein [11, 12]. Also we investigate the possibilities for attaining the Levenshtein bounds [11, 12]. In such cases...
New upper bounds on sphere packings. II.
Non-integer lattice tilings by (k, n) truncated crosses.
Nontiles and nonfacets for the Euclidean space, spherical complexes and convex polytopes.
Normal polytopes, triangulations, and Koszul algebras.
Note on Lattice-Point-Free Convex Bodies.
Note on Packing of 19 Equal Circles on a Sphere.
Note to a paper of Bambah, Rogers and Zassenhaus
Notions of denseness.
Nullstellenverteilung zweier konvexgeometrischer Polynome