We show that if the Banach-Mazur distance between an n-dimensional normed space X and ell infinity is at most 3/2, then there exist n+1 equidistant points in X. By a well-known result of Alon and Milman, this implies that an arbitrary n-dimensional normed space admits at least e^{c sqrt(log n)} equidistant points, where c>0 is an absolute constant. We also show that there exist n equidistant points in spaces sufficiently close to n-dimensional ell p (1 < p < infinity).
In this paper we prove in certain n-dimensional normed spaces X the existence of full-dimensional equilateral simplices of large size inscribed to the unit ball B. This extends the construction of Makeev [Mak] in dimension 4 and we also compute an example of a space in which the idea cannot be applied.
For fixed $k$ we prove exponential lower bounds on the equilateral number of subspaces of $\ell_{\infty}^n$ of codimension $k$. In particular, we show that if the unit ball of a normed space of dimension $n$ is a centrally symmetric polytope with at most $\frac{4n}{3}-o(n)$ pairs of facets, then it has an equilateral set of cardinality at least $n+1$. These include subspaces of codimension $2$ of $\ell_{\infty}^{n+2}$ for $n\geq 9$ and of codimension $3$ of $\ell_{\infty}^{n+3}$ for $n\geq 15$.
We survey problems and results from combinatorial geometry in normed spaces, concentrating on problems that involve distances. These include various properties of unit-distance graphs, minimum-distance graphs, diameter graphs, as well as minimum spanning trees and Steiner minimum trees. In particular, we discuss translative kissing (or Hadwiger) numbers, equilateral sets, and the Borsuk problem in normed spaces. We show how to use the angular measure of Peter Brass to prove various statements about Hadwiger and blocking numbers of convex bodies in the plane, including some new results. We also…
We consider the problem of estimating small ball probabilities $\mathbb P\{f(G) \leqslant δ\mathbb Ef(G)\}$ for sub-additive,positively homogeneous functions $f$ with respect to the Gaussian measure. We establish estimates that depend on global parameters of the underlying function which take into account analytic and statistical measures, such as the variance and the $L^1$-norms of its partial derivatives. This leads to dimension-dependent bounds for small ball and lower small deviation estimates for seminorms when the linear structure is appropriately chosen to optimize the aforementioned pa…
We apply the technique of Károly Bezdek and Daniel Bezdek to study billiard trajectories in convex bodies, when the length is measured with a (possibly asymmetric) norm. We prove a lower bound for the length of the shortest closed billiard trajectory, related to the non-symmetric Mahler problem. With this technique we are able to give short and elementary proofs to some known results.
Case Western Reserve University（凯斯西储大学）；Institut de Mathématiques de Jussieu-PRG, Sorbonne Université（索邦大学数学研究所Jussieu-PRG）；Institut de Mathématiques de Toulouse, Université de Toulouse & CNRS（图卢兹数学研究所，图卢兹大学与法国国家科学研究中心）；ECMWF（欧洲中期天气预报中心）
In the chasing convex bodies problem, an online player receives a request sequence of $N$ convex sets $K_1,\dots, K_N$ contained in a normed space $\mathbb R^d$. The player starts at $x_0\in \mathbb R^d$, and after observing each $K_n$ picks a new point $x_n\in K_n$. At each step the player pays a movement cost of $||x_n-x_{n-1}||$. The player aims to maintain a constant competitive ratio against the minimum cost possible in hindsight, i.e. knowing all requests in advance. The existence of a finite competitive ratio for convex body chasing was first conjectured in 1991 by Friedman and Linial. …
