A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Paper constructs graphs with girth four and distinct properties.
New spectral conditions ensure graph rigidity and global rigidity in the Euclidean plane.
Approximates cycles in planar and bounded-genus graphs.
A graph (digraph) with a set of terminals is called inner Eulerian if each nonterminal node has even degree (resp. the numbers of edges entering and leaving are equal). Cherkassky and Lovász showed that the maximum number of pairwise edge-disjoint -paths in an inner Eulerian graph $G…
New matrix completion method for arbitrary sampling patterns using network flows.
Extends angular synchronization to heterogeneous groups, improving accuracy in multiple applications.
We extend the edge version of the classical Menger's Theorem for undirected graphs to -dimensional simplicial complexes with chains over the field . The classical Menger's Theorem states that two different vertices in an undirected graph can be connected by pairwise edge-disjoint paths if, and only…