Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Controlled ranges in the cubic collision count
Status
The estimates below are proved. They remove several ranges at the desired scale from the cubic energy route. They do not bound the full energy or establish positive density.
Fix positive integers , and count pairs with
Write . For , write , where and is primitive. For every fixed , the union of the following three ranges contributes :
The last two ranges have power-saving bounds after coordinate-zero differences are removed.
For the special coefficients , the later argument in Coordinate-zero differences also gives a power saving in the first range. It removes those inputs from the logarithmic-multiplicity problem at a cost of .
A uniform binary quadratic bound
Fix and . If are nonzero integers of absolute value at most , with , then
Set and . Multiplication by gives . If is a square, factorization into bounds the count by .
Otherwise put . Each solution determines a distinct algebraic integer
There are at most integral ideals of norm , uniformly in . At a split prime the number of ideals of norm is ; at a ramified prime it is one; at an inert prime it is at most one. Multiply these bounds over primes.
The relevant generators of any one principal ideal are uniformly controlled. Both embeddings of have absolute value at most
In an imaginary quadratic field each ideal has at most six generators of a prescribed norm. In a real quadratic field generators differ by units, while their first absolute embedding lies between and . A fundamental unit whose first absolute embedding exceeds one has that embedding at least . Indeed, after adjusting its sign, a norm-one unit satisfies , and a norm-minus-one unit satisfies . Thus only units can occur in the indicated interval, independently of the field.
We obtain solutions. The divisor bound, with its exponent chosen in terms of , proves (2).
A uniform ternary quadratic bound
If and , then
For fixed , apply (2) to when it is nonzero, increasing the fixed height exponent as necessary. The exceptional equation has at most two integral solutions . For each, the homogeneous binary equation has solutions, since fixing permits at most two values of . This proves (3), without a primitivity or nonsquare-discriminant hypothesis. Fixed constant multiples of in the coordinate bounds cause no change.
Applying the bound to cubic differences
Put . The identity gives
When , equation (3) applies uniformly for each ; its coefficients and target have polynomial height in . Ignoring parity and positivity restrictions only enlarges the count. Consequently, for ,
Taking and gives a power saving over .
Alternatively, after and division by , equation (4) becomes
For one has , and the target is , so (3) is uniform here too. Since primitive vectors have maximum norm ,
Coordinate-zero directions are excluded here and handled next. Taking and gives a power saving.
Coordinate-zero differences
Let . The number of collisions with is
The inequality uses Cauchy--Schwarz and invariance of the integral under multiplication of by a positive integer. The log-free fourth moment follows from Heath-Brown, The density of rational points on cubic surfaces, Theorem 1. Its statement was checked in the indexed primary text: for a nonsingular cubic surface with three rational coplanar lines, integer points off the rational lines have count . The Fermat cubic surface meets these hypotheses; its finitely many lines contribute . Applying (8) to each coordinate proves the first bound in (1).
The remaining range and unsuccessful analytic transfers
For , never vanishes at a nonzero rational vector: the nonzero summands have distinct -adic valuations modulo three. Thus all remaining fibers are nonsingular. The part of the energy route not controlled by (1) is confined to
This still contains the critical shell , . Its expected count per direction has not been proved on average. The weaker bounded-fiber criterion in the energy note could bypass a full energy bound; it is not established either.
Direct use of Browning--Heath-Brown, Counting rational points on quadric surfaces, Theorem 1.1 does not close this range. Even when its hypothesis on the squarefull part of the determinant holds, its bound contains . For generic directions of size , our four-variable has height of order and determinant of order , giving a factor . The resulting estimate is too large to sum. Replacing by balances the real coefficients but introduces the sublattice and rational coefficients; no estimate preserving the necessary arithmetic saving under this operation was established. This rejects the direct substitution into that theorem, not a sharper anisotropic average.
Fixing one coordinate in (6) gives another attempted transfer, through binary quadratic norm equations. After choosing two same-sign coefficients, the primitive diagonal positive binary form represents an ambiguous ideal class: its inverse is the same class. Varying diagonal factorizations therefore does not average over the whole class group, and dividing an unrestricted ideal count by the class number is unjustified. The target values are also linked to , rather than running through a complete norm interval.
The unconditional result inspected in Browning--Munshi--Wang, Beyond the square-root barrier: cubic forms of Perazzo type, Theorem 1.1 concerns the singular fourfold . The diagonal collision fourfold is smooth, so it is not linearly equivalent to that example. In difference coordinates the additional term has the same cubic scale as in the outstanding range; simply omitting it is not a valid application of the theorem. No perturbation or averaged estimate bridging this difference was proved.
The precise complete-sum change in the Perazzo transfer
A subsequent check identified the arithmetic step, rather than merely the geometric distinction, that prevents the direct transfer. The calculation below is self-contained. It supplies no new global energy estimate.
Let , let be the quadratic character modulo , extended by zero, and let . Put
For frequencies with , define
Terms with some vanish on summing over . Completing the three quadratic squares in the other terms gives exactly
where
If the cubic term is identically removed, the inner sum is , so (10) reduces to
Here is a nondegenerate ternary quadratic form: its three nonzero mixed-term coefficients are . For any nondegenerate ternary quadratic form , expansion of by its Gauss sum, followed by completing squares, gives
On each coordinate plane, is a nonzero constant times the product of the other two coordinates; its character Fourier sum has magnitude at most . Intersections of two coordinate planes contribute zero. Thus (11) has magnitude at most outside the dual quadratic condition in (12). This is the special finite-field cancellation behind the unperturbed calculation.
For , the inner sum of (10) instead has the Salié identity
For completeness, sum both sides against over . At , each sum is ; at , each is zero. On the right this follows by one quadratic Gauss sum. This proves (13), including .
Accordingly the part of with is
Directions with give the corresponding restricted part of (11). Recovering a estimate now requires an bound for the combined sum after its prefactor is removed. Formula (12) does not supply that bound: the cubic term remains in the phase and in the square-root condition of (14). No needed cancellation estimate or subsequent modulus average was proved. This rules out the direct substitution into the unperturbed proof, not every possible treatment of the perturbed sum.
Coordinate-zero differences have a power saving for distinct cube classes
The following strengthens the first range of (1). The external input is Salberger, Counting rational points on projective varieties (2023), Corollary 0.7, pp. 1094–1095. The theorem and its projective-height convention were checked in the full paper. For a diagonal degree- surface in with nonzero rational coefficients, its rational points of height at most outside all two-term-zero-subsum loci number , uniformly in the coefficients.
Let be rational, with . Then
Indeed, a same-sign two-term subsum cannot vanish. A subsum forces and then , and likewise for the other matching pair. A crossed subsum, such as , would make a rational cube. Thus every primitive nontrivial positive solution lies in Salberger's open subset. Splitting a general solution by its coordinate gcd gives
since . This proves (15).
Consequently, if the three coefficients of have distinct rational cube classes, the number of off-diagonal collisions having at least one equal coordinate satisfies
For each choice of the common coordinate, sum (15) over its possible values. In particular, (16) applies to .
Removal from the logarithmic moment
For this special form, let be the inputs in having a distinct equal-output partner with some equal coordinate. Let count the representations remaining after deleting . Then , and each remaining fiber is coordinatewise injective; in particular .
Writing , use and to obtain, also when ,
Here . Since , (16) implies
Thus deleting these inputs preserves the bounded-logarithmic-moment question, including the effect on their surviving fiber-mates. The remaining fibers, whose representations differ in all three coordinates, are not bounded by this argument. No density conclusion follows from (15)–(17) alone.
Near neighbors for arbitrary positive coefficients
There is also a useful conclusion without the distinct-cube-class hypothesis. Let count inputs having a distinct equal-output partner within Euclidean distance , with at least one equal coordinate. Then for every positive ternary diagonal cubic,
The bound remains valid in a fixed interior box.
To prove this, fix the common coordinate and write for the other two. Salberger's open subset contributes the power-saving term as above, even if the coefficient ratio is a cube. The only remaining off-diagonal positive solutions have
Indeed, the same-sign two-term subsums cannot vanish, the same-coordinate subsum forces the diagonal, and either crossed subsum forces this weighted swap. The distance condition implies . Fixing leaves at most possibilities for . Sum over the three choices of to prove (18).
It follows that
Thus the near-neighbor criterion may now restrict entirely to partners differing in all three coordinates, for every positive coefficient tuple. That remaining existence estimate, at distance with fixed , is still unproved.
A uniform bound on each secant-ratio slice
The following additional estimates are proved. They control a new arithmetic stratum of the near-neighbor count, but not all its inputs.
Write an ordered nontrivial collision as
and put
Throughout this section assume . For the special form , the condition is automatic.
Slice lemma. For every , the number of satisfying
is
uniformly in . Requiring can only decrease this count.
Proof. The collision equation is . Set . The two equations become
The scalar in parentheses is .
Let , , and . The quadratic form is nondegenerate on . Indeed, a vector in the radical of its restriction has , so . Membership in and then force . Its nonzero level in (20) is therefore a nonsingular affine conic and contains no line. Equivalently, the homogeneous ternary matrix of that conic has rank three.
If the affine plane has an integral point, its integral points are a coset of the rank-two lattice
For each prime, some is a unit; hence the denominator in (21) divides .
Choose a shortest nonzero lattice vector . It is primitive in , and the two-dimensional lattice bound gives . Extend it to a lattice basis. The parallel lattice lines in direction are spaced . Only such lines meet the box. Each meets the conic at most twice, proving (19).
Fixed normalized ratios and bounded denominators
Define the normalized secant ratio
It determines the third intersection of the secant with the cubic: its parameter on the line is .
For a prescribed rational , let count ordered collisions in with and . For ,
with a constant independent of . For each , apply (19) with . There are primitive directions of height , so the resulting sum is bounded by
There is also a bound allowing infinitely many normalized ratios as varies. Fix and . Let count the same pairs, restricted by
where means the reduced positive denominator. Then
To prove this, partition the displacements into dyadic shells . Since , a contributing ratio satisfies
There are at most such rationals of denominator at most . Apply (22), with , to each. This bounds the shell by . The upper endpoints of the shells up to sum to at most , proving (23).
For fixed , the full collision energy on this stratum is . Its near-neighbor existence count at Euclidean distance at most is at most
because every such input participates in an ordered pair counted by (23). Thus this stratum satisfies the vanishing near-neighbor limit required in the density criterion.
Remaining gap. No uniform tail estimate permits or while retaining almost all relevant input mass. Ratios can have reduced denominators growing with , and directions can have arbitrarily small. The denominator in (23) is that of , not the denominator of the third secant point in primitive projective coordinates. The bounds do not imply the full near-neighbor estimate, bounded typical multiplicity, or positive density.
Binary norm ratios of small height
This estimate concerns with fixed , not the distinct-coefficient form . Put . Let count ordered collisions
such that in lowest terms with , excluding the identical triple and the swap . For all , , and ,
Write , and . First suppose . Fix . Since , at most pairs can occur, and each determines . All contributing norms are at most . The elementary norm bound
follows in the Eisenstein integers: there are at most integral ideals of norm , and each principal ideal has six generators. For each resulting binary quadruple, the equation
has no solutions unless , and otherwise at most solutions. Fixing the nonzero difference leaves a quadratic equation. Since , the divisor bound, with its exponents chosen sufficiently small, proves (25) for .
If , then . Write , , , . From and , we obtain
The identities and give
If , then and equal trace and norm force only the excluded identical pair and swap. Otherwise the right side of (26) is nonzero. The coefficients and target have polynomial height in , since here. The uniform binary quadratic bound gives choices of per . Thus the binary quadruples number at most
The choices complete the proof of (25).
For any fixed , take and . Removing all endpoints of these nontrivial collisions costs inputs, and also in the logarithmic moment, since . The unrestricted norm ratios can have height of order , however. No bound for their complementary input mass has been proved. In particular (25) does not bound the cross-coordinate correlation or conditional entropy.
Nearly vanishing directions near a balanced positive ray
The following geometric observation is checked. It does not extend the exact coordinate-sharing count to nearby directions.
For , , put , and . Assume
where is sufficiently small. Expanding the collision identity gives
Indeed the linear term is , while the quadratic and cubic terms are . Using
we conclude that
For the last implication, makes the largest two comparable, and the product is .
Thus nearly vanishing directions in this cone approach weighted coordinate-swap directions. But for nonzero integer differences with and one coordinate at most , the available ternary quadratic bound gives only . At proportional to and a fixed small fraction of , this is not . Continuity of the real geometry therefore does not justify replacing the uncontrolled thin sector by the already controlled exact coordinate-zero locus. No near-neighbor existence estimate follows.
Binary trace ratios, uniformly in the prescribed ratio
Fix and put . Exclude the collisions and . For every reduced positive rational , the remaining collisions in with
number
uniformly in , even when their height grows with .
Only can contribute. Write
Then
Suppose first that . Fixing fixes a nonzero , and . Unless
the uniform binary quadratic bound (2) gives choices of for each divisor . All coefficients and targets have polynomial height in . The divisor bound, with smaller intermediate exponents, proves (28) for this part.
Under (30), one has . If is not a rational square, then . Enumerate instead. Equation (29) prescribes a nonzero difference of cubes, which has solutions : factor and fix its first factor.
If with , set . The homogeneous solutions are
Here whenever exists. Thus there are pairs . Each again prescribes a nonzero difference of cubes, giving collisions. The case cannot satisfy (30) when .
Finally let . If , then , and equal binary trace and cubic sum give only the excluded identical pair and swap. Otherwise, for each , (29) is a binary quadratic equation with nonzero target. Apply (2) and then allow the choices of . This completes the proof.
There are positive rational ratios of height at most , so their nontrivial collisions number
For every fixed , taking and permits removal of all endpoints of these collisions at cost . The same is true for their contribution to the logarithmic moment, by the deletion inequality (17) and .
Unlike the small-direction range, (28) permits unrestricted displacements. Unlike (25), it imposes no small-height condition on the binary norm ratio. Neither observation controls its complementary trace-ratio tail. A fiber can have many distinct traces of size comparable to with pairwise small gcd, so ordinary pigeonhole arguments do not supply a ratio of height at most . No typical-multiplicity estimate or density conclusion follows.