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

8172533 · Nov 201919922001200920172026
48 results for Clasper software

The paper classifies links up to link-homotopy using claspers.

problem Classifying links up to link-homotopy.
method Using Habiro's clasper calculus, defining a linear representation of the homotopy braid group, and providing a geometric proof.
result Geometric proof of Levine's classification of 4-component links and further classification of 5-component links in the algebraically split case.

In this note we reconsider a familiar result in Vassiliev knot theory - that the coefficients of the Alexander-Conway polynomial determine the top row of the Kontsevich integral - from the point of view of Kazuo Habiro's clasper theory. We observe that in this setting the calculation reflects the topology of the univer…

1999-01-07abs ↗pdf ↗

We introduce the concept of `claspers,' which are surfaces in 3-manifolds with some additional structure on which surgery operations can be performed. Using claspers we define for each positive integer k an equivalence relation on links called `C_k-equivalence,' which is generated by surgery operations of a certain kin…

2000-01-28abs ↗pdf ↗

Study the kernel of surgery map restricted to 1-loop part of homology cylinders.

problem Understanding the kernel of the surgery map restricted to 1-loop parts of homology cylinders.
method Using Jacobi diagrams and clasper surgery, determine the kernel of the surgery map restricted to the 1-loop part.
result Determined the kernel of the surgery map restricted to the 1-loop part of homology cylinders.

This paper detects torsion elements in homology cylinder monoids.

problem Detecting torsion elements in the associated graded of the Y-filtration of homology cylinders.
method Introduced a homomorphism induced by the LMO functor to detect torsion elements.
result Every non-trivial torsion element in Y6IC/Y7Y_6\mathcal{IC}/Y_7 has order 3.

In this paper, the easier methods of my thesis are applied to give a simple proof of a theorem of Goussarov. The theorem relates two possible notions of finite type equivalence of knots, links or string links, showing that the resulting filtrations are the same up to a degree shift by a factor of two. This is then appl…

2001-10-04abs ↗pdf ↗

Two links are link-homotopic if they are transformed into each other by a sequence of self-crossing changes and ambient isotopies. The link-homotopy classes of 4-component links were classified by Levine with enormous algebraic computations. We modify the results by using Habiro's clasper theory. The new classification…

2019-10-18abs ↗pdf ↗

This paper studies the rational homotopy groups of the group Diff(S4)\mathrm{Diff}(S^4) of self-diffeomorphisms of S4S^4 with the CC^\infty-topology. We present a method to prove that there are many `exotic' non-trivial elements in πDiff(S4)Qπ_*\mathrm{Diff}(S^4)\otimes \mathbb{Q} parametrized by trivalent graphs. As a corollary of…

2018-12-06abs ↗pdf ↗

Recently Swatee Naik and Theodore Stanford proved that two S-equivalent knots are related by a finite sequence of doubled-delta moves on their knot diagrams. We show that classical S-equivalence is not sufficient to extend their result to ordered links. We define a new algebraic relation on Seifert matrices, called Str…

2004-09-22abs ↗pdf ↗

We show that surgery on a connected clover (or clasper) with at least one loop preserves the concordance class of a knot. Surgery on a slightly more special class of clovers preserves invertible concordance. We also show that the converse is false. Similar results hold for clovers with at least two loops vs. S-equivale…

2001-02-13abs ↗pdf ↗

Theta graph diffeomorphism shows nontrivial mapping class of 4-sphere.

problem Identifying nontrivial elements in the smooth mapping class group of 4-sphere.
method Diagrammatic calculus for smooth mapping class group of 4-sphere, Watanabe's clasper surgery construction.
result Theta graph diffeomorphism is isotopic to a nontrivial element of (1,2)-subgroup.

We show that the Casson knot invariant, linking number and Milnor's triple linking number, together with a certain 2-string link invariant V2V_2, are necessary and sufficient to express any string link Vassiliev invariant of order two. Explicit combinatorial formulas are given for these invariants. This result is appli…

2004-02-04abs ↗pdf ↗

It has long been known that a Milnor invariant with no repeated index is an invariant of link homotopy. We show that Milnor's invariants with repeated indices are invariants not only of isotopy, but also of self C_k-moves. A self C_k-move is a natural generalization of link homotopy based on certain degree k clasper su…

2005-11-21abs ↗pdf ↗

New presentation of Goussarov-Habiro Lie algebra using primitive Feynman diagrams.

problem Defining a filtration of string links using clasper surgeries and geometrically realizing Feynman diagrams.
method Concrete presentation of the rational Goussarov-Habiro Lie algebra using primitive Feynman diagrams and relations.
result Alternative diagrammatic proof of Massuyeau's rational version of the Goussarov-Habiro conjecture.

Minor typographical errors fixed. Cochran constructed many links with Alexander module that of the unlink and some nonvanishing Milnor invariants, using as input commutators in a free group and as an invariant the longitudes of the links. We present a different and conjecturally complete construction, that uses element…

2002-06-19abs ↗pdf ↗

We give a purely topological definition of the perturbative quantum invariants of links and 3-manifolds associated with Chern-Simons field theory. Our definition is as close as possible to one given by Kontsevich. We will also establish some basic properties of these invariants, in particular that they are universally …

1999-12-21abs ↗pdf ↗

For an nn-component link LL, the Milnor's isotopy invariant is defined for each multi-index $I=i_1i_2...i_m (i_j\in\n)$. Here mm is called the length. Let r(I)r(I) denote the maximam number of times that any index appears. It is known that Milnor invariants with r=1r=1 are link-homotopy invariant. N. Habegger and X. S.…

2006-10-16abs ↗pdf ↗

The purpose of the present paper is to introduce and explore two surprises that arise when we apply a standard procedure to study the number of finite type invariants of 3-manifolds introduced independently by M. Goussarov and K. Habiro based on surgery on claspers, Y-graphs or clovers, \cite{Gu,Ha,GGP}. One surprise i…

2000-06-06abs ↗pdf ↗

Research proposes an ensemble learning model for efficient software defect prediction.

problem Efficient and cost-effective software testing to minimize project resources.
method Machine learning analysis on different datasets using KNN, Decision Tree, SVM, and Naïve Bayes.
result Ensemble learning model outperforms other techniques in accuracy, precision, recall, and F1-score.

Improving software quality through effective organizational learning.

problem Lack of reliable quantification methods for software evolution.
method Leveraging application lifecycle management data to identify and address managerial practices.
result Effective learning from past processes improves software quality indirectly.

Improved software flaw detection using NAS on multimodal DL models.

problem Software flaw detection in multimodal deep learning models.
method Adapted NAS framework for multimodal learning, combined with multimodal deep learning models.
result Improved performance on the Juliet Test Suite.

Method predicts hardware resource usage by control software with guaranteed linear convergence.

problem Predicting time-varying hardware resource availability in control software.
method Path structured multimarginal Schrödinger bridge (MSBP) for learning stochastic resource usage.
result Guaranteed linear convergence to accurate prediction of hardware resource utilization.

Software development effort estimation is considered a fundamental task for software development life cycle as well as for managing project cost, time and quality. Therefore, accurate estimation is a substantial factor in projects success and reducing the risks. In recent years, software effort estimation has received …

2019-01-08abs ↗pdf ↗

Existing language models such as n-grams for software code often fail to capture a long context where dependent code elements scatter far apart. In this paper, we propose a novel approach to build a language model for software code to address this particular issue. Our language model, partly inspired by human memory, i…

2016-08-09abs ↗pdf ↗

This paper tackles co-design of neural hardware and software to improve efficiency.

problem Designing efficient deep learning systems that consider both hardware and software optimizations together.
method Developed a constrained Bayesian optimization framework to automatically identify profitable design points in the joint hardware/software design space.
result Improved energy-delay product by 18% (ResNet) and 40% (DQN) over hand-tuned systems.

The public package registry npm is one of the biggest software registry. With its 216 911 software packages, it forms a big network of software dependencies. In this paper we evaluate various methods for finding similar packages in the npm network, using only the structure of the graph. Namely, we want to find a way of…

2016-02-11abs ↗pdf ↗

Although software analytics has experienced rapid growth as a research area, it has not yet reached its full potential for wide industrial adoption. Most of the existing work in software analytics still relies heavily on costly manual feature engineering processes, and they mainly address the traditional classification…

2016-07-30abs ↗pdf ↗

The purpose of this study is to introduce new design-criteria for next-generation hyperparameter optimization software. The criteria we propose include (1) define-by-run API that allows users to construct the parameter search space dynamically, (2) efficient implementation of both searching and pruning strategies, and …

2019-07-25abs ↗pdf ↗

Existing malware detectors on safety-critical devices have difficulties in runtime detection due to the performance overhead. In this paper, we introduce PROPEDEUTICA, a framework for efficient and effective real-time malware detection, leveraging the best of conventional machine learning (ML) and deep learning (DL) te…

2017-12-04abs ↗pdf ↗

Software estimates inequality in random systems with changing communities.

problem Measuring inequality in systems with dynamic interactions and random attributes.
method Piecewise homogeneous Markov chain for changing points, copula function for multivariate distribution, Monte Carlo algorithm for entropy estimation.
result Estimates Random Theil's Entropy to measure inequality in random systems.