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

Trend · papers per month

12253749 · Jun 202619922001200920172026
48 results for sliding moves

Simplified combinatorial descriptions of branched spines for 3-manifolds using primary MP move and sliding moves.

problem Combinatorial descriptions of branched spines for 3-manifolds and their equivalence relations.
method Demonstrated that 16 MP moves on branched spines are derived from a primary MP move, pure sliding moves, and their inverses.
result Simpler combinatorial descriptions for closed 3-manifolds and combed 3-manifolds.

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.

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 ↗

One-parameter hyperbolic planar motion was first studied by S. Yu¨\ddot{\texttt{u}}ce and N. Kuruog~\tilde{\texttt{g}}lu. Moreover, they analyzed the relationships between the absolute, relative and sliding velocities of one-parameter hyperbolic planar motion as well as the related pole curves, \cite{Yuc}. One-paramete…

2009-12-31abs ↗pdf ↗

We give an example of two JSJ decompositions of a group that are not related by conjugation, conjugation of edge-inclusions, and slide moves. This answers the question of Rips and Sela stated in "Cyclic splittings of finitely presented groups and the canonical JSJ decomposition," Ann. of Math. 146 (1997), 53-109. On th…

2001-10-17abs ↗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 ↗

The article finds equivalence moves for links in specific manifolds using plat closure of braids.

problem Finding equivalence moves for links in Dunwoody and periodic Takahashi manifolds.
method Representing manifolds with Heegaard splitting and braids, determining equivalence moves algorithmically and computing them explicitly.
result Explicit computation of equivalence moves for some cases.

Nielsen reduction is an algorithm which decomposes any automorphism of a free group into a product of elementary Nielsen transformations. While this may be applied to a mapping class of a surface Sg,1S_{g,1} with one boundary component, the resulting decomposition in general will not have a topological interpretation. In…

2010-10-25abs ↗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 ↗

Let BnB_n denote the classical braid group on nn strands and let the {\em mixed braid group} Bm,nB_{m,n} be the subgroup of Bm+nB_{m+n} comprising braids for which the first mm strands form the identity braid. Let Bm,=nBm,nB_{m,\infty}=\cup_nB_{m,n}. We will describe explicit algebraic moves on Bm,B_{m,\infty} such that equivale…

2004-05-26abs ↗pdf ↗

We study a notion of deformation for simplicial trees with group actions (G-trees). Here G is a fixed, arbitrary group. Two G-trees are related by a deformation if there is a finite sequence of collapse and expansion moves joining them. We show that this relation on the set of G-trees has several characterizations, in …

2001-07-02abs ↗pdf ↗

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 ↗

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 ↗

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 ↗

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 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 ↗

Classifies solutions to critical sixth order equations with a singularity.

problem Classifying entire positive singular solutions to critical sixth order equations.
method Integral sliding methods, qualitative analysis of ODEs, topological two-parameter shooting technique.
result Solutions are given by a singular radial factor times a periodic solution to a sixth order IVP with constant coefficients.

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 ↗

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 ↗

Study on relativistic nonholonomic mechanics with time-dependent constraints.

problem Formulating classical time-dependent nonholonomic mechanics.
method Invariant formulation using moving frames and Chaplygin systems.
result Hamiltonization of time-dependent constraints achieved.

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.

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 ↗

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 ↗

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.

New method for computing Kauffman bracket skein module of lens spaces using unoriented braids.

problem Computing Kauffman bracket skein module of lens spaces L(p,q)L(p,q) for qeq0q eq 0.
method Developed a braid theoretic approach via unoriented braids, introducing a new algebra and invariant.
result Computed the Kauffman bracket skein module of lens spaces L(p,1)L(p,1) and extended to q>1q > 1.

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.

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 ↗