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 decompositions of link complements into bipyramids.
Generalizes braid theory to multi-crossing braids.
The study improves inequalities for link diagrams and introduces weak rectangular diagrams.
Legendrian knots can be represented by projections with multi-crossings.
An increasing sequence of integers is said to be universal for knots if every knot has a reduced regular projection on the sphere such that the number of edges of each complementary face of the projection comes from the given sequence. Adams, Shinjo, and Tanaka have, in a work, shown that (2,4,5) and (3,4,n) (where n i…
A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound on the span of the bracket polynomial of K as 4c_2(K), to the n-crossing number:…
GCAPS-CNN improves GCNNs for graph classification.
Introduced recently, an n-crossing is a singular point in a projection of a link at which n strands cross such that each strand travels straight through the crossing. We introduce the notion of an übercrossing projection, a knot projection with a single n-crossing. Such a projection is necessarily composed of a collect…
The paper finds petal numbers of torus knots using superbridge indices.
New proof confirms petal number for torus knots without modular condition.