Neuere Studien über Gitterpolygone.
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...
We study the closures of classes of log-concave measures under taking weak limits, linear transformations and tensor products. We investigate which uniform measures on convex bodies can be obtained starting from some class 𝒦. In particular we prove that if one starts from one-dimensional log-concave measures, one obtains no non-trivial uniform mesures on convex bodies.
We construct a Lipschitz function on which is locally convex on the complement of some totally disconnected compact set but not convex. Existence of such function disproves a theorem that appeared in a paper by L. Pasqualini and was also cited by other authors.
We study various aspects of nonexpansive retracts and retractions in certain Banach and metric spaces, with special emphasis on the compact nonexpansive envelope property.