Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Cube-free outputs and cubic multiplicity
Status
The elementary statements below are proved and author-recorded. They concern . A positive proportion of input triples have cube-free output; this is not a positive-density theorem for distinct outputs. The remaining issue is still multiplicity.
A cube-free sieve at the critical scale
Theorem. Put
Then
Every triple counted in (1) is primitive.
For , first count the triples with all coordinates divisible by : there are at most . Otherwise choose a unit coordinate. Its coefficient and the derivative of its cube term are units modulo . For fixed other coordinates there are at most three possible unit residues modulo , each lifting uniquely from a root modulo . Union over the three possible choices of coordinate gives
Since , only primes occur. The elementary bound consequently gives, for ,
The same unit-coordinate argument in a complete residue box gives for . Every factor is positive, because . Thus the product in (1) converges to a positive number.
For fixed , CRT and elementary box counting give
Use (3), let , and then let . This proves (1). If a prime divided all coordinates, its cube would divide the output, proving primitivity. At , more explicitly, if and only if all three coordinates are even: the valuations of the nonzero terms are distinct modulo three. Hence .
Bounded average logarithm of the cube part
For a positive integer , define
Thus is the largest perfect cube dividing .
Theorem. Uniformly for ,
First restrict to primitive triples. At every prime, at least one coordinate is a unit. For , the corresponding one-variable congruence modulo has at most three unit roots. This remains true at , since cubing on has kernel of order at most three. The coefficients of are units there. At , a primitive triple has , by the distinct-valuation argument above, so it contributes no cube factor. Consequently for every odd prime and ,
The absolute constant in (5) does not depend on .
Write and . Expanding , equation (5) bounds the primitive contribution to (4) by a constant times
The first series converges. The second prime sum is at most . The primitive contribution is therefore .
For an arbitrary triple write , with primitive. Homogeneity gives . Sum the primitive estimate at , together with the term , and use . This proves (4). In particular,
This controls the output's cube part, not the logarithm of its representation multiplicity.
Primitive collisions at cube-free outputs remain
The split identity already proved in the energy note is
Its common value is
There are pairs for which (8) is cube-free. Here is a sieve proof, including the local conditions.
The binary cubic has no rational projective zero: the rank-two linear map on either side of (7) would turn such a zero into a nonzero rational zero of , contrary to its distinct -adic valuations. Thus is irreducible over , and its discriminant is nonzero. Also
For each prime, at least one of these two values is a unit, so has no fixed prime-cube divisor.
Outside finitely many primes dividing its discriminant, every nonzero zero of modulo has a nonzero partial derivative. Split off the pairs with ; these contribute at most . For the other pairs, choose a coordinate with nonzero derivative and fix the other coordinate. There are at most three simple roots modulo for either choice. Hence
Only primes can occur. Once contains the finitely many bad primes, (9) gives the tail bound
In complete residue boxes the local excluded proportions are . Their product of complements is positive by local nonobstruction. Finite CRT, followed by this tail estimate, proves the asserted positive input density of cube-free -values.
For these parameters the two triples in (7) are positive, primitive and distinct. They lie in . The map from parameters to collision pairs is injective: their difference is , which determines , and then the first coordinate determines . Thus this fixed split plane supplies primitive collisions with cube-free output in a box of side .
Consequence for the density route
The restriction to cube-free outputs retains input triples, and . A bound for their restricted collision count would therefore give positive lower density of . No such bound, nor the weaker bounded-fiber positive-mass criterion, has been established. Equations (4) and (7) show why merely deleting common dilations does not complete the argument: primitive split collisions survive, and the critical average over large directions is still uncontrolled.
The primitive-fiber analysis now separates the bounded entropy of common dilations from primitive multiplicity. It also shows that every curve defined over on the special cubic's output surface has degree divisible by three, excluding rational lines and conics even without cube-freeness. No uniform estimate for its higher-degree curves or primitive fibers was obtained.