We introduce a local move on a link diagram named a region freeze crossing change which is close to a region crossing change, but not the same. We study similarity and difference between region crossing change and region freeze crossing change.
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
48 results for “region crossing changes”
Paper classifies link diagrams on nonorientable surfaces using region crossing changes.
problem Classifying link diagrams on nonorientable surfaces.
method Classification through region crossing changes.
result Classification of link diagrams on nonorientable surfaces.
Region crossing change is a local operation on link diagrams. The behavior of region crossing change on is well understood. In this paper, we study the behavior of (modified) region crossing change on higher genus surfaces.
A region crossing change at a region of a spatial-graph diagram is a transformation changing every crossing on the boundary of the region. In this paper, it is shown that every spatial graph consisting of theta-curves can be unknotted by region crossing changes.
Spatial graphs of non-Eulerian or proper Eulerian planar graphs are unknottable by region crossing changes.
problem Unknottability of spatial graphs by region crossing changes.
method Region crossing changes to switch over/under relations within regions of spatial graph diagrams.
result Spatial graphs of non-Eulerian or proper Eulerian planar graphs are unknottable by region crossing changes.
Study examines how changing regions affects planar graphs.
problem Effect of region crossing change on planar trivalent graphs.
method Investigation of region crossing changes on planar trivalent graphs.
result Effect of region crossing change on planar trivalent graphs.
In this paper, we prove that region crossing change on a link diagram is an unknotting operation if and only if the link is proper. A description of the behavior of region crossing change on link diagrams is given. Furthermore we also discuss the relation between region crossing change and the Arf invariant of proper l…
Region crossing change is a local transformation on a knot or link diagram. We show that a region crossing change on a knot diagram is an unknotting operation, and we define the region unknotting numbers for a knot diagram and a knot.
New game defined on origami patterns, linking number introduced.
problem Defining a game on origami patterns.
method Introduced Region Select on origami crease patterns.
result Defined a new unlinking number.
In a recent work of Ayaka Shimizu, she defined an operation named region crossing change on link diagrams, and showed that region crossing change is an unknotting operation for knot diagrams. In this paper, we prove that region crossing change on a 2-component link diagram is an unknotting operation if and only…
New Boolean algebra method shows knot unknotting number is (c+1)/2.
problem Finding the minimum number of region crossing changes to unknot a knot.
method Boolean algebra applied to region crossing changes.
result Region unknotting number is (c+1)/2 for any knot with crossing number c.
K-color region select gamemath.GT
Generalizes region select game to -colored knot diagrams.
problem Play game on knot diagrams with multiple colors.
method Generalize region select game to -colored knot diagrams.
result Generalization of the region select game to -colored knot diagrams.
Gordian complexes of knots and virtual knots given by region crossing changes and arc shift movesmath.GT
Gordian complex of knots was defined by Hirasawa and Uchida as the simplicial complex whose vertices are knot isotopy classes in . Later Horiuchi and Ohyama defined Gordian complex of virtual knots using -move and forbidden moves. In this paper we discuss Gordian complex of knots by region crossing cha…
Using region crossing changes, we define a new invariant called the multi-region index of a knot. We prove that the multi-region index of a knot is bounded from above by twice the crossing number of the knot. In addition, we show that the minimum number of generators of the first homology of the double branched cover o…
In this paper we propose {\it a region choice problem} for a knot projection. This problem is an integral extension of Shimizu's 'region crossing change unknotting operation.' We show that there exists a solution of the region choice problem for all knot projections.
Region crossing change for a knot or a proper link is an unknotting operation. In this paper, we provide a sharp upper bound on the region unknotting number for a large class of torus knots and proper links. Also, we discuss conditions on torus links to be proper.
Analysis finds no evidence of banks managing deposit run risk prior to 2023 Regional Banking Crisis.
problem Determining factors for deposit run risk management before a regional banking crisis.
method Cross-sectional analysis of interest rate and equity use by banks.
result No evidence of banks managing deposit run risk via their balance sheet.
We present two families of knots which have straight number higher than crossing number. In the case of the second family, we have computed the straight number explicitly. We also give a general theorem about alternating knots that states adding an even number of crossings to a twist region will not change whether the …
Problems on region choices for knot and link diagrams solved using Alexander numbering.
problem Existence of solutions for region choice problems on knot and link diagrams.
method Alexander numbering for regions, alternative proofs, necessary and sufficient conditions.
result Existence of solutions for region choice problems on link diagrams.
A horospherical torus about a cusp of a hyperbolic manifold inherits a Euclidean similarity structure, called a cusp shape. We bound the change in cusp shape when the hyperbolic structure of the manifold is deformed via cone deformation preserving the cusp. The bounds are in terms of the change in structure in a neighb…
Targeted Cross-Validationstat.ML
Proposes TCV for selecting models in regions of interest.
problem Selecting models for specific regions of predictor variables.
method Targeted Cross-Validation (TCV) using weighted L2 loss.
result TCV is consistent in selecting the best performing candidate under weighted L2 loss.
Study on bit threads and their locking properties in holographic spacetimes.
problem Understanding the conditions under which regions can be locked in holographic spacetimes.
method Investigation of different density bounds and their implications on the locking of regions.
result Non-crossing regions can be locked under the most stringent bound, but crossing regions cannot.
The paper explores when specific knot operations simplify diagrams.
problem Understanding when arc crossing changes simplify knot diagrams.
method Examined two types of arc crossing changes on link diagrams and determined when they are unknotting operations.
result Any two crossing points in an alternating knot diagram are arc crossing change admissible.
New method to untangle knots using null-homologous twists.
problem Finding the minimum number of twists to convert a knot to the unknot.
method Using null-homologous twists as a generalization of crossing changes.
result The untwisting number is at most twice the surgery description number plus 1.
Alexander polynomial condition blocks crossing changes in some knots.
problem Cosmetic crossing changes in knot diagrams.
method Alexander polynomial obstruction for -space knots.
result Proved the conjecture for a five-parameter family of pretzel knots.
Score-Based Change-Point Detection and Region Localization for Spatio-Temporal Point Processesstat.ME
New method detects and locates changes in spatio-temporal point processes.
problem Detecting and localizing changes in spatio-temporal data.
method Score-based, likelihood-free approach estimating change time and region.
result The method provides theoretical guarantees on detection and localization accuracy.
We show that if a knot admits a prime, twist-reduced diagram with at least 4 twist regions and at least 6 crossings per twist region, then every non-trivial Dehn filling of that knot is hyperbolike. A similar statement holds for links. We prove this using two arguments, one geometric and one combinatorial. The combinat…
We introduce a topological combinatorial game called the Region Smoothing Swap Game. The game is played on a game board derived from the connected shadow of a link diagram on a (possibly non-orientable) surface by smoothing at crossings. Moves in the game are performed on regions of the diagram and can switch the direc…
A crossing in a knot is nugatory if changing the crossing does not change the knot type. Using an invariant of certain types of closed 3-braid diagrams, we show that if a closed 3-braid contains a nugatory crossing then its braid index is one or two. This proves a special case of a conjecture on nugatory crossings due …
We show that if K is a satellite knot which admits a generalized cosmetic crossing change of order q with |q| \geq 6, then K admits a pattern knot with a generalized cosmetic crossing change of the same order. As a consequence of this, we find that any prime satellite knot which admits a pattern knot that is fibered ca…
Proves special alternating knots can't have cosmetic crossings.
problem Cosmetic crossing changes in special alternating knots.
method Combines Lidman-Moore and Scharlemann-Thompson results.
result Special alternating knots do not admit non-nugatory crossing changes.
Shows large unknotting number for simple knots.
problem Finding minimum crossing changes for unknotting.
method Positive-to-negative crossing changes without increasing genus.
result Genus non-increasing totally positive unknotting number can be large.
New method detects changes by maximizing cross-entropy, outperforming existing techniques.
problem Detecting abrupt changes in data streams without labeled examples.
method Maximizes cross-entropy between segments to find change points, using dynamic programming.
result Outperforms three state-of-the-art approaches on challenging datasets.
The study finds lower bounds for the warping degree of a knot projection.
problem Determining the warping degree of a knot projection.
method Examining the maximal number of regions sharing no crossings for a fixed crossing in a knot projection.
result Lower bounds for the warping degree of a knot projection are provided.
The purpose of this article is to give a preliminary clarification on the relation between crossing number and crossing change. With a main focus on the span of X polynomial, we prove that, as our theorem claims, the crossing number of the link after crossing change can be estimated when certain conditions are met. At …
Extends knot invariant to filtered grid complexes.
problem Knot invariants and grid complexes.
method Combining Ozsváth-Szabó-Stipsicz crossing-change maps with Alishahi-Eftekhary l(K) invariant.
result Combinatorial formulation of knot invariant.
In this paper we define Crossing Change Alternating Knots (CCA knots) and their generalization: -CCA knots.
A knot complement admits a pseudo-hyperbolic structure by solving Thurston's gluing equations for an octahedral decomposition. It is known that a solution to these equations can be described in terms of region variables, also called -variables. In this paper, we consider the case when pinched octahedra appear as a b…
We analyze all monodromies of genus one fibered knots that possess clean or once-unclean arcs, and use this to determine all manifolds containing genus one fibered knots with generalized crossing changes resulting in another genus one fibered knot, and classify all such generalized crossing changes between two genus on…
We prove that the crossing changes, Delta moves, and sharp moves are unknotting operations on welded knots.
Colored Unlinkingmath.GT
In links with two components there are three different types of crossings: self-crossings in the first component, self crossings in the second component, and crossings between components. In this paper we examine the minimum number of crossing changes needed to unlink without changing the crossings between components. …
Mock Alexander Polynomialsmath.GT
The paper defines new polynomials for links and linkoids.
problem No specific problem stated; focus on new polynomials.
method Defined as sums over states of link or linkoid diagrams with .
result Constructed new polynomials for starred links and linkoids.
Diverse Instances-Weighting Ensemble based on Region Drift Disagreement for Concept Drift Adaptationcs.LG
DiwE uses regional distribution changes to create diverse ensemble classifiers for concept drift.
problem Handling concept drift in evolving data streams.
method DiwE measures diversity based on regional distribution disagreement and uses it to weight instances and select classifiers.
result DiwE outperforms other algorithms on various synthetic and real-world data stream benchmarks.
Proposes a method to solve deep neural networks' local minimum problem.
problem Local minimum problem in deep neural networks training.
method Transforms cross-entropy loss into risk-averse error criterion, adjusts RSI, and uses convexity region.
result Trained deep learning machine is expected to be inside a global minimum's attraction basin.
Let K' be a knot that admits no cosmetic crossing changes and let C be a non-trivial, prime, non-cable knot. Then any knot that is a satellite of C with winding number zero and pattern K' admits no cosmetic crossing changes. As a consequence we prove the nugatory crossing conjecture for Whitehead doubles of prime, non-…
Event-based models (EBM) are a class of disease progression models that can be used to estimate temporal ordering of neuropathological changes from cross-sectional data. Current EBMs only handle scalar biomarkers, such as regional volumes, as inputs. However, regional aggregates are a crude summary of the underlying hi…
We characterize cutting arcs on fiber surfaces that produce new fiber surfaces, and the changes in monodromy resulting from such cuts. As a corollary, we characterize band surgeries between fibered links and introduce an operation called Generalized Hopf banding. We further characterize generalized crossing changes bet…
Simple regional perturbations maintain model transferability while reducing adversarial example distortion.
problem Comparing efficacy of regional adversarial attacks without complex methods.
method Developed a simple regional adversarial perturbation attack using cross-entropy sign.
result Localized adversarial examples require significantly less norm distortion compared to non-local counterparts.