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

23477093 · Jun 202019922001200920172026
48 results for handle slide

A theorem of Kirby states that two framed links in the 3-sphere produce orientation-preserving homeomorphic results of surgery if they are related by a sequence of stabilization and handle-slide moves. The purpose of the present paper is twofold: First, we give a sufficient condition for a sequence of handle-slides on …

2005-09-02abs ↗pdf ↗

We propose a means by which some categorifications can be evaluated at a root of unity. This is implemented using a suitable localization in the context of prior work by the authors on categorification of the Jones-Wenzl projectors. Within this construction we define objects, invariant under handle slides, which decate…

2011-10-10abs ↗pdf ↗

Bordered Heegaard Floer homology is an invariant for three-manifolds with boundary. In particular, this invariant associates to a handle decomposition of a surface F a differential graded algebra, and to an arc slide between two handle decompositions, a bimodule over the two algebras. In this paper, we describe these b…

2010-10-13abs ↗pdf ↗

A knot K in the 3-sphere is said to have Property nR if, whenever K is a component of an n-component link L and some integral surgery on L produces the connected sum of n copies of S^1 x S^2, there is a sequence of handle slides on L that converts L into a 0-framed unlink. The Generalized Property R Conjecture is that …

2009-08-19abs ↗pdf ↗

Paper studies simplified trisections and their equivalence classes.

problem Understanding right-left equivalence of simplified (2,0)(2, 0)-trisections.
method Analyzes simplified trisection diagrams and upper-triangular handle-slides.
result At least two simplified (2,0)(2, 0)-trisections can be right-left equivalent without being related by automorphisms or handle-slides.

Paper disproves a theorem about Kauffman bracket skein module structure.

problem Disproving a 22-year-old theorem about Kauffman bracket skein module structure.
method Analyzing handle slidings on compressing discs in handlebodies.
result More relations found than previously predicted for connected sum of handlebodies.

New contact Kirby moves complete the set for contact surgery diagrams.

problem Contact surgery diagrams and their relation to contactomorphic contact manifolds.
method Introducing lantern moves and chain moves to complete the set of contact Kirby moves.
result Two contact surgery diagrams represent contactomorphic contact manifolds if and only if they are related by a sequence of specific moves.

Researchers compute the Kauffman bracket skein module of a specific 3-manifold.

problem Understanding the structure of Kauffman bracket skein modules for non-prime manifolds.
method Analyzing handle sliding relations to compute the module over Z[A±1]\mathbb Z[A^{\pm 1}].
result The skein module of (S1imesS2) # (S1imesS2)(S^1 imes S^2) \ \# \ (S^1 imes S^2) does not split into free and torsion submodules.

We propose a sliding surface for systems on the Lie group SO(3)×R3SO(3)\times \mathbb{R}^3 . The sliding surface is shown to be a Lie subgroup. The reduced-order dynamics along the sliding subgroup have an almost globally asymptotically stable equilibrium. The sliding surface is used to design a sliding-mode controller for t…

2019-05-14abs ↗pdf ↗

The stable Andrews-Curtis conjecture in combinatorial group theory is the statement that every balanced presentation of the trivial group can be simplified to the trivial form by elementary moves corresponding to "handle-slides" together with "stabilization" moves. Schoenflies conjecture is the statement that the compl…

2014-06-26abs ↗pdf ↗

For oriented manifolds of dimension at least 4 that are simply connected at infinity, it is known that end summing is a uniquely defined operation. Calcut and Haggerty showed that more complicated fundamental group behavior at infinity can lead to nonuniqueness. The present paper examines how and when uniqueness fails.…

2017-12-29abs ↗pdf ↗

The paper analyzes the sliding regret of stochastic bandit algorithms.

problem Measuring the one-shot behavior of no-regret algorithms in stochastic bandits.
method Introducing sliding regret to measure the worst pseudo-regret over a time-window.
result Randomized methods have optimal sliding regret, while index policies have the worst possible sliding regret.

We study the effect of Nielsen moves and their geometric counterparts, handle slides, on good boundary links. A collection of links, universal for 4-dimensional surgery, is shown to admit Seifert surfaces with trivial Lagrangian. They are good boundary links, with Seifert matrices of a more general form than in known c…

2019-01-17abs ↗pdf ↗

PROPO tackles non-stationary MDPs with efficient policy optimization.

problem Non-stationary MDPs with varying reward and transition kernels.
method PROPO, a periodic restarted optimistic policy optimization algorithm with sliding-window-based policy evaluation and improvement.
result PROPO achieves near-optimal performance in non-stationary MDPs.

We present a new operation to be performed on elements in a Garside group, called cyclic sliding, which is introduced to replace the well known cycling and decycling operations. Cyclic sliding appears to be a more natural choice, simplifying the algorithms concerning conjugacy in Garside groups and having nicer theoret…

2008-08-10abs ↗pdf ↗

Novel time series forecasting method using sliding window signatures.

problem Challenges in forecasting nonlinear and delayed time series data.
method Ridge regression with signature features calculated on sliding windows.
result Signature features effectively encode temporal and nonlinear dependencies, leading to accurate forecasts.

Optimizes sliding window approach for tracking Gaussian densities.

problem Improving tracking performance of Gaussian density estimation.
method Theoretical analysis of sliding window Gaussian Kernel Density Estimators.
result Empirical evidence shows improved tracking performance with optimal weight sequence.

Let NgN_{g} denote a closed nonorientable surface of genus gg. For g2g \geq 2 the mapping class group M(Ng)\mathcal{M}(N_{g}) is generated by Dehn twists and one crosscap slide (YY-homeomorphism) or by Dehn twists and a crosscap transposition. Margalit and Schleimer observed that Dehn twists have nontrivial roots. We gi…

2016-01-22abs ↗pdf ↗

We show that simple coverings of B^4 branched over ribbon surfaces up to certain local ribbon moves bijectively represent orientable 4-dimensional 2-handlebodies up to handle sliding and addition/deletion of cancelling handles. As a consequence, we obtain an equivalence theorem for simple coverings of S^3 branched over…

2004-07-02abs ↗pdf ↗

Kirby proved that two framed links in S^3 give orientation-preserving homeomorphic results of surgery if and only if these two links are related by a sequence of two kinds of moves called stabilizations and handle-slides. Fenn and Rourke gave a necessary and sufficient condition for two framed links in a closed, orient…

2013-02-04abs ↗pdf ↗

We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its conjugacy class which we call the stabilized set of sliding circuits, and if it …

2010-08-02abs ↗pdf ↗

New algorithm tackles non-stationary reinforcement learning with general function approximation.

problem Understanding non-stationary MDPs with function approximation.
method Dynamic Bellman Eluder (DBE) dimension for complexity, sliding window mechanism, confidence set design.
result Upper bound on dynamic regret for proposed SW-OPEA algorithm.

If a variational problem comes with no boundary conditions prescribed beforehand, and yet these arise as a consequence of the variation process itself, we speak of a free boundary values variational problem. Such is, for instance, the problem of finding the shortest curve whose endpoints can slide along two prescribed …

2017-03-11abs ↗pdf ↗

KeRNS tackles non-stationary reinforcement learning in metric spaces.

problem Non-stationary reinforcement learning in metric spaces.
method KeRNS uses time-dependent kernels to model non-stationary Markov Decision Processes (MDPs).
result KeRNS achieves a regret bound that scales with the covering dimension and total variation of the MDP.

New algorithms achieve optimal regret in sliding window model with limited memory.

problem Experts problem in the sliding window model with limited information.
method 2 queries, polylog(nT) memory, exponential improvement on memory.
result Achieve optimal regret of sqrt(nW)polylog(nT) with 2 queries and polylog(nT) memory.

The HKR (Hennings-Kauffman-Radford) framework is used to construct invariants of 4-thickenings of 2-dimensional CW complexes under 2-deformations (1- and 2- handle slides and creations and cancellations of 1-2 handle pairs). The input of the invariant is a finite dimensional unimodular ribbon Hopf algebra A and an elem…

2002-06-28abs ↗pdf ↗

In many applications, monitoring area under the ROC curve (AUC) in a sliding window over a data stream is a natural way of detecting changes in the system. The drawback is that computing AUC in a sliding window is expensive, especially if the window size is large and the data flow is significant. In this paper we propo…

2019-02-02abs ↗pdf ↗

TAKDE optimizes kernel density estimation for real-time dynamic processes.

problem Real-time density estimation in applications like computer vision and signal processing.
method Derives asymptotic mean integrated squared error (AMISE) upper bound for 'sliding window' kernel density estimator and proposes TAKDE as a novel, theoretically optimal estimator.
result TAKDE outperforms other dynamic density estimators in terms of test log-likelihood and runtime.

Increasingly, Internet of Things (IoT) domains, such as sensor networks, smart cities, and social networks, generate vast amounts of data. Such data are not only unbounded and rapidly evolving. Rather, the content thereof dynamically evolves over time, often in unforeseen ways. These variations are due to so-called con…

2017-10-05abs ↗pdf ↗

New robustness certificates for streaming models with a sliding window.

problem Applying robustness certificates to streaming data with correlated inputs.
method Deriving robustness certificates for models using a sliding window over a sequence of potentially correlated inputs.
result Guarantees hold for the average model performance across the entire stream, independent of stream size.

The above named paper has been withdrawn. A colleague has observed a gap in the proof of isotopy invariance, which can be repaired by reducing the coefficients (which lie in (1/6)Z) of the antisymmetric kanji with chords incident with more than one component modulo 8Z. An analogous issue arises in considering the effec…

2005-10-20abs ↗pdf ↗