Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Represent intermediate feature maps on a periodic rectangular grid and regularize each individual Fourier eigenspace so that its spatial energy cannot collapse almost entirely outside a chosen observation region. The target lower bound is derived from the paper's quantitative rectangular estimate and is applied only to narrow Fourier shells, where the feature map is analogous to a degenerate Laplacian eigenfunction.
Add a two-output anti-collapse regularizer based on the determinant of the Jacobian Gram matrix, together with a penalty against proportional highest-degree coefficient tensors. The paper's inequality predicts that preserving coefficient non-proportionality prevents the output distribution from concentrating on thin curves or tiny regions, potentially improving coverage of a two-dimensional latent or generative output.
Add a structured boundary-like operation to an MoE router that rapidly mixes expert probabilities toward a learned distribution while preserving predefined expert groups. The operation is a rank-one stochastic kernel, so it costs linear rather than quadratic work in the number of experts and can act as a controlled reset when routing becomes concentrated.
Exploit the paper's nested obstruction hierarchy by applying cheap low-order Hankel tests to every example and evaluating larger matrices only for outputs near the current feasibility boundary. This turns higher-order structural validation into an adaptive curriculum rather than an always-on expensive eigendecomposition.