Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
An exact obstruction to a mixed dyadic-triadic selector
The dyadic investigation left open whether every occurring norm-valuation level contains some rare length. A proposed refinement was to select, within a dyadic level, the maximal triadic valuation and then the largest Euclidean length. The following exact example disproves that selector, not the per-level existence question or either assertion of Problem 132.
Put , so , and define
Both and equal one. Take
In coordinates, and , where . The seven unit pairs are
Every remaining squared distance occurs once:
| Pair | Squared distance | ||
|---|---|---|---|
| 2 | 3 | ||
| 0 | 0 | ||
| 0 | 0 | ||
| 2 | 3 | ||
| 0 | 0 | ||
| 0 | 0 | ||
| 0 | 0 | ||
| 2 | 4 |
Thus all six values in the norm shell have . Its largest value is one, with multiplicity seven, greater than the number of vertices six. The other five shell values are rare. The entire set has , so is emphatically not an Erdős counterexample.
The example also defeats a geometric shortcut. Color the points by
Their residues modulo two are , respectively. Modulo they are , respectively. Thus the three residue parts agree for both primes. All cross-color distances are at most one. The unit graph consists of two disjoint equilateral triangles of the same color orientation, joined by one bridge. It has no four-cycle but has seven edges on six vertices. Consequently excluding four-cycles and oppositely oriented triangles cannot supply the missing edge bound.
The exact rational certificate checks all fifteen pairs, multiplicities, and valuations. The author recomputed its spectrum.