Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Erdős 699: an all-degree polynomial obstruction at index eight
P699 research · The remaining cofactor profile · The corresponding quintic obstruction
Consider the remaining index-eight 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 and does not assume symmetry, coprime sections, or surjectivity of a jet matrix. Thus the strict weighted-degree gain required by the present polynomial divisor argument cannot hold at this profile. Finding a polynomial whose common curve zeros are effectively bounded, through Runge's theorem or a local nonvanishing argument, does not by itself change (1).
The statement does not assert that the profile is realized by any bad triple. Stronger cofactor estimates, restrictions on the actual Kummer labels, or sharper estimates for polynomial values at the particular column remain outside this obstruction.
Point weights
Let . Give its points weights as follows. The entries are numerators with denominator 100; within row , they are ordered by .
| Row | Weight numerators |
|---|---|
| 0 | |
| 1 | |
| 2 | |
| 3 | |
| 4 | |
| 5 | |
| 6 | |
| 7 |
Their row sums are exactly . We prove the stronger universal inequality
A thirteen-line covering
Assign the following coefficients to lines. Again, all numerators have denominator 100.
| Lines | Numerator for each line |
|---|---|
| , | 8 |
| , | 7 |
| , | 5 |
| , | 6 |
| 7 | |
| 8 | |
| 6 | |
| 11 | |
| 14 |
The exact incidence checks give
Each covering line itself has weighted incidence at most one: have incidence ; have incidence ; the other nine lines have incidence one.
Let be an irreducible curve different from these thirteen lines. Bézout's theorem gives
for every covering line. Combining these inequalities with (3) yields
The covering lines obey the non-strict bound separately. Factoring an arbitrary nonzero polynomial into irreducible factors therefore proves (2). Its row-multiplicity consequence is (1).
The integer/rational checker and certificate verify all 36 point weights, all thirteen line incidences, and the row sums. No optimization solver or bounded-degree search is needed to verify the proof.