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.
Study on symmetry defects of complete intersections in complex space.
Characterizes intrinsic Lorentzian spaces using midpoint properties.
The paper analyzes the randomized midpoint method for Langevin diffusions, revealing biases and asymptotic properties.
Solitons are special polygon midpoints under affine transformations.
We say that a pair of points x and y is secure if there exist a finite set of blocking points such that any geodesic between x and y passes through one of the blocking points. The main point of this paper is to exhibit new examples of blocking phenomena both in the manifold and the billiard table setting. As an approac…
Poisson Midpoint Method improves Langevin Dynamics for diffusion models.
The paper shows that knot projections without triple chords can be simplified.
Paper explores relationships between triple chords and a specific homotopy relation in knot theory.
Solves -Gaussian chord Minkowski problem using Gauss curvature flow.
A chord diagram consists of a circle, called the backbone, with line segments, called chords, whose endpoints are attached to distinct points on the circle. The genus of a chord diagram is the genus of the orientable surface obtained by thickening the backbone to an annulus and attaching bands to the inner boundary cir…
We consider framed chord diagrams, i.e. chord diagrams with chords of two types. It is well known that chord diagrams modulo 4T-relations admit Hopf algebra structure, where the multiplication is given by any connected sum with respect to the orientation. But in the case of framed chord diagrams a natural way to define…
A chord index homomorphism for knots in thickened surfaces is constructed.
The paper finds at least N orthogonal Finsler geodesic chords in a disk-like manifold.
Paper solves a generalized chord Minkowski problem using Gauss curvature flows.
In this paper we study the chord index of virtual knots, which can be thought of as an extension of the chord parity. We show how to use the chord index to define finite type invariants of virtual knots. The notions of indexed Jones polynomial and indexed quandle are introduced, which generalize the classical Jones pol…
Enhances Vassiliev knot invariants using chord diagrams.
Study counts sub-chord diagrams to classify spherical curves.
To any generic curve in an oriented surface there corresponds an oriented chord diagram, and any oriented chord diagram may be realized by a curve in some oriented surface. The genus of an oriented chord diagram is the minimal genus of an oriented surface in which it may be realized. Let g_n denote the expected genus o…
In view of the result of Kontsevich, now often called ``the fundamental theorem of Vassiliev theory'', identifying the graded dual of the associated graded vector space to the space of Vassiliev invariants filtered by degree with the linear span of chord diagrams modulo the ``4T-relation'' (and in the unframed case, th…
We propose a novel approach for the generation of polyphonic music based on LSTMs. We generate music in two steps. First, a chord LSTM predicts a chord progression based on a chord embedding. A second LSTM then generates polyphonic music from the predicted chord progression. The generated music sounds pleasing and harm…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which can be represented as closed 3-braids. Partial results are obtained about spann…
Paper develops invariants for spherical curves using chord diagrams.
The study finds at least two short, simple geodesic chords on a disk with convex boundary.
Vassiliev invariants can be studied by studying the spaces of chord diagrams associated with singular knots. To these chord diagrams are associated the intersection graphs of the chords. We extend results of Chmutov, Duzhin and Lando to show that these graphs determine the chord diagram if the graph has at most one loo…
The paper calculates a specific weight system for chord diagrams with a particular graph structure.
We introduce a new geometric flow called the chord shortening flow which is the negative gradient flow for the length functional on the space of chords with end points lying on a fixed submanifold in Euclidean space. As an application, we give a simplified proof of a classical theorem of Lusternik and Schnirelmann (and…
The study estimates Reeb chords using sheaf theory and persistence.
The paper finds an upper limit for the length of geodesic chords on Riemannian manifolds.
We present a new approach to harmonic analysis that is trained to segment music into a sequence of chord spans tagged with chord labels. Formulated as a semi-Markov Conditional Random Field (semi-CRF), this joint segmentation and labeling approach enables the use of a rich set of segment-level features, such as segment…
For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a sub-chord diagram. For any generic immersion of the complete graph on six vertices to t…
Proves Arnol'd's chord conjecture for conormal bundles.
Invariant detects sliceness of virtual knots with specific chord indices.
The paper develops methods for sampling from log-concave distributions with constraints.
The study proves geodesic loops and chords without intersections for specific metrics.
Study on curve shortening flow with boundary conditions, proving convergence or contraction.
The paper defines functions from spherical curves and chord diagrams, proving invariance under specific Reidemeister moves.
Complete invariant defined for doodles on a sphere.
In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases these trees determine the chord diagram (modulo the usual 1-term and 4-term rela…
Paper shows how to represent Milnor's triple linking number using chord diagrams and doodle invariants.
The paper defines new homotopy relations on knot projections and classifies certain knot types.
Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general graphs have not been studied, and are potentially equally valuable in the study…
One of the most fundamental concepts in statistics is the concept of sample mean. Properties of the sample mean that are well-defined in Euclidean spaces become unwieldy or even unclear in graph spaces. Open problems related to the sample mean of graphs include: non-existence, non-uniqueness, statistical inconsistency,…
Loops in surfaces and chord diagrams are studied with graph factorizations and grammars.
In this article, we prove that there exists at least one chord which is characteristic of Reeb vector field connecting a given Legendre submanifold in a closed contact manifold with any contact form.
We prove a chord arc bound for disks embedded in with constant mean curvature. This bound does not depend on the value of the mean curvature. It is inspired by and generalizes the work of Colding and Minicozzi in [2] for embedded minimal disks. Like in the minimal case, this chord arc bound is a fundamen…
By adding or removing appropriate structures to Gauss diagram, one can create useful objects related to virtual links. In this paper few objects of this kind are studied: twisted virtual links generalizing virtual links; signed chord diagrams staying halfway between twisted virtual links and Kauffman bracket / Khovanov…
We conduct a large-scale study of language models for chord prediction. Specifically, we compare N-gram models to various flavours of recurrent neural networks on a comprehensive dataset comprising all publicly available datasets of annotated chords known to us. This large amount of data allows us to systematically exp…
New sampling method improves efficiency for diffusion models.