Mahler's Conjecture and Wavelets.
Many Endpoints and Few Interior Points of Geodesics.
Many Triangulated Spheres.
Maße für gerichtete Geraden und nicht-symmetrische Pseudometriken in der Ebene II.
Mathematical programming problems involving continuum of inequality constraints
Matrices and graphs in Euclidean geometry.
Maximal elements and equilibria of generalized games for -majorized and condensing correspondences.
Maximization of distances of regular polygons on a circle
This paper presents the solution of a basic problem defined by J. Černý which solves a concrete everyday problem in railway and road transport (the problem of optimization of time-tables by some criteria).
Maximizing the Bregman divergence from a Bregman family
The problem to maximize the information divergence from an exponential family is generalized to the setting of Bregman divergences and suitably defined Bregman families.
Maximum convex hulls of connected systems of segments and of polyominoes.
Mazur's Intersection Property for Finite Dimensional Sets.
Mean Projections and Finite Packings of Convex Bodies.
Measure and Helly's Intersection Theorem for Convex Sets
Let be a uniformly bounded collection of compact convex sets in ℝ ⁿ. Katchalski extended Helly’s theorem by proving for finite ℱ that dim (⋂ ℱ) ≥ d, 0 ≤ d ≤ n, if and only if the intersection of any f(n,d) elements has dimension at least d where f(n,0) = n+1 = f(n,n) and f(n,d) = maxn+1,2n-2d+2 for 1 ≤ d ≤ n-1. An equivalent statement of Katchalski’s result for finite ℱ is that there exists δ > 0 such that the intersection of any f(n,d) elements of ℱ contains a d-dimensional ball of measure...
Measure Extensions by Conditional Atoms.
Mehrfache gitterförmige Kreis- und Kugelanordnungen.
Mesures de courbure des variétés lisses et des polyèdres
Mesures sur le cercle et convexes du plan
Metric ellipses in Minkowski planes.
An ellipse in R2 can be defined as the locus of points for which the sum of the Euclidean distances from the two foci is constant. In this paper we will look at the sets that are obtained by considering in the above definition distances induced by arbitrary norms.
Metric entropy of convex hulls in Hilbert spaces
Let T be a precompact subset of a Hilbert space. We estimate the metric entropy of co(T), the convex hull of T, by quantities originating in the theory of majorizing measures. In a similar way, estimates of the Gelfand width are provided. As an application we get upper bounds for the entropy of co(T), , , by functions of the ’s only. This partially answers a question raised by K. Ball and A. Pajor (cf. [1]). Our estimates turn out to be optimal in the case of slowly decreasing sequences .
Metrically convex functions in normed spaces
Properties of metrically convex functions in normed spaces (of any dimension) are considered. The main result, Theorem 4.2, gives necessary and sufficient conditions for a function to be metrically convex, expressed in terms of the classical convexity theory.