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.
New bounds improve linkage methods for clustering, distinguishing complete-link from single-link.
We give a simple and practical algorithm to compute the link polynomials, which are defined according to the skein relations. Our method is based on a new total order on the set of all braid representatives. As by-product a new complete link invariant are obtained.
The reduced peripheral system was introduced by Milnor in the fifties for the study of links up to link-homotopy, i.e. up to isotopies and crossing changes within each link component. However, for four or more components, this invariant does not yield a complete link-homotopy invariant. This paper provides two characte…
Given a link map f into a manifold of the form Q = N \times \Bbb R, when can it be deformed to an unlinked position (in some sense, e.g. where its components map to disjoint \Bbb R-levels) ? Using the language of normal bordism theory as well as the path space approach of Hatcher and Quinn we define obstructions \widet…
New theory classifies knotted spheres in 4D space.
New sampling technique improves KGC model performance.