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,695 papers · 148 categories

Trend · papers per month

4998146195 · Jun 202019922001200920172026
48 results for prime factors

Study grid homology of diagonal knots, finding key terms related to prime factors and decompositions.

problem Determine grid homology of diagonal knots and compare them to other knot types.
method Use grid diagrams and combinatorial knot Floer homology to analyze diagonal knots.
result Grid homology detects the number of prime factors and decompositions of the knot into non-integer tangles.

We present an enhanced prime decomposition theorem for knots that gives the isotopy classes of composite knots that can be constructed from a given list of prime factors (allowing for the mirroring and orientation reversing for each factor). Underlying the theorem is an algebraic construction that also allows for the c…

2014-11-10abs ↗pdf ↗

Homotopy on nanophrases is an equivalence relation defined using some data called a homotopy data triple. We define a product on homotopy data triples. We show that any homotopy data triple can be factorized into a product of prime homotopy data triples and this factorization is unique up to isomorphism and order. If a…

2009-10-28abs ↗pdf ↗

pPCA speeds up PCA by priming initial estimates for faster, more accurate results.

problem Improving the speed and accuracy of principal component analysis (PCA).
method pPCA is a two-step algorithm: first, an approximate-PCA method primes the data, then exact PCA is applied in the span of the initial estimate.
result pPCA improves accuracy significantly with a small computational cost, outperforming other methods across various datasets.

Templates are branched 2-manifolds with semi-flows used to model `chaotic' hyperbolic invariant sets of flows on 3-manifolds. Knotted orbits on a template correspond to those in the original flow. Birman and Williams conjectured that for any given template the number of prime factors of the knots realized would be boun…

2005-07-14abs ↗pdf ↗

We present new computations of tight shapes obtained using the constrained gradient descent code RIDGERUNNER for 544 composite knots with 12 and fewer crossings, expanding our dataset to 943 knots and links. We use the new data set to analyze two outstanding conjectures about tight knots, namely that the ropelengths of…

2011-10-14abs ↗pdf ↗

This research connects quantum spectra of flag bundles to prime factorization of integers.

problem Understanding the quantum spectra of flag bundles and their relation to prime numbers.
method Functorial and inductive properties of vertical quantum cohomology, relating to analytic number theory.
result The degeneracy of the small vertical quantum spectrum of a Grassmann bundle is controlled by the prime factorization of ranks.

The preceding paper constructed tangle machines as diagrammatic models, and illustrated their utility with a number of examples. The information content of a tangle machine is contained in characteristic quantities associated to equivalence classes of tangle machines, which are called invariants. This paper constructs …

2014-04-10abs ↗pdf ↗

This is the second of a part series devoted to enumerating prime alternating knots and links. In Part I, we introduced four operators on knots and showed that if these operators are applied to the set of all prime alternating knots of n crossings, the set of all prime alternating knots of n+1 crossings is obtained. In …

2002-11-22abs ↗pdf ↗

This paper solves the structure of link concordance groups, proving they are infinitely generated.

problem Determining the structure of link concordance groups with a marked component.
method Proving the complements are isomorphic to Z^∞ ⊕ (Z/2Z)^∞ and introducing prime elements.
result Proves both complements of link concordance groups are Z^∞ ⊕ (Z/2Z)^∞.

Study geodesics on random hyperbolic surfaces, finding variance similar to prime number theory.

problem Distribution of closed geodesics on random hyperbolic surfaces.
method Investigate random variable counting geodesics with norms in short intervals, comparing to prime number theory.
result Establishes variance of geodesic counting function is asymptotic to \(2H \log X\).

A dynamical analog of the prime ideals for simple non-commutative rings is introduced. We prove a factorization theorem for the dynamical ideals. The result is used to classify the surface knots and links in the smooth 4-dimensional manifolds.

2019-12-05abs ↗pdf ↗

Study the moduli space of reducible 3-manifolds using prime decomposition.

problem Understanding the homotopy type of moduli spaces of reducible 3-manifolds.
method Construct a splitting map from BextrmDiff+(M)B extrm{Diff}^+(M) to BextrmDiff+(P1Pn)B extrm{Diff}^+(P_1 \sqcup \dots \sqcup P_n), yielding a prime decomposition fibre sequence.
result The fibre Hg(P1,,Pn)H_g(P_1, \dots, P_n) is a finite, connected cell complex, and the prime decomposition fibre sequence is effective for computations.

The main purpose of this note is the study of the total space of a holomorphic Lie algebroid EE. The paper is structured in three parts. In the first section we briefly introduce basic notions on holomorphic Lie algebroids. The local expressions are written and the complexified holomorphic bundle is introduced. The se…

2016-05-26abs ↗pdf ↗

The upsilon distribution, the sum of independent chi random variates and a normal, is introduced. As a special case, the upsilon distribution includes Lecoutre's lambda-prime distribution. The upsilon distribution finds application in Frequentist inference on the Sharpe ratio, including hypothesis tests on independent …

2015-05-04abs ↗pdf ↗

Goldbach conjecture is one of the most famous open mathematical problems. It states that every even number, bigger than two, can be presented as a sum of 2 prime numbers. % In this work we present a deep learning based model that predicts the number of Goldbach partitions for a given even number. Surprisingly, our mode…

2018-03-25abs ↗pdf ↗

Study improves HOMFLY polynomial coefficients for positive braid links.

problem Determining HOMFLY polynomial coefficients for positive braid links.
method Using geometric invariants like maximum Euler characteristics, number of split and prime factors.
result Improvements in known results for Conway and Jones polynomials of positive braid links.

Kirby and Lickorish showed that every knot in the 3-sphere is concordant to a prime knot, equivalently, every concordance class contains a prime knot. We prove here that their result can be strengthened: Every knot in the 3-sphere is invertibly concordant to a prime knot. A consequence is that every double concordance …

2000-03-05abs ↗pdf ↗

This is the first in a series of four papers wherein we enumerate all prime alternating knots and links. In this first paper, we introduce four operators on knots and show that, when used according to very simple rules on the prime alternating knots of n crossings, the set of all prime alternating knots of n+1 crossing…

2002-11-21abs ↗pdf ↗

This is the third paper in a series devoted to enumerating the prime alternating knots and links. This paper establishes a method for enumerating the prime alternating links. It is shown that one may choose any prime alternating link diagram of a given minimal crossing size and by applications of just two operators (T …

2002-11-28abs ↗pdf ↗

A nontrivial element in a group is a generalized torsion element if some nonempty finite product of its conjugates is the identity. We prove that any generalized torsion element in a free product of torsion-free groups is conjugate to a generalized torsion element in some factor group. This implies that the fundamental…

2018-11-19abs ↗pdf ↗

Decomposing knots and links into tangles is a useful technique for understanding their properties. The notion of prime tangles was introduced by Kirby and Lickorish in [3]; Lickorish proved [5] that by summing prime tangles one obtains a prime link. In a similar spirit, summing two prime alternating tangles will produc…

2019-06-15abs ↗pdf ↗

The maximum number of maximum cliques in a graph is determined for graphs with at least 15 vertices.

problem Determining the maximum number of maximum cliques in a graph with n vertices.
method Defining prime and composite graphs, analyzing edge bounds, and using combinatorial arguments.
result For graphs with at least 15 vertices, the graph with the maximum number of maximum cliques is composite.

We describe a method for generating minimal hard prime surface-link diagrams. We extend the known examples of minimal hard prime classical unknot and unlink diagrams up to three components and generate figures of all minimal hard prime surface-unknot and surface-unlink diagrams with prime base surface components up to …

2017-06-28abs ↗pdf ↗