Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Cubic collisions as large Eisenstein content
Status and relation to the earlier attempt
The parametrization, height comparison, local permutation calculation, and implication from a content-tail bound below are proved. The required content-tail bound is not proved, and no density case is resolved. The resulting parametrization revisits the earlier Eisenstein height-counting attempt; it is not a wholly new resolution of that obstruction. The additions are the exact integral multiplier classification, the admissible logarithmic loss in the content-tail criterion, the complete-residue calculation, and the common-zero geometry.
The approach uses one fixed Euclidean ring rather than the varying quadratic fields in the quadric-fiber approach.
The initial observation is that every collision quadric
has the point over the same quadratic field. This does not mean that every such quadric is split over that field. Instead, a direct global change of coordinates gives the parametrization below.
Fix positive integers and write . Let , , and put
Here , and absolute values use the complex embedding. The ring is Euclidean: rounding the two real coordinates in its basis approximates any complex number with squared error at most . Thus primitive vectors have a Bezout identity.
Exact integral parametrization
For integral vectors , set
Writing and , one has
Consequently
For integral , the rational scalar in (1) is automatically integral.
Now let be primitive over , with . Define
Equivalently, is the positive gcd of the two integral coefficients of in the basis .
Parametrization lemma. The nonzero integral scalar multiples which satisfy the collision equation (1) are exactly
The associated coordinates need not be positive; positivity is an additional restriction.
Indeed, primitivity and Bezout show that if and only if . Also
Thus a nonzero satisfies (1) if and only if . Finally
by the ordinary gcd of the two coefficients of . This proves (2).
Conversely, divide the three raw coordinates of any integral collision by their common Eisenstein gcd. This produces a primitive and recovers the collision by (2). Changing the gcd by a unit produces only the six unit associates of ; it does not affect the counting argument.
Positivity controls the archimedean height
For a positive collision, the raw coordinates lie in the sector . After division by their common Eisenstein gcd, the primitive coordinates therefore lie in a common rotated sector of opening . Put
For vectors in any such sector, projecting onto its bisector gives
In particular
There is no cancellation exception to this estimate in the positive collision region.
Since , the complex-coordinate height in (2) is
The complex-coordinate height is comparable to the largest absolute value of the associated integer root coordinates. Thus a positive collision in requires
and each primitive parameter vector gives at most
allowed multipliers.
A sufficient large-content estimate
Let count primitive with , lying in some common rotated sector of opening , and with .
The following is a sufficient hypothesis, not an established bound: for some fixed ,
It would imply
Consequently it would give positive lower density for the positive values of , and, after a fixed powerful dilation, for .
To prove this implication, fix a dyadic shell . Only contents
can contribute, and (3) bounds them above by . In a dyadic content bin , use (4) and (5) to bound the number of collisions by
Summing these bins gives
When , the same bound holds because makes . Finally, the dyadic sum of (7) over is : after , it is bounded by a constant multiple of .
Thus logarithmic losses in the ratio would be harmless. A logarithmic loss depending on alone at the endpoint would not give (6).
An exact local calculation
At every prime , one has and . Hence the map
is a permutation: its exponent is coprime to , since
If some is a unit modulo , then for each prescribed value of and each choice of the other two coordinates, there is exactly one value of that coordinate. Therefore
This supports the codimension-two divisibility scale in (5), but it concerns complete residue boxes. It does not count large contents in the incomplete box .
Why this is not yet a solution
The endpoint includes primitive vectors for which is bounded. Such a fixed multiplier is itself a fixed cubic collision equation. In particular, includes the original equation. Primitivity over does not remove this stratum.
For an exact example, take . Then
The norms of the three raw Eisenstein coordinates are , whose gcd is one. The raw vector is therefore primitive over . Direct calculation gives
Thus cubic-sized content can occur without a nontrivial common Eisenstein divisor in the input.
There is also no simple factorization of the common-zero locus of the two content polynomials. After base extension, its projective form is
It is a smooth complete intersection of bidegrees in characteristic zero. To check smoothness, a dependent pair of gradients would give
for every . A nonmatching support forces ; on a matching nonzero coordinate the two equations also force . Adjunction gives trivial canonical bundle; the Koszul sequence gives . Thus (9) is a K3 surface, rather than a union of elementary norm-factor loci.
The missing estimate is a large-modulus gcd bound of the strength (5), especially its endpoint. Complete congruence counts, the Euclidean algorithm in the fixed field, and the parametrization alone do not supply it. The route is retained as a different arithmetic formulation, not as a completed argument or a claim that the hard endpoint has been reduced to an easier theorem.