Research
On-device research index

arXiv research

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.

168,657 papers · 148 categories

Trend · papers per month

55109164218 · Jun 202019922001200920172026
48 results for string similarity

We give a brief overview of the theory of complex dimensions of real (archimedean) fractal strings via an illustrative example, the ordinary Cantor string, and a detailed survey of the theory of p-adic (nonarchimedean) fractal strings and their complex dimensions. Moreover, we present an explicit volume formula for the…

2011-05-15abs ↗pdf ↗

In this paper, we give a complete set of finite type string link invariants of degree <5. In addition to Milnor invariants, these include several string link invariants constructed by evaluating knot invariants on certain closure of (cabled) string links. We show that finite type invariants classify string links up to …

2009-04-09abs ↗pdf ↗

A virtual nn-string is a chord diagram with nn core circles and a collection of arrows between core circles. We consider virtual nn-strings up to virtual homotopy, compositions of flat virtual Reidemeister moves on chord diagrams. Given a virtual 1-string αα, Turaev associated a based matrix that encodes invariants…

2017-09-02abs ↗pdf ↗

We extend knot Floer homology to string links in D^{2} \times I and to d-based links in arbitrary three manifolds, without any hypothesis on the null-homology of the components. As for knot Floer homology we obtain a description of the Euler characteristic of the resulting homology groups (in D^{2} \times I) in terms o…

2006-07-10abs ↗pdf ↗

We explore the use of random forest and gradient boosting, two powerful tree-based machine learning algorithms, for the detection of cosmic strings in maps of the cosmic microwave background (CMB), through their unique Gott-Kaiser-Stebbins effect on the temperature anisotropies.The information in the maps is compressed…

2018-01-12abs ↗pdf ↗

Recently, randomly mapping vectorial data to strings of discrete symbols (i.e., sketches) for fast and space-efficient similarity searches has become popular. Such random mapping is called similarity-preserving hashing and approximates a similarity metric by using the Hamming distance. Although many efficient similarit…

2019-10-18abs ↗pdf ↗

In these lecture notes we discuss a body of work in which Morse theory is used to construct various homology and cohomology operations. In the classical setting of algebraic topology this is done by constructing a moduli space of graph flows, using homotopy theoretic methods to construct a virtual fundamental class, an…

2004-11-11abs ↗pdf ↗

Statistical models usually require vector representations of categorical variables, using for instance one-hot encoding. This strategy breaks down when the number of categories grows, as it creates high-dimensional feature vectors. Additionally, for string entries, one-hot encoding does not capture information in their…

2019-07-03abs ↗pdf ↗

Machine learning improves invoice matching speed and accuracy.

problem Efficiently matching similar invoices from various businesses and organizations.
method Combining machine learning with string similarity functions on invoice datasets.
result Neural network and boosted decision tree outperformed existing solutions.

New research shows larger language models improve data processing for diverse entries.

problem Optimizing data processing for tables with diverse string entries.
method Analytical tasks on tables with varying language model sizes and a fuzzy join benchmark.
result Larger language models improve data processing for diverse entries, but fine-tuning is necessary.

Synthetic reference strings are as effective as real ones for training citation parsing models.

problem Lack of training data for citation parsing, especially with deep neural networks.
method Trained Grobid with human-labelled and synthetically created reference strings, and evaluated retraining and out-of-sample data impact.
result Synthetic and real reference strings are equally effective for training Grobid, with retraining improving performance.

We propose a formulation of the term structure of interest rates in which the forward curve is seen as the deformation of a string. We derive the general condition that the partial differential equations governing the motion of such string must obey in order to account for the condition of absence of arbitrage opportun…

1998-02-12abs ↗pdf ↗

String structures have played an important role in algebraic topology, via elliptic genera and elliptic cohomology, in differential geometry, via the study of higher geometric structures, and in physics, via partition functions. We extend the description of String structures from connected covers of the definite-signat…

2015-04-08abs ↗pdf ↗

Inverse braid monoid describes a structure on braids where the number of strings is not fixed. So, some strings of initial nn may be deleted. In the paper we show that many properties and objects based on braid groups may be extended to the inverse braid monoids. Namely we prove an inclusion into a monoid of partial m…

2007-04-23abs ↗pdf ↗

New theory connects string theory to swampland distance conjecture.

problem Connecting string theory to swampland distance conjecture.
method Deformations of the heterotic superpotential, treating separately for large fluxes or large distances, integrating out fields to obtain a new field theory.
result New holomorphic theory defined, connects to swampland distance conjecture.

Derives path integrals for perturbative strings on various backgrounds.

problem Calculating path integrals for strings on curved backgrounds.
method Derives path integrals from string geometry theory by considering fluctuations around string backgrounds.
result Derives path integrals of all order perturbative strings on various backgrounds.

The crucial importance of metrics in machine learning algorithms has led to an increasing interest in optimizing distance and similarity functions, an area of research known as metric learning. When data consist of feature vectors, a large body of work has focused on learning a Mahalanobis distance. Less work has been …

2013-07-17abs ↗pdf ↗

Derives path-integrals for superstrings on curved backgrounds using string geometry theory.

problem Calculating path-integrals for superstrings on curved backgrounds.
method Derives path-integrals from string geometry theory by considering fluctuations around string backgrounds.
result Derives path-integrals for perturbative superstrings on all string backgrounds.

Chiral string integrands simplify to ambitwistor string integrands in the tensionless limit.

problem Understanding the relationship between chiral and ambitwistor string integrands.
method Analyzing the tensionless limit of chiral superstring integrands.
result Chiral superstring integrands reduce to ambitwistor string integrands in the tensionless limit.

Perturbative string amplitudes are correctly derived from the string geometry theory, which is one of the candidates of a non-perturbative formulation of string theory. In order to derive non-perturbative effects rather easily, we formulate topological string geometry theory. We derive the perturbative partition functi…

2019-03-14abs ↗pdf ↗

Machine learning refactors knowledge to improve learning efficiency.

problem Inductive program synthesis efficiency through knowledge restructuring.
method Introduces Knorf, a system that refactors knowledge bases using constraint optimization.
result Learning from refactored knowledge improves predictive accuracy fourfold and reduces learning time by half.

A virtual string is a scheme of self-intersections of a closed curve on a surface. We study algebraic invariants of strings as well as two equivalence relations on the set of strings: homotopy and cobordism. We show that the homotopy invariants of strings form an infinite dimensional Lie group. We also discuss connecti…

2003-11-12abs ↗pdf ↗

A virtual string can be defined as an equivalence class of planar diagrams under certain kinds of diagrammatic moves. Virtual strings are related to virtual knots in that a simple operation on a virtual knot diagram produces a diagram for a virtual string. In this paper we consider three operations on a virtual string …

2008-08-04abs ↗pdf ↗

The second author previously discussed how classical complexity separation conjectures, we call them "axioms", have implications in three manifold topology: polynomial length stings of operations which preserve certain Jones polynomial evaluations cannot produce exponential simplifications of link diagrams. In this pap…

2013-05-26abs ↗pdf ↗

Extended Alexander groups are used to define an invariant for open virtual strings. Examples of non-commuting open strings and a ribbon-concordance obstruction are given. An example is given of a slice virtual open string that is not ribbon. Definitions are extended to open n-strings.

2004-09-10abs ↗pdf ↗

We present a finite-dimensional and smooth formulation of string structures on spin bundles. It uses trivializations of the Chern-Simons 2-gerbe associated to this bundle. Our formulation is particularly suitable to deal with string connections: it enables us to prove that every string structure admits a string connect…

2009-05-30abs ↗pdf ↗

Cobordism of virtual string links on nn strands is a combinatorial generalization of link cobordism. There exists a bijection between virtual string links up to cobordisms and elements of the group Zn(n1)\mathbb{Z}^{n(n-1)}. This paper also shows that virtual string links up to unwelded equivalence are classified by those…

2019-02-24abs ↗pdf ↗

A virtual string is a scheme of self-intersections of a closed curve on a surface. We introduce virtual strings and study their geometric properties and homotopy invariants. We also discuss connections between virtual strings, Gauss words, and virtual knots.

2003-10-15abs ↗pdf ↗

Study topological G₂ and Spin(7) strings at 1-loop using double complexes.

problem Calculate topological string partition functions at 1-loop.
method Define double complexes for supersymmetric backgrounds using generalised geometry, compute partition functions as alternating products of determinants of Laplacians.
result Reproduce known results for G₂ string and predict for Spin(7) string.