On the maximum number of points at least one unit away from each other in the unit \(n\)-cube (Q1046801): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10998-008-7083-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054692878 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4654164 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4274020 / rank | |||
Normal rank | |||
Latest revision as of 08:35, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the maximum number of points at least one unit away from each other in the unit \(n\)-cube |
scientific article |
Statements
On the maximum number of points at least one unit away from each other in the unit \(n\)-cube (English)
0 references
29 December 2009
0 references
Denote by \(f(n)\) the maximum number of points which can be placed in the unit cube \([0,1]^n\) so that the minimum distance between distinct points is at least 1. In the paper under review, the authors describe some known results in small dimensions and when \(n\) tends to infinity and obtain some new upper bounds for \(f(n)\) for \(6 \leq n \leq 12\). The asymptotic of \(f(n)\) is discussed as well.
0 references
packing
0 references
point
0 references
cube
0 references
