中文
相关论文

相关论文: The BiEntropy of Some Knots on the Simple Cubic La…

200 篇论文

A well-known algorithm for unknotting knots involves traversing a knot diagram and changing each crossing that is first encountered from below. The minimal number of crossings changed in this way across all diagrams for a knot is called the…

几何拓扑 · 数学 2024-09-27 Lowell Davis , Jeffrey Meier

The paper investigates biorderability of knot quandles of prime knots up to eight crossings. We prove that knot quandles of knots $6_3$, $8_7$, $8_8$, $8_{10}$ and $8_{16}$ can not be biorderable. However, we see that knot quandles of knots…

几何拓扑 · 数学 2025-05-27 Vaishnavi Gupta , Hitesh Raundal

We present an enhanced prime decomposition theorem for knots that gives the isotopy classes of composite knots that can be constructed from a given list of prime factors (allowing for the mirroring and orientation reversing for each…

几何拓扑 · 数学 2014-11-14 Matt Mastin

The concordance orders of many algebraic order two knots of ten or fewer crossings have been heretofore unknown. We use Casson-Gordon invariants and twisted Alexander polynomials to find that, in all but one case, these knots do not have…

几何拓扑 · 数学 2007-05-23 Andrius Tamulis

Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…

几何拓扑 · 数学 2018-12-03 Yoav Moriah , Jessica S. Purcell

We introduce an alternative stratification of knots: by the size of lattice on which a knot can be first met. Using this classification, we find ratio of unknots and knots with more than 10 minimal crossings inside different lattices and…

几何拓扑 · 数学 2023-09-07 E. Lanina , A. Popolitov , N. Tselousov

Ascending numbers are determined for 64 knots with at most n=10 crossings. After proving the theorem about the signature of alternating knot families, we distinguished all families of knots obtained from generating alternating knots with at…

几何拓扑 · 数学 2011-07-13 Slavik Jablan

A knot is a closed loop in space without self-intersection. Two knots are equivalent if there is a self homeomorphism of space bringing one onto the other. An arc presentation is an embedding of a knot in the union of finitely many half…

几何拓扑 · 数学 2024-06-25 Hwa Jeong Lee , Alexander Stoimenow , Gyo Taek Jin

We investigate the bi-orderability of two-bridge knot groups and the groups of knots with 12 or fewer crossings by applying recent theorems of Chiswell, Glass and Wilson. Amongst all knots with 12 or fewer crossings (of which there are…

代数拓扑 · 数学 2019-08-15 Adam Clay , Colin Desmarais , Patrick Naylor

We consider diagrams of links in $S^2$ obtained by projection from $S^3$ with the Hopf map and the minimal crossing number for such diagrams. Knots admitting diagrams with at most one crossing are classified. Some properties of these knots…

几何拓扑 · 数学 2020-06-25 Maciej Mroczkowski

We consider braids with repeating patterns inside arbitrary knots which provides a multi-parametric family of knots, depending on the "evolution" parameter, which controls the number of repetitions. The dependence of knot (super)polynomials…

高能物理 - 理论 · 物理学 2014-01-30 A. Mironov , A. Morozov , An. Morozov

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…

几何拓扑 · 数学 2016-10-12 Jason Cantarella , Harrison Chapman , Matt Mastin

The alternating knots, links and twists projected on the $S_2$ sphere were identified with the phase space of a Hamiltonian dynamic system of one degree of freedom. The saddles of the system correspond to the crossings, the edges correspond…

几何拓扑 · 数学 2007-12-14 E. Piña

We have developed a reinforcement learning agent that often finds a minimal sequence of unknotting crossing changes for a knot diagram with up to 200 crossings, hence giving an upper bound on the unknotting number. We have used this to…

We present the complete classification of the subgroup of the classical knot concordance group generated by knots with eight or fewer crossings. Proofs are presented in summary. We also describe extensions of this work to the case of nine…

几何拓扑 · 数学 2020-09-01 Julia Collins , Paul Kirk , Charles Livingston

We study spectral gaps of cellular differentials for finite cyclic coverings of knot complements. Their asymptotics can be expressed in terms of irrationality exponents associated with ratios of logarithms of algebraic numbers determined by…

几何拓扑 · 数学 2017-06-07 Holger Kammeyer

It is known that each knot has a semimeander diagram (i. e. a diagram composed of two smooth simple arcs), however the number of crossings in such a diagram can only be roughly estimated. In the present paper we provide a new estimate of…

几何拓扑 · 数学 2026-03-26 Yury Belousov

It is known that the arc index of alternating knots is the minimal crossing number plus two and the arc index of prime nonalternating knots is less than or equal to the minimal crossing number. We study some cases when the arc index is…

几何拓扑 · 数学 2011-06-15 Gyo Taek Jin , Hwa Jeong Lee

We use Heegaard Floer homology to give obstructions to unknotting a knot with a single crossing change. These restrictions are particularly useful in the case where the knot in question is alternating. As an example, we use them to classify…

几何拓扑 · 数学 2007-05-23 Peter Ozsvath , Zoltan Szabo

We derive new obstructions to periodicity of classical knots by employing the Heegaard Floer correction terms of the finite cyclic branched covers of the knots. Applying our results to two fold covers, we demonstrate through numerous…

几何拓扑 · 数学 2014-09-23 Stanislav Jabuka , Swatee Naik
‹ 上一页 1 2 3 10 下一页 ›