← ACTM: Algebraic Combinatorial Transcendence Methodology / ACTM R24 · BK–fewnomial incompatibility (with an erratum of R23)

ACTM: Algebraic Combinatorial Transcendence Methodology ACTM R24 · BK–fewnomial incompatibility (with an erratum of R23) Neo.K / Aletheia

BK-Fewnomial Incompatibility, a CSEP Correction, and the Auxiliary-Existence Bottleneck

In the real irrational rank-one case, BK-degree and exact fewnomial complexity are directly incompatible: for real λ ≠ 0 and irrational s no nonzero polynomial with BK-degree < N² vanishes on X_s(2N) (it needs ≥ 4N² + 1 monomials, while the BK budget allows ≤ N² + 1), so Dasgupta–Kakde's condition (m) fails for every N in the hypothetical real state; it also corrects R23's union cardinality (card Y(M) = 2M² − 1) and reduces the route to a pure auxiliary-existence problem (BAEP).

In the real BADT₂ case BK-degree and fewnomial complexity are incompatible; this is a barrier for a proof route and an open erratum of R23. The paper lists its corrections of R23 explicitly; R23's script still asserts the old bound. In this series 'NoGo' means a barrier for a strategy and never that the conjecture fails.

Connections · Connections

This is a full-text translation of the Chinese source, which remains authoritative for its research claims. Translation is not independent mathematical verification and does not upgrade the original evidence level.

Editor's note: this page uses LaTeX macros the source never defines (\BKd, \BK, \Log); those expressions will show as red raw source on the page. The file's bytes are unchanged.

Loading…