Equilateral dimension

Last updated
Regular simplexes of dimensions 0 through 3. The vertices of these shapes give the largest possible equally-spaced point sets for the Euclidean distances in those dimensions Simplexes.jpg
Regular simplexes of dimensions 0 through 3. The vertices of these shapes give the largest possible equally-spaced point sets for the Euclidean distances in those dimensions

In mathematics, the equilateral dimension of a metric space is the maximum size of any subset of the space whose points are all at equal distances to each other. [1] Equilateral dimension has also been called "metric dimension", but the term "metric dimension" also has many other inequivalent usages. [1] The equilateral dimension of -dimensional Euclidean space is , achieved by a regular simplex, and the equilateral dimension of a -dimensional vector space with the Chebyshev distance ( norm) is , achieved by a hypercube. However, the equilateral dimension of a space with the Manhattan distance ( norm) is not known. Kusner's conjecture, named after Robert B. Kusner, states that it is exactly , achieved by a cross polytope. [2]

Contents

Lebesgue spaces

The equilateral dimension has been particularly studied for Lebesgue spaces, finite-dimensional normed vector spaces with the norm

The equilateral dimension of spaces of dimension behaves differently depending on the value of :

Unsolved problem in mathematics:

How many equidistant points exist in spaces with Manhattan distance?

Normed vector spaces

Equilateral dimension has also been considered for normed vector spaces with norms other than the norms. The problem of determining the equilateral dimension for a given norm is closely related to the kissing number problem: the kissing number in a normed space is the maximum number of disjoint translates of a unit ball that can all touch a single central ball, whereas the equilateral dimension is the maximum number of disjoint translates that can all touch each other.

For a normed vector space of dimension , the equilateral dimension is at most ; that is, the norm has the highest equilateral dimension among all normed spaces. [7] Petty (1971) asked whether every normed vector space of dimension has equilateral dimension at least , but this remains unknown. There exist normed spaces in any dimension for which certain sets of four equilateral points cannot be extended to any larger equilateral set [7] but these spaces may have larger equilateral sets that do not include these four points. For norms that are sufficiently close in Banach–Mazur distance to an norm, Petty's question has a positive answer: the equilateral dimension is at least . [8]

It is not possible for high-dimensional spaces to have bounded equilateral dimension: for any integer , all normed vector spaces of sufficiently high dimension have equilateral dimension at least . [9] more specifically, according to a variation of Dvoretzky's theorem by Alon & Milman (1983), every -dimensional normed space has a -dimensional subspace that is close either to a Euclidean space or to a Chebyshev space, where

for some constant . Because it is close to a Lebesgue space, this subspace and therefore also the whole space contains an equilateral set of at least points. Therefore, the same superlogarithmic dependence on holds for the lower bound on the equilateral dimension of -dimensional space. [8]

Riemannian manifolds

For any -dimensional Riemannian manifold the equilateral dimension is at least . [5] For a -dimensional sphere, the equilateral dimension is , the same as for a Euclidean space of one higher dimension into which the sphere can be embedded. [5] At the same time as he posed Kusner's conjecture, Kusner asked whether there exist Riemannian metrics with bounded dimension as a manifold but arbitrarily high equilateral dimension. [5]

Notes

  1. 1 2 Deza & Deza (2009)
  2. Guy (1983); Koolen, Laurent & Schrijver (2000).
  3. Bandelt, Chepoi & Laurent (1998); Koolen, Laurent & Schrijver (2000).
  4. 1 2 Alon & Pudlák (2003).
  5. 1 2 3 4 5 6 Guy (1983).
  6. 1 2 Swanepoel (2004).
  7. 1 2 Petty (1971).
  8. 1 2 Swanepoel & Villa (2008).
  9. Braß (1999); Swanepoel & Villa (2008).

Related Research Articles

In mathematics, more specifically in functional analysis, a Banach space is a complete normed vector space. Thus, a Banach space is a vector space with a metric that allows the computation of vector length and distance between vectors and is complete in the sense that a Cauchy sequence of vectors always converges to a well-defined limit that is within the space.

<span class="mw-page-title-main">Metric space</span> Mathematical space with a notion of distance

In mathematics, a metric space is a set together with a notion of distance between its elements, usually called points. The distance is measured by a function called a metric or distance function. Metric spaces are the most general setting for studying many of the concepts of mathematical analysis and geometry.

<span class="mw-page-title-main">Normed vector space</span> Vector space on which a distance is defined

In mathematics, a normed vector space or normed space is a vector space over the real or complex numbers on which a norm is defined. A norm is a generalization of the intuitive notion of "length" in the physical world. If is a vector space over , where is a field equal to or to , then a norm on is a map , typically denoted by , satisfying the following four axioms:

  1. Non-negativity: for every ,.
  2. Positive definiteness: for every , if and only if is the zero vector.
  3. Absolute homogeneity: for every and ,
  4. Triangle inequality: for every and ,
<span class="mw-page-title-main">Vector space</span> Algebraic structure in linear algebra

In mathematics and physics, a vector space is a set whose elements, often called vectors, may be added together and multiplied ("scaled") by numbers called scalars. Scalars are often real numbers, but can be complex numbers or, more generally, elements of any field. The operations of vector addition and scalar multiplication must satisfy certain requirements, called vector axioms. Real vector space and complex vector space are kinds of vector spaces based on different kinds of scalars: real coordinate space or complex coordinate space.

In mathematics, the Lp spaces are function spaces defined using a natural generalization of the p-norm for finite-dimensional vector spaces. They are sometimes called Lebesgue spaces, named after Henri Lebesgue, although according to the Bourbaki group they were first introduced by Frigyes Riesz.

<span class="mw-page-title-main">Euclidean distance</span> Length of a line segment

In mathematics, the Euclidean distance between two points in Euclidean space is the length of the line segment between them. It can be calculated from the Cartesian coordinates of the points using the Pythagorean theorem, and therefore is occasionally called the Pythagorean distance.

<span class="mw-page-title-main">Ball (mathematics)</span> Volume space bounded by a sphere

In mathematics, a ball is the solid figure bounded by a sphere; it is also called a solid sphere. It may be a closed ball or an open ball.

<span class="mw-page-title-main">Uniform norm</span> Function in mathematical analysis

In mathematical analysis, the uniform norm assigns to real- or complex-valued bounded functions defined on a set the non-negative number

<span class="mw-page-title-main">Taxicab geometry</span> Type of metric geometry

Taxicab geometry or Manhattan geometry is geometry where the familiar Euclidean distance is ignored, and the distance between two points is instead defined to be the sum of the absolute differences of their respective Cartesian coordinates, a distance function called the taxicab distance, Manhattan distance, or city block distance. The name refers to the island of Manhattan, or generically any planned city with a rectangular grid of streets, in which a taxicab can only travel along grid directions. In taxicab geometry, the distance between any two points equals the length of their shortest grid path. This different definition of distance also leads to a different definition of the length of a curve, for which a line segment between any two points has the same length as a grid path between those points rather than its Euclidean length.

In mathematics, a norm is a function from a real or complex vector space to the non-negative real numbers that behaves in certain ways like the distance from the origin: it commutes with scaling, obeys a form of the triangle inequality, and is zero only at the origin. In particular, the Euclidean distance in a Euclidean space is defined by a norm on the associated Euclidean vector space, called the Euclidean norm, the 2-norm, or, sometimes, the magnitude of the vector. This norm can be defined as the square root of the inner product of a vector with itself.

<span class="mw-page-title-main">Real coordinate space</span> Space formed by the n-tuples of real numbers

In mathematics, the real coordinate space or real coordinate n-space, of dimension n, denoted Rn or , is the set of the n-tuples of real numbers, that is the set of all sequences of n real numbers. Special cases are called the real lineR1, the real coordinate planeR2, and the real coordinate three-dimensional spaceR3. With component-wise addition and scalar multiplication, it is a real vector space, and its elements are called coordinate vectors.

In mathematics, Chebyshev distance, maximum metric, or L metric is a metric defined on a real coordinate space where the distance between two points is the greatest of their differences along any coordinate dimension. It is named after Pafnuty Chebyshev.

<span class="mw-page-title-main">Ptolemy's inequality</span>

In Euclidean geometry, Ptolemy's inequality relates the six distances determined by four points in the plane or in a higher-dimensional space. It states that, for any four points A, B, C, and D, the following inequality holds:

In mathematics, Dvoretzky's theorem is an important structural theorem about normed vector spaces proved by Aryeh Dvoretzky in the early 1960s, answering a question of Alexander Grothendieck. In essence, it says that every sufficiently high-dimensional normed vector space will have low-dimensional subspaces that are approximately Euclidean. Equivalently, every high-dimensional bounded symmetric convex set has low-dimensional sections that are approximately ellipsoids.

In functional analysis, the dual norm is a measure of size for a continuous linear function defined on a normed vector space.

In the mathematical study of functional analysis, the Banach–Mazur distance is a way to define a distance on the set of -dimensional normed spaces. With this distance, the set of isometry classes of -dimensional normed spaces becomes a compact metric space, called the Banach–Mazur compactum.

<span class="mw-page-title-main">Minkowski distance</span> Mathematical metric in normed vector space

The Minkowski distance or Minkowski metric is a metric in a normed vector space which can be considered as a generalization of both the Euclidean distance and the Manhattan distance. It is named after the German mathematician Hermann Minkowski.

<span class="mw-page-title-main">Hilbert space</span> Type of topological vector space

In mathematics, Hilbert spaces allow the methods of linear algebra and calculus to be generalized from (finite-dimensional) Euclidean vector spaces to spaces that may be infinite-dimensional. Hilbert spaces arise naturally and frequently in mathematics and physics, typically as function spaces. Formally, a Hilbert space is a vector space equipped with an inner product that induces a distance function for which the space is a complete metric space.

In mathematics, a unit sphere is a sphere of unit radius: the set of points at Euclidean distance 1 from some center point in three-dimensional space. More generally, the unit -sphere is an -sphere of unit radius in -dimensional Euclidean space; the unit circle is a special case, the unit -sphere in the plane. An (open) unit ball is the region inside of a unit sphere, the set of points of distance less than 1 from the center.

In geometry, the distance set of a collection of points is the set of distances between distinct pairs of points. Thus, it can be seen as the generalization of a difference set, the set of distances in collections of numbers.

References