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.

169,051 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Jan 199419922001200920172026
48 results for string vertices

We derive a recursion relation for hyperbolic string vertices and apply it to string field theory.

problem Deriving a recursion relation for hyperbolic string vertices and its implications for string field theory.
method Using systolic volumes and a modified Mirzakhani's recursion, we construct a higher-order vertex determination for hyperbolic string field theory.
result The higher order vertices in hyperbolic string field theory are determined by the cubic vertex iteratively for any background.

Study knot diagrams on a sphere without vertical lines, focusing on minimal crossings.

problem Understanding minimal crossings of knot diagrams on a punctured sphere.
method Mathematical model of string figures using knot diagrams on xyzxyz-space with missing vertical lines, analyzing minimal crossings under Reidemeister moves.
result Minimal number of crossings of knot diagrams on a punctured sphere.

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 ↗

The recently suggested tangle calculus for knot polynomials is intimately related to topological string considerations and can help to build the HOMFLY-PT invariants from the topological vertices. We discuss this interplay in the simplest example of the Hopf link and link L8n8L_{8n8}. It turns out that the resolved conif…

2018-06-04abs ↗pdf ↗

The aim of this paper is to open the problem of construction of a nonlinear connection Γ=(M(α)β(i),N(α)j(i))Γ=(M^{(i)}_{(α)β}, N^{(i)}_{(α)j}) on the jet bundle of first order J1(T,M)J^1(T,M), which to be canonically produced by a Kronecker product vertical metrical d-tensor G(i)(j)(α)(β)=hαβgijG^{(α)(β)}_{(i)(j)}=h^{αβ}g_{ij}, possibly provided by multi-time …

2001-11-14abs ↗pdf ↗

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.

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.

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 ↗

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 ↗

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 ↗

GENs model generates sparse graphs from text-based inputs, achieving high validity.

problem Efficiently modeling and generating sparse graphs with unique and valid structures.
method RNN-based GENs model trained with an examination mechanism to predict graph characters.
result Moderate to high validity achieved in LGI strings for sparse graph generation.

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.

In this note we revisit the subject of anomaly cancelation in string theory and M-theory on manifolds with String structure and give three observations. First, that on String manifolds there is no E8 x E8 global anomaly in heterotic string theory. Second, that the description of the anomaly in the phase of the M-theory…

2008-07-30abs ↗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 ↗

End-to-end solution for recognizing handwritten numerals, avoiding traditional preprocessing steps.

problem Handwritten numeral string recognition with traditional preprocessing steps.
method YoLo-based model for automatic detection and recognition, avoiding heuristic-based preprocessing and segmentation.
result Proposed method reduces complexity and is a feasible end-to-end solution for numeral string recognition.

A virtual nn-string αα is a collection of nn oriented smooth generic loops on a surface MM. A stabilization of αα is a surgery that results in attaching a handle to MM along disks avoiding αα, and the inverse operation is a destabilization of αα. We consider virtual nn-strings up to virtual homotopy, i.e., seq…

2017-09-05abs ↗pdf ↗

Motivated by generalized geometry, we discuss differential geometric structures on the total space TM\mathfrak{T}M of the bundle TMTMTM\oplus T^*M, where MM is a differentiable manifold; TM\mathfrak{T}M is called a big-tangent manifold. The vertical leaves of the bundle are para-Hermitian vector spaces. The big-tangent …

2013-03-04abs ↗pdf ↗

The multi dimensional string objects are introduced as a new alternative for an application of string models for time series forecasting in trading on financial markets. The objects are represented by open string with 2-endpoints and D2-brane, which are continuous enhancement of 1-endpoint open string model. We show ho…

2016-07-18abs ↗pdf ↗

STRING improves 2D and 3D position encodings for better performance.

problem Efficient and accurate position encoding for 2D and 3D applications.
method STRING extends Rotary Position Encodings with a unifying theoretical framework, maintaining translation invariance and low computational cost.
result STRING shows substantial gains in open-vocabulary object detection and robotics.

New string kernels discover global properties through random feature maps, avoiding quadratic complexity.

problem Existing string kernels struggle with capturing long patterns, maintaining positive definiteness, and handling large datasets efficiently.
method Proposes a new class of global string kernels using random feature maps to discover global properties through global alignments, ensuring positive definiteness and linear computational cost.
result Random String Embeddings (RSE) achieve better or comparable accuracy to state-of-the-art methods, especially for longer strings.

In this paper we use 3-manifold techniques to illuminate the structure of the string link monoid. In particular, we give a prime decomposition theorem for string links on two components as well as give necessary conditions for string links to commute under the stacking operation.

2013-08-07abs ↗pdf ↗

Numbers and numerical vectors account for a large portion of data. However, recently the amount of string data generated has increased dramatically. Consequently, classifying string data is a common problem in many fields. The most widely used approach to this problem is to convert strings into numerical vectors using …

2014-06-03abs ↗pdf ↗

The Tong-Yang-Ma representations are extended to string links and welded string links.

problem Extending Tong-Yang-Ma representations to string links and welded string links.
method Using the method of Silver and Williams, the authors extend the Tong-Yang-Ma representations.
result The kernels of the extended representations can be described using linking numbers.

Analyzes string topology operations using Chen's integrals and homotopy transfer.

problem Relating string topology to perturbative Chern-Simons theory.
method Develops integrals over configuration spaces and applies homotopy transfer.
result Intertwines involutive Lie bialgebra structures on homology.

In this paper we compute the sharp lower bounds for the crossing number of nn-string kk-loop essential tangles. For essential tangles with only string components, we characterise the ones with the minimum crossing number for a given number of components, both when the tangle has knotted strings or only unknotted stri…

2015-05-27abs ↗pdf ↗

A virtual string can be defined as a closed curve on a surface modulo certain equivalence relations. Turaev defined several invariants of virtual strings which we use to produce a table of virtual strings up to 4 crossings. We discuss progress in extending the tabulation to 5 crossings. We also provide a counter-exampl…

2008-08-01abs ↗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 ↗

In this paper we investigate the virtual string links via a probabilistic interpretation. This representation can be used to distinguish some virtual string links from classical string links. In order to study the algebraic structure behind this probabilistic interpretation we introduce the notion of virtual flat biqua…

2015-01-21abs ↗pdf ↗

Study Stringc^c structures using algebraic topology and generalize Witten genera.

problem Understanding algebraic topology aspects of Stringc^c structures.
method Using Whitehead tower and loop group of Spinc(n)Spin^c(n), extend generalized Witten genera.
result Vanishing results for generalized Witten genera corresponding to Stringc^c structures.