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

Trend · papers per month

2468 · Oct 201919922001200920172026
48 results for crosscap slide

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 ↗

The study explores nonorientable 3-manifolds using open books and their monodromies.

problem Investigating open books for nonorientable 3-manifolds.
method Analyzing monodromies of open books for specific nonorientable 3-manifolds.
result Infinitely many nonisotopic genus two open books for P2imesS1P^2 imes S^1 and S2imes~S1S^2 \widetilde{ imes} S^1.

We define the concordance crosscap number of a knot as the minimum crosscap number among all the knots concordant to the knot. The four-dimensional crosscap number is the minimum first Betti number of non-orientable surfaces smoothly embedded in 4-dimensional ball, bounding the knot. Clearly the 4-dimensional crosscap …

2006-08-16abs ↗pdf ↗

We determine the precise bifurcation diagrams of the apparent contours of generic crosscaps, which contain the information of bifurcations with respect to the images of the singular sets of crosscaps: crosscap points and double point curves. Especially, three different kinds of equivalences play key roles.

2018-05-23abs ↗pdf ↗

The crosscap number of a knot in the 3-sphere is the minimal genus of non-orientable surface bounded by the knot. We determine the crosscap numbers of torus knots.

2002-07-23abs ↗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 ↗

We present a practical algorithm to determine the minimal genus of non-orientable spanning surfaces for 2-bridge knots, called the crosscap numbers. We will exhibit a table of crosscap numbers of 2-bridge knots up to 12crossings (all 362 of them).

2005-04-22abs ↗pdf ↗

The study calculates average crosscap numbers for 2-bridge knots.

problem Determining the average crosscap number of 2-bridge knots.
method Using continued fraction expansions and recursion, the study provides exact formulas for average crosscap numbers.
result The study shows that the limit of the average crosscap number of 2-bridge knots approaches zero as the crossing number increases.

The crosscap number of a knot in the 3-sphere is defined as the minimal first Betti number of non-orientable subsurfaces bounded by the knot. In this paper, we determine the crosscap numbers of pretzel knots. The key ingredient to obtain the result is the algorithm of enumerating all essential surfaces for Montesinos k…

2006-08-21abs ↗pdf ↗

Study maxfaces and minfaces converging to surfaces with folded singularities.

problem Analyzing surfaces with folded singularities and their convergence properties.
method Constructing families of maxfaces and minfaces with increasing cuspidal crosscaps.
result Maxfaces and minfaces converge to surfaces with folded singularities.

We give sharp two-sided linear bounds of the crosscap number (non-orientable genus) of alternating links in terms of their Jones polynomial. Our estimates are often exact and we use them to calculate the crosscap numbers for several infinite families of alternating links and for several alternating knots with up to twe…

2014-08-19abs ↗pdf ↗

Let Ng,nN_{g,n} be an nn--punctured non--orientable surface of genus gg with one boundary component. For g2g\geq 2 one of the generators of the mapping class group of Ng,nN_{g,n} is a crosscap transposition. We give explicit formulae for the action of crosscap transpositions and their inverses on the set of multicurves i…

2019-09-26abs ↗pdf ↗

Ito-Takimura recently defined a splice-unknotting number u(D)u^-(D) for knot diagrams. They proved that this number provides an upper bound for the crosscap number of any prime knot, asking whether equality holds in the alternating case. We answer their question in the affirmative. (Ito has independently proven the same …

2019-05-27abs ↗pdf ↗

For a knot K, the concordance crosscap number, c(K), is the minimum crosscap number among all knots concordant to K. Building on work of G. Zhang, which studied the determinants of knots with c(K) < 2, we apply the Alexander polynomial to construct new algebraic obstructions to c(K) < 2. With the exception of low cross…

2007-03-04abs ↗pdf ↗

For a torus knot K, we bound the crosscap number c(K) in terms of the genus g(K) and crossing number n(K): c(K) \leq [(g(K)+9)/6] and c(K) \leq [(n(K) + 16)/12]. The (6n-2,3) torus knots show that these bounds are sharp.

2004-09-29abs ↗pdf ↗

New method calculates knot and link properties using state codes.

problem Determining the unoriented genus and crosscap number of prime alternating knots and links.
method Encoding states as tuples and using them to compute genus and crosscap number.
result Computed values for all such links through 14 crossings and knots through 19 crossings, identifying patterns.

New singularities and fibrations in non-orientable 4-manifolds.

problem Understanding singularities and fibrations in non-orientable 4-manifolds.
method Introducing MM-singularities and MM-fibrations, studying their handle decompositions and orientation double coverings.
result Relations among crosscap transpositions give rise to MM-fibrations on non-orientable 4-manifolds.

M. Scharlemann has recently proved that any genus one tunnel number one knot is either a satellite or 2-bridge knot, as conjectured by H. Goda and M. Teragaito; all such knots admit a (1,1) decomposition. In this paper we give a classification of the family of (1,1) knots in S3S^3 with crosscap number two (i.e., boundi…

2005-10-31abs ↗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 ↗

This paper calculates the non-orientable 4-genus for knots with 10 crossings.

problem Determining the non-orientable 4-genus for knots with a specific number of crossings.
method Calculating the minimal first Betti number of non-orientable surfaces smoothly embedded in a 4-ball with boundary the knot.
result The non-orientable 4-genus for knots with 10 crossings has been calculated.

Classifies homomorphisms from braid groups to mapping class groups of nonorientable surfaces.

problem Classifying homomorphisms from braid groups to mapping class groups of nonorientable surfaces.
method Classifies homomorphisms based on the properties of Dehn twists and crosscap transpositions.
result Every homomorphism is either cyclic or maps generators to distinct Dehn twists or crosscap transpositions.

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 consider non-orientable closed surfaces of minimum crosscap number in the (p,q)(p,q)-lens space L(p,q)V1V2L(p,q) \cong V_1 \cup_{\partial} V_2, where V1V_1 and V2V_2 are solid tori. Bredon and Wood gave a formula for calculating the minimum crosscap number. Rubinstein showed that L(p,q)L(p,q) with pp even has only one isotopy cla…

2009-03-26abs ↗pdf ↗

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.