Wiki
Wiki

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

(r2,r3,r5)=(2,1,0),(e2,e3,e5)=(.31,.36,.31).(r_2,r_3,r_5)=(2,1,0),\qquad (e_2,e_3,e_5)=(.31,.36,.31).

Its row capacities are α=(.31,.36,.31,1,1,1)\alpha=(.31,.36,.31,1,1,1).

Proposition. If a nonzero polynomial F∈C[X,Y]F\in\mathbf C[X,Y] has multiplicity at least mrm_r at every nonnegative integer point on row X+Y=rX+Y=r, 0≤r≤50\le r\le5, then

deg⁡F≥31100m0+925m1+31100m2+m3+m4+m5.(1)\boxed{\deg F\ge \frac{31}{100}m_0+\frac9{25}m_1+\frac{31}{100}m_2+m_3+m_4+m_5.}\tag{1}

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 Δ6={(x,y)∈Z≥02:x+y≤5}\Delta_6=\{(x,y)\in\mathbf Z_{\ge0}^2:x+y\le5\}. Give these points weights wx,yw_{x,y} using the following numerators, all divided by 1600016000. Within row rr, the entries are ordered by x=0,…,rx=0,\ldots,r.

RowWeight numerators
049604960
12880,28802880,2880
21121,2718,11211121,2718,1121
33635,4365,4365,36353635,4365,4365,3635
43404,2283,4626,2283,34043404,2283,4626,2283,3404
50,3754,4246,4246,3754,00,3754,4246,4246,3754,0

Their row sums are exactly αr\alpha_r. Give the following lines coefficients λL\lambda_L with the same denominator 1600016000.

LinesNumerator for each line
X=0X=0, Y=0Y=02480
X=1X=1, Y=1Y=11359
X=2X=2, Y=2Y=21851
X+Y=3X+Y=31155
X+Y=4X+Y=4924
X+Y=5X+Y=52395

The exact incidence inequalities are

wP≤∑L∋PλL,∑LλL=79278000<1.(2)w_P\le\sum_{L\ni P}\lambda_L,\qquad \sum_L\lambda_L=\frac{7927}{8000}<1.\tag{2}

Every covering line itself has weighted incidence at most one: X=2X=2 and Y=2Y=2 have incidence 7179/80007179/8000, and the other seven have incidence one.

For an irreducible curve CC different from these nine lines, Bézout gives

∑P∈C∩L∩Δ6mult⁡PC≤deg⁡C\sum_{P\in C\cap L\cap\Delta_6}\operatorname{mult}_P C\le\deg C

for every covering line. Multiplying by λL\lambda_L, summing, and using (2) proves

∑P∈Δ6wPmult⁡PC≤79278000deg⁡C<deg⁡C.\sum_{P\in\Delta_6}w_P\operatorname{mult}_P C \le\frac{7927}{8000}\deg C<\deg C.

The covering lines satisfy the non-strict bound separately. Since multiplicities and degrees add under factorization, every nonzero polynomial consequently satisfies

∑P∈Δ6wPord⁡PF≤deg⁡F.(3)\sum_{P\in\Delta_6}w_P\operatorname{ord}_P F\le\deg F.\tag{3}

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.