Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Erdős 699: why more curve factors do not settle one index-six case
P699 research · The full-overlap column classes · The index-eight degree bound
Consider the index-six profile
Its row capacities are .
Proposition. If a nonzero polynomial has multiplicity at least at every nonnegative integer point on row , , then
This holds in every degree, without requiring symmetry, a coprime polynomial family, or full rank of a jet matrix. In particular, allowing common curve zeros whose bad points can be bounded by Runge's theorem, positivity, or a local argument does not supply the strict weighted-degree gain at this profile: inequality (1) holds for each polynomial itself.
The proposition does not say that any bad triple realizes this profile. Stronger cofactor estimates, additional restrictions on the Kummer labels, and sharper bounds for polynomial values at a particular column remain outside its scope.
Point weights and a nine-line covering
Put . Give these points weights using the following numerators, all divided by . Within row , the entries are ordered by .
| Row | Weight numerators |
|---|---|
| 0 | |
| 1 | |
| 2 | |
| 3 | |
| 4 | |
| 5 |
Their row sums are exactly . Give the following lines coefficients with the same denominator .
| Lines | Numerator for each line |
|---|---|
| , | 2480 |
| , | 1359 |
| , | 1851 |
| 1155 | |
| 924 | |
| 2395 |
The exact incidence inequalities are
Every covering line itself has weighted incidence at most one: and have incidence , and the other seven have incidence one.
For an irreducible curve different from these nine lines, Bézout gives
for every covering line. Multiplying by , summing, and using (2) proves
The covering lines satisfy the non-strict bound separately. Since multiplicities and degrees add under factorization, every nonzero polynomial consequently satisfies
Taking the weighted sum of its row multiplicities proves (1).
The standard-library checker and certificate verify all 21 point weights, all nine line incidences, and the row sums using exact arithmetic. No optimization solver or bounded-degree search is needed to verify the proof.