The maximum number of second smallest distances in finite planar sets (Q1189287): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unit distances / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3323698 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial complexity bounds for arrangements of curves and spheres / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Sets of Distances of n Points / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Problem of Leo Moser About Repeated Distances on the Sphere / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091941 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5186278 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On large distances in planar sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3676148 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2075551959 / rank | |||
Normal rank |
Latest revision as of 11:36, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The maximum number of second smallest distances in finite planar sets |
scientific article |
Statements
The maximum number of second smallest distances in finite planar sets (English)
0 references
26 September 1992
0 references
Using linear optimization the author gives a bound on the maximum number of second smallest distances in an \(n\)-element point set. In the given bound the constant is best possible. Also a theorem which gives some structural information on the extremal sets is given.
0 references
unit distances
0 references
point sets in the plane
0 references
linear optimization
0 references
0 references