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 …
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
48 results for “handle sliding relations”
Kirby color defined in Khovanov homology for 4D handlebodies.
problem Invariance of 4D handlebodies under Kirby moves.
method Functoriality and cabling properties of Khovanov homology, handle slide isomorphism.
result Kirby-colored Khovanov homology is invariant under handle slide moves.
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.
Paper studies simplified trisections and their equivalence classes.
problem Understanding right-left equivalence of simplified -trisections.
method Analyzes simplified trisection diagrams and upper-triangular handle-slides.
result At least two simplified -trisections can be right-left equivalent without being related by automorphisms or handle-slides.
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…
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.
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…
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 …
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 .
result The skein module of does not split into free and torsion submodules.
Handles decompositions reveal new open book structures.
problem Understanding and manipulating open book structures on manifolds.
method Build handle decompositions and describe handle slides.
result Stabilization of open books to trivial monodromy.
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…
We exhibit a finite set of local moves that connect any two surgery presentations of the same 3-manifold via framed links in the three-sphere. The moves are handle-slides and blow-downs/ups of a particular simple kind.
Paper simplifies proof of slide-equivalence in crown diagrams.
problem Proving slide-equivalence of crown diagrams.
method Diagrammatic approach to generalized shift moves.
result Slide-equivalence of vanishing cycles in crown diagrams.
Minimal moves for surfaces in 4D discovered, linking planar and spatial moves.
problem Finding the minimal set of moves for surfaces in 4D.
method Derived minimal generating set of spatial moves, translated into planar moves.
result Minimal generating set of spatial moves for surfaces in 4D.
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…
We propose a sliding surface for systems on the Lie group . 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…
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…
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.…
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.
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…
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 with one boundary component, the resulting decomposition in general will not have a topological interpretation. In…
Presentations for involutions on non-orientable surfaces up to genus 5.
problem Representing involutions on non-orientable surfaces.
method Dehn twist--crosscap slide presentations.
result Presentations for involutions on non-orientable surfaces of genera up to 5.
One-parameter hyperbolic planar motion was first studied by S. Yce and N. Kuruolu. 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…
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 …
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.
New GLB algorithm handles non-stationary data with forgetting.
problem Non-stationary GLB with non-convex projection or burn-in phases.
method Self-concordant GLB with sliding window or exponential weights for forgetting.
result Novel confidence-based algorithm for maximum likelihood estimator.
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…
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.
Proposes a sliding window method for better portfolio trading.
problem Log-optimal portfolio problem with time-varying weights.
method Data-driven sliding window approach to solve log-optimal portfolio problem.
result Trading strategy outperforms classical log-optimal portfolio in cumulative returns.
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 denote a closed nonorientable surface of genus . For the mapping class group is generated by Dehn twists and one crosscap slide (-homeomorphism) or by Dehn twists and a crosscap transposition. Margalit and Schleimer observed that Dehn twists have nontrivial roots. We gi…
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…
Small bubbles sliding on a boundary maintain half-spherical shape.
problem Preserving the shape of small bubbles sliding on a boundary.
method Area-preserving Willmore flow, asymptotic analysis, convergence proof.
result The flow keeps a half-spherical shape for all times.
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 …
We determine all critical configurations for the Area function on polygons with vertices on a circle or an ellipse. For isolated critical points we compute their Morse index, resp index of the gradient vector field. We relate the computation at an isolated degenerate point to an eigenvalue question about combinations. …
This paper is the second part of our work on 4-dimensional 2-handlebodies. In the first part (arXiv:math.GT/0407032) it is shown that up to certain set of local moves, connected simple coverings of B^4 branched over ribbon surfaces, bijectively represent connected orientable 4-dimensional 2-handlebodies up to 2-deforma…
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 …
In this paper we study the relation between conserved quantities of nonholonomic systems and the hamiltonization problem employing the geometric methods of [1,3]. We illustrate the theory with classical examples describing the dynamics of solids of revolution rolling without sliding on a plane. In these cases, using th…
A new method SLIDE ensures fairness in AI models.
problem Ensuring fairness in AI models while maintaining computational feasibility.
method Proposes a new surrogate fairness constraint SLIDE.
result SLIDE ensures fairness in AI models asymptotically and converges fast.
We analyze higher-dimensional sliding puzzles, finding solvability patterns.
problem Solvability of higher-dimensional cubical sliding puzzles.
method Study of puzzle graphs and token movement constraints.
result Characterization of solvability regimes from stuck to fully solvable.
Crosscap slide is a homeomorphism of a nonorientable surface of genus at least 2, which was introduced under the name Y-homeomorphism by Lickorish as an example of an element of the mapping class group which cannot be expressed as a product of Dehn twists. We prove that the subgroup of the mapping class group of a clos…
The paper calculates a new invariant for 4-manifolds using handle decompositions and skein relations.
problem Computing invariants for 4-manifolds built from handles.
method Handle attachment formulas, cabled colimits, lasso relation.
result Explicit calculations and partial vanishing results for specific 4-manifolds.
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.
We present a novel approach to train pixel resolution segmentation models on whole slide images in a weakly supervised setup. The model is trained to classify patches extracted from slides. This leads the training to be made under noisy labeled data. We solve the problem with two complementary strategies. First, the pa…
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…