We provide a deterministic polynomial-time list decoding algorithm for Reed-Solomon codes over prime fields that approaches list decoding capacity on every evaluation set in the low (constant) rate regime.

more >>>

This work studies super-Ramanujan graphs: \(d\)-regular graphs whose spectral expansion lies strictly below the Ramanujan threshold \(2\sqrt{d-1}\). Although this threshold is asymptotically optimal for fixed \(d\) as \(n\) tends to infinity, it leaves open the finer question of how small the spectral expansion can be as a joint function of ... more >>>

The recent paper \cite{chatterjee2026bipartite} showed that deciding whether a bipartite graph has a perfect matching can be reduced to deciding whether a determinant, whose value may be assigned to any sufficiently large field $\mathbb{F}$, equals to zero. In the second part of their work, \cite{chatterjee2026bipartite} also generalized the algebraic method ... more >>>