<?xml version="1.0" encoding="utf-8"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title>Paper Spotlight · Math Referee</title><link>https://mathreferee.dimensionreducers.ai/spotlight/</link><description>Mathematical ideas, proof insights and the evidence behind our reviews.</description><language>en</language><atom:link href="https://mathreferee.dimensionreducers.ai/spotlight/feed.xml" rel="self" type="application/rss+xml" /><item><title>FI-modules: when eventually is not always</title><link>https://mathreferee.dimensionreducers.ai/spotlight/when-eventually-is-not-always/</link><description>Specific all-size claims fail in the CEF paper. Counterexamples, exact computations and separately checked repairs show what must change and what survives.</description><pubDate>Fri, 20 Nov 2026 00:00:00 GMT</pubDate><guid isPermaLink="true">https://mathreferee.dimensionreducers.ai/spotlight/when-eventually-is-not-always/</guid></item><item><title>Knot genus: a proof gap and a checked repair</title><link>https://mathreferee.dimensionreducers.ai/spotlight/knot-genus-proof-repair/</link><description>A 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.</description><pubDate>Fri, 20 Nov 2026 00:00:00 GMT</pubDate><guid isPermaLink="true">https://mathreferee.dimensionreducers.ai/spotlight/knot-genus-proof-repair/</guid></item><item><title>How many shortest paths can a graph have?</title><link>https://mathreferee.dimensionreducers.ai/spotlight/how-many-shortest-paths/</link><description>90 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.</description><pubDate>Thu, 19 Nov 2026 00:00:00 GMT</pubDate><guid isPermaLink="true">https://mathreferee.dimensionreducers.ai/spotlight/how-many-shortest-paths/</guid></item><item><title>How sparse can a signal and its Fourier transform be?</title><link>https://mathreferee.dimensionreducers.ai/spotlight/how-sparse-can-a-signal-be/</link><description>Tao’s prime-order uncertainty principle turns a question about exact zeros into a sharp theorem. Seven positions are enough to see what it means.</description><pubDate>Wed, 18 Nov 2026 00:00:00 GMT</pubDate><guid isPermaLink="true">https://mathreferee.dimensionreducers.ai/spotlight/how-sparse-can-a-signal-be/</guid></item></channel></rss>
