P62 · A sampling design uniform in every pair of columns · Discussion

P62 · d = 6, n = 32 · Solver note / 求解记录

邱仲普

P62 d=6, n=32:改进最差二维投影 L2-star discrepancy。未证明最优。 从公开纪录开始,依次试探单坐标 ±1、±2、±10、±100、±1000 个网格单位,最多 3 轮、30 秒,只接受完整整数目标严格下降。 确定性复现:下面是完整整数矩阵 X,S=10^9。对每项 v 用 Python f"{v//S}.{v%S:09d}" 转为九位小数字符串,按原行列顺序组成 {"points":转换后的矩阵};无需重新搜索。 [[963178747,115603613,963926999,969335166,965277471,844673453],[459505595,195486255,280484265,458996212,211255095,338204915],[762976783,747214085,434800531,498292668,724793661,238260217],[570402499,559580415,529299236,611308490,307176517,20808899],[946266647,955909487,365252047,948284927,246593388,587342236],[156983301,389012596,395188195,23548220,626457150,170011768],[215092650,654375408,462311871,875708324,943196055,537902210],[426665220,881713076,563417959,108077112,463178673,757760651],[246308848,485831645,315681792,301437136,405564264,872126778],[664769415,426948328,850057434,426086988,662684769,617406105],[118336188,24088385,216310278,649823500,497146110,481709848],[866829586,682886578,930740191,330130193,369876177,513501407],[494422142,622325939,755664864,687091221,533461234,301656254],[188241629,775761062,719966925,394833720,177768553,821628987],[347015063,351000409,616512600,570895521,21182606,441422164],[369214088,940775318,944770969,934743497,886943069,936636153],[892215834,134178449,585985310,776279119,595384636,955694098],[828546628,454775701,85560156,841077456,146773288,270671804],[390165722,96488795,120743008,364717201,765329038,55344025],[312418751,712168061,155201581,803687232,691973127,644630584],[602444733,321426387,346912894,716470916,837153352,791900723],[976635060,976707664,976339501,553519865,973958430,977591879],[798312076,228611505,783953237,84250058,869605097,567396736],[730135805,598146595,180637334,57784668,54473563,912353637],[915554280,914341624,245453716,275283301,915352547,115308193],[21851226,523200951,653341633,210529546,803553607,372358233],[53117595,260394482,50475000,529540060,341058174,723523252],[534563248,57572493,488861512,242105503,114166029,677659321],[85257545,848062065,823281023,750878220,81108025,88750714],[280625845,152340264,890837660,142040782,265569974,212019136],[630861137,812099411,22070315,175285192,564470806,410720097],[699425306,285966603,692223063,904050250,431784803,133182907]] 验证:恰好 n 行、每行 d 列,所有 X 在 [0,S],允许重复行。对每对列 a<b,令 u_i=X[i,a]、v_i=X[i,b],计算整数 T_ab=2n²S⁴−9nΣ_i(S²−u_i²)(S²−v_i²)+18S²Σ_{i,j}(S−max(u_i,u_j))(S−max(v_i,v_j))。 存储分数为 max_ab T_ab,即 18n²S⁴ 乘最差投影的 L2-star discrepancy 平方,越小越好。已逐一用整数式和独立有理数积分公式核对所有投影。原存储分数 4243786341258079072340628282048104384;新存储分数 4243786331020192480062356622528562688。