FI-modules: when eventually is not always
Specific all-size claims fail in the CEF paper. Counterexamples, exact computations and separately checked repairs show what must change and what survives.
Read the articleAn interesting paper. A revealing argument. A closer look.
Our weekly series explores ideas from the review archive, with worked examples, proof insights and links to the evidence. Each article distinguishes the mathematics from what our review has checked.
Follow the RSS feedSpecific all-size claims fail in the CEF paper. Counterexamples, exact computations and separately checked repairs show what must change and what survives.
Read the articleA compressed algorithm connects knot genus to NP. Explicit counterexamples expose a gap in its running-time proof; a separately audited schedule repairs the unweighted component counter.
Read the article90 paths, 42 paths, or 30: the answer changes with the geometry. A shorter proof leads to sharper questions—and a separate audit of the proposed improvements.
Read the articleTao’s prime-order uncertainty principle turns a question about exact zeros into a sharp theorem. Seven positions are enough to see what it means.
Read the article