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 method connects neural networks to diagrammatic algebra.
3D gauge theories link knot polynomials to vortex partition functions.
In CJKLS quandle cohomology is used to produce invariants for particular embeddings of codimension two; 2-cocycles give to invariants for (classical) knots and 3-cocycles give rise to invariants for knotted surfaces. This is done by way of a notion of coloring of a diagram. Also, these invariants have the form of state…
Paper proves link diagrams can be realized for some but not all types of links.
We prove that the HOMFLYPT polynomial of a link, colored by partitions with a fixed number of rows is a -holonomic function. Specializing to the case of knots colored by a partition with a single row, it proves the existence of an super-polynomial of knots in 3-space, as was conjectured by string theorists. …
We study the geometry of deep (neural) networks (DNs) with piecewise affine and convex nonlinearities. The layers of such DNs have been shown to be {\em max-affine spline operators} (MASOs) that partition their input space and apply a region-dependent affine mapping to their input to produce their output. We demonstrat…
We show that every trivial 3-strand braid diagram contains a disk, defined as a ribbon ending in opposed crossings. Under a convenient algebraic form, the result extends to every Artin--Tits group of dihedral type, but it fails to extend to braids with 4 strands and more. The proof uses a partition of the Cayley graph …
Separable Bregman divergences induce Riemannian metric spaces that are isometric to the Euclidean space after monotone embeddings. We investigate fixed rate quantization and its codebook Voronoi diagrams, and report on experimental performances of partition-based, hierarchical, and soft clustering algorithms with respe…
Many applications in data analysis begin with a set of points in a Euclidean space that is partitioned into clusters. Common tasks then are to devise a classifier deciding which of the clusters a new point is associated to, finding outliers with respect to the clusters, or identifying the type of clustering used for th…
We introduce and study the Hermitian matrix model with potential V(x)=x^2/2-stx/(1-tx), which enumerates the number of linear chord diagrams of fixed genus with specified numbers of backbones generated by s and chords generated by t. For the one-cut solution, the partition function, correlators and free energies are co…
Regarding the Specht modules associated to the two-row partition , we provide a combinatorial path model to study the transitioning matrix from the tableau basis to the -web basis (i.e. cup diagrams), and prove that the entries in this matrix are positive in the upper-triangular portion with respect to a ce…
Flattenings of knotted surfaces help define new invariants.
Constructs a spectrum for knot Floer homology without holomorphic geometry.
It is well a known and fundamental result that the Jones polynomial can be expressed as Potts and vertex partition functions of signed plane graphs. Here we consider constructions of the Jones polynomial as state models of unsigned graphs and show that the Jones polynomial of any link can be expressed as a vertex model…
In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily modified to handle graphs with weighted vertices. We present formulas that simp…
New basis for permutation equivariant layers reduces computation costs.
Biracks are algebraic structures related to knots and links. We define a new enhancement of the birack counting invariant for oriented classical and virtual knots and links via algebraic structures called birack dynamical cocycles. The new invariants can also be understood in terms of partitions of the set of birack la…
We show that the link invariants derived from 3-dimensional quantum hyperbolic geometry can be defined by means of planar state sums based on link diagrams and a new family of enhanced Yang-Baxteroperators (YBO) that we compute explicitly. By a local comparison of the respective YBO's we show that these invariants coin…
A meander of order n is a simple closed curve in the plane which intersects a horizontal line transversely at 2n points. (Meanders which differ by an isotopy of the line and plane are considered equivalent.) Let Gamma_n be the Cayley graph of the symmetric group S_n as generated by all (n choose 2) transpositions. Let …
The paper finds and visualizes unique geometric polyhedra and tori with few vertices.
New algebra defined for Legendrian submanifolds, preserving key invariants.
We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its segment number is at least 3. Furthermore, we investigate the structural properties…
New geometric object for polynomials simplifies complex data.
The meridian maps of the full Homfly skein of the annulus are linear endomorphisms induced by the insertion of a meridian loop, with either orientation, around a diagram in the annulus. The eigenvalues of the meridian maps are known to be distinct, and are indexed by pairs of partitions of integers p and n into k and k…
The paper refines transformations of lattice diagrams and introduces dotted diagrams.
This note explains how to transform Heegaard diagrams into framed link diagrams.
New minimal link diagrams found, including torus links and homogeneous ones.
Algorithm converts Kirby diagrams to trisection diagrams for 4-manifolds.
Kernelized Taylor diagram visualizes data populations with fewer assumptions.
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a virtual link diagram to a normal virtual link diagram by use of the double covering …
Study categorizes knots and links as rigid or shaky based on Reidemeister moves.
Twisted graph diagrams are virtual graph diagrams with bars on edges. A bijection between abstract graph diagrams and twisted graph diagrams is constructed. Then a polynomial invariant of Yamada-type is developed which provides a lower bound for the virtual crossing number of virtual graph diagrams.
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…
The study limits how many parts regular simplicial partitions can overlap.
Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams in machine learning have been done through kernel methods, i.e., embeddings of …
Problems on region choices for knot and link diagrams solved using Alexander numbering.
Table of symmetric diagrams for knots up to 10 crossings.
The presence of slipknots in configurations of proteins and DNA has been shown to affect their functionality, or alter it entirely. Historically, polymers are modeled as polygonal chains in space. As an alternative to space curves, we provide a framework for working with subknots inside of knot diagrams via knotoid dia…
Proves minimal crossing diagrams for specific spatial graphs.
Hypergraph partitioning lies at the heart of a number of problems in machine learning and network sciences. Many algorithms for hypergraph partitioning have been proposed that extend standard approaches for graph partitioning to the case of hypergraphs. However, theoretical aspects of such methods have seldom received …
Rectangular diagrams help analyze foliations in 3-sphere.
Bankwitz characterized an alternating diagram representing the trivial knot. A non-alternating diagram is called almost alternating if one crossing change makes the diagram alternating. We characterize an almost alternaing diagram representing the trivial knot. As a corollary we determine an unknotting number one alter…
The paper explores when specific knot operations simplify diagrams.
Gauss diagrams' properties can change with Hamiltonian cycle choice.
New estimate of semimeander complexity for knots with more than 10 crossings.
GridPyM handles grid diagrams for knot theory.
There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedd…
The study improves inequalities for link diagrams and introduces weak rectangular diagrams.