Research ideas

Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.

2 ideas found

Status: Mechanism works Solves: Scalability Math: Linear algebra Clear all

✓ Mechanism works 2026

Path-complete stable routed SSM

Replace a single shared quadratic stability constraint in a routed state-space model with a path-complete family of quadratic certificates indexed by a small graph. During architecture search or training, identify bottleneck certificate nodes whose transition inequalities are nearly tight, split only those nodes, and re-solve the certificate problem. This should permit larger per-mode state transitions than a common Lyapunov matrix while retaining bounded hidden-state dynamics for arbitrary…

Useful7/10

Difficulty6/10

Novelty7/10

Dynamics Stability Scalability Ssm

Paper: Iterative graph lifting for automatic design of path-complete stability certificates arXiv:2607.00637

✓ Mechanism works 2026

Dirichlet-to-Neumann Graph Pooling

Replace a large graph submodule by a compact boundary response operator that maps boundary node features to induced boundary fluxes after the interior has been eliminated. Stack these operators recursively to obtain a hierarchical graph neural network whose coarse-level computation preserves long-range effects of discarded vertices more faithfully than average pooling or simple node clustering.

Useful7/10

Difficulty6/10

Novelty6/10

Architecture Memory Scalability Accuracy

Paper: Gluing Formula for the Pseudo-Determinant of Graph Laplacian and Applications to Counting of Spanning Trees arXiv:2608.26458