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

170340509679 · Jun 202019922001200920182026
48 results for two components

The paper studies unlinking links with minimal crossing changes.

problem Unlinking links with minimal changes when crossings between components are fixed.
method Examined minimum number of crossing changes for links with linking number zero and unknotted components.
result Data and general results about asymmetry of unlinking between components for links with up to ten crossings.

Characterizes sequences from two-component link diagrams.

problem Understanding information from non-self crossing sequences of link diagrams.
method Investigated and characterized pairs of non-self OU sequences of two-component link diagrams.
result Completely characterized pairs of non-self OU sequences of diagrams of two-component links.

For any link of two components in an integral homology sphere, we define an instanton Floer homology whose Euler characteristic is the linking number between the components of the link. We relate this Floer homology to the Kronheimer-Mrowka instanton Floer homology of knots. We also show that, for two-component links i…

2010-01-22abs ↗pdf ↗

In this paper, we study contact surgeries along Legendrian links in the standard contact 3-sphere. On one hand, we use algebraic methods to prove the vanishing of the contact Ozsváth-Szabó invariant for contact (+1)(+1)-surgery along certain Legendrian two-component links. The main tool is a link surgery formula for Heeg…

2018-01-07abs ↗pdf ↗

Verification determines whether two samples belong to the same class or not, and has important applications such as face and fingerprint verification, where thousands or millions of categories are present but each category has scarce labeled examples, presenting two major challenges for existing deep learning models. W…

2017-06-12abs ↗pdf ↗

We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H contains a nonsplit n component link, where at least m of the components are nont…

2007-05-15abs ↗pdf ↗

We consider the "intrinsic" symmetry group of a two-component link LL, defined to be the image Σ(L)Σ(L) of the natural homomorphism from the standard symmetry group $\MCG(S^3,L)$ to the product $\MCG(S^3) \cross \MCG(L)$. This group, first defined by Whitten in 1969, records directly whether LL is isotopic to a link $L…

2012-01-13abs ↗pdf ↗

We compute different versions of link Floer homology HFLHFL^{-} and HFL^\widehat{HFL} for any LL-space link with two components. The main approach is to compute the hh-function of the filtered chain complex which is determined by the Alexander polynomials of every sublink of the LL-space link. As an application, Thurst…

2017-04-08abs ↗pdf ↗

Combinatorial two-player games have recently been applied to knot theory. Examples of this include the Knotting-Unknotting Game and the Region Unknotting Game, both of which are played on knot shadows. These are turn-based games played by two players, where each player has a separate goal to achieve in order to win the…

2018-07-29abs ↗pdf ↗

Principal component regression (PCR) is a widely used two-stage procedure: principal component analysis (PCA), followed by regression in which the selected principal components are regarded as new explanatory variables in the model. Note that PCA is based only on the explanatory variables, so the principal components a…

2016-09-28abs ↗pdf ↗

We define the crosscap number of a 2-component link as the minimum of the first Betti numbers of connected, non-orientable surfaces bounding the link. We discuss some properties of the crosscap numbers of 2-component links.

2006-08-16abs ↗pdf ↗

A new PCR method using SVD with sparse regularization.

problem Lack of response variable information in traditional PCR.
method One-stage SVD approach with two loss functions and sparse regularization.
result Obtains principal component loadings with response variable information.

As a generalization of the linking number, we construct a set of invariant numbers for two-component handlebody-links. These numbers are elementary divisors associated with the natural homomorphism from the first homology group of a component to that of the complement of another component.

2012-10-28abs ↗pdf ↗

EM algorithm converges globally for two-component mixed linear regression.

problem Global convergence of EM algorithm for mixed linear regression.
method Developed new theoretical analysis for EM algorithm convergence in mixed linear regression.
result EM algorithm converges globally for two-component mixed linear regression.

A two-component link produces a torus as the product of the component knots in a two-point configuration space of a three-sphere. This space can be identified with a cotangent bundle and also with an indefinite Grassmannian. We show that the integration of the absolute value of the canonical symplectic form is equal to…

2007-09-14abs ↗pdf ↗

For any n\ge 2, we give infinitely many unsplittable links of n components in the 3-sphere which admit non-trivial surgery yielding the 3-sphere again and whose components are mutually distinct hyperbolic knots. Berge and Kawauchi gave 2-component hyperbolic links with those two properties. We can also give infinitely …

2001-05-16abs ↗pdf ↗

Study of coupled Hawkes processes with rough-volatility limits.

problem Understanding coupled Hawkes processes with rough-volatility limits.
method Proving weak convergence of rescaled intensity vector to stochastic Volterra equations.
result Limiting components exhibit different degrees of roughness and cross-decorrelation law.

We compute both natural and smooth models for the SL2(C)SL_2(\mathbb C) character varieties of the two component double twist links, an infinite family of two-bridge links indexed as J(k,l)J(k,l). For each J(k,l)J(k,l), the component(s) of the character variety containing characters of irreducible representations are birational to…

2014-11-04abs ↗pdf ↗

msPCA solves sparse PCA for multiple components efficiently.

problem Sparse principal component analysis with multiple components.
method Alternating maximization algorithm for sparse loading vectors, with orthogonality or zero correlation constraints.
result Achieves high variance explained with sparse components and controlled feasibility violations.

Principal component regression (PCR) is a two-stage procedure that selects some principal components and then constructs a regression model regarding them as new explanatory variables. Note that the principal components are obtained from only explanatory variables and not considered with the response variable. To addre…

2014-02-26abs ↗pdf ↗

The object of this paper is to study GL(2,R) orbit closures in hyperelliptic components of strata of abelian differentials. The main result is that all higher rank affine invariant submanifolds in hyperelliptic components are branched covering constructions, i.e. every translation surface in the affine invariant subman…

2015-08-21abs ↗pdf ↗

We extend the Kamada-Miyazawa polynomial to virtual singular links, which is valued in Z[A2,A2,h]\mathbb{Z}[A^2, A^{-2}, h]. The decomposition of the resulting polynomial into two components, one in Z[A2,A2]\mathbb{Z}[A^2, A^{-2}] and the other in Z[A2,A2]h\mathbb{Z}[A^2, A^{-2}]h yields the decomposition of the Kauffman-Jones polynomial o…

2016-10-09abs ↗pdf ↗

There are a least uncountably many diffeomorphism types for open manifolds. Hence the classification problem is extremely difficult. We proceed as follows: We define several uniform structures of proper metric spaces and consider their arc components. Any open complete manifold (M^n,g) defines such a component. Hence t…

1999-11-25abs ↗pdf ↗

IGSD separates task-specific content channels in transformer components by comparing activation replacement with zero ablation.

problem Mechanistic interpretability of transformer components
method IGSD: paired-intervention framework for comparing activation replacement with zero ablation
result IGSD identifies an early-layer content channel in transformer components that standard importance methods underestimate.