An improved lower bound to Erdos' problem concerning products of distances for fixed diameter
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917148481290240 |
|---|---|
| author | Sothanaphan, Nat |
| author_facet | Sothanaphan, Nat |
| contents | Erdos, Herzog and Piranian asked whether, for $n$ points in the plane with fixed diameter (maximum distance between points), an arrangement of a regular $n$-gon maximizes their product of all pairs of distances. Recently, it was discovered that, for every even $n \geq 4$, a regular $n$-gon is not a maximizer. However, the discovered improvement turns out to be very small. Indeed, for a fixed diameter of $2$, let $Δ$ be the square of the product of all pairs of distances (the "square" is here due to connections with polynomial discriminants). Then, for a regular $n$-gon, $Δ= n^n$ for even $n$. The discovered arrangements have proven $Δ= (1+o(1))n^n$ thus far, and it was not known whether one can have $Δ\geq C n^n$ for some $C > 1$ and all sufficiently large even $n$. In this note, we show that indeed $\liminf_{n\to\infty} Δ_{\max}/n^n > 1.037$ for even $n$ which settles this conjecture. Other arrangements with higher conjectured $Δ/n^n$ values are in fact known, but we have not been able to obtain proofs that they have large products of distances. Finally, no arrangements such that $Δ/n^n \to \infty$ are known and we do not know whether they exist. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_14251 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An improved lower bound to Erdos' problem concerning products of distances for fixed diameter Sothanaphan, Nat Metric Geometry Combinatorics 52C10 Erdos, Herzog and Piranian asked whether, for $n$ points in the plane with fixed diameter (maximum distance between points), an arrangement of a regular $n$-gon maximizes their product of all pairs of distances. Recently, it was discovered that, for every even $n \geq 4$, a regular $n$-gon is not a maximizer. However, the discovered improvement turns out to be very small. Indeed, for a fixed diameter of $2$, let $Δ$ be the square of the product of all pairs of distances (the "square" is here due to connections with polynomial discriminants). Then, for a regular $n$-gon, $Δ= n^n$ for even $n$. The discovered arrangements have proven $Δ= (1+o(1))n^n$ thus far, and it was not known whether one can have $Δ\geq C n^n$ for some $C > 1$ and all sufficiently large even $n$. In this note, we show that indeed $\liminf_{n\to\infty} Δ_{\max}/n^n > 1.037$ for even $n$ which settles this conjecture. Other arrangements with higher conjectured $Δ/n^n$ values are in fact known, but we have not been able to obtain proofs that they have large products of distances. Finally, no arrangements such that $Δ/n^n \to \infty$ are known and we do not know whether they exist. |
| title | An improved lower bound to Erdos' problem concerning products of distances for fixed diameter |
| topic | Metric Geometry Combinatorics 52C10 |
| url | https://arxiv.org/abs/2512.14251 |