中文
相关论文

相关论文: Bridge Positions of Links That Cannot Be Monotonic…

200 篇论文

We show that a random link defined by random bridge splitting is hyperbolic with asymptotic probability 1.

几何拓扑 · 数学 2016-05-25 Kazuhiro Ichihara , Jiming Ma

We describe a new class of minimal link diagrams. This class includes certain alternating diagrams, the standard diagrams of all torus links, and numerous homogeneous diagrams whose minimality has not been proven before. Besides, we…

几何拓扑 · 数学 2020-12-09 Ilya Alekseev

Dietrich Braess while working on traffic modelling, noticed that traffic flow in a network can be worsened by adding extra edges to an existing network. This seemingly counterintuitive phenomenon is known as the Braess paradox. We consider…

量子物理 · 物理学 2021-12-03 Abhishek Banerjee , Pratapaditya Bej

Closed 3-string braids admit many bandings to two-bridge links. By way of the Montesinos Trick, this allows us to construct infinite families of knots in the connected sum of lens spaces L(r,1) # L(s,1) that admit a surgery to a lens space…

几何拓扑 · 数学 2013-06-05 Kenneth L. Baker

The hyperbolic volume of a link complement is known to be unchanged when a half-twist is added to a link diagram, and a suitable 3-punctured sphere is present in the complement. We generalize this to the simplicial volume of link…

几何拓扑 · 数学 2019-02-20 Oliver Dasbach , Anastasiia Tsvietkova

We extend Smale's singular bridge principle [Ann. of Math. 130 (1989), 603-642] for $n$-dimensional strictly stable minimal cones in $\mathbb{R}^{n+1}$ $(n \geq 7$) to arbitrary codimension and each $n \geq 3$. We then apply the procedure…

微分几何 · 数学 2025-03-10 Bryan Dimler

We modify an approach of Johnson to define the distance of a bridge splitting of a knot in a 3-manifold using the dual curve complex and pants complex of the bridge surface. This distance can be used to determine a complexity, which becomes…

几何拓扑 · 数学 2014-02-26 Alexander Zupan

There is empirical evidence supporting the claim that almost all cubic non-Hamiltonian graphs are bridge graphs. In this paper, we pose a related conjecture and prove that the original claim holds for non-3-connected graphs if the…

组合数学 · 数学 2019-08-29 Rishi Advani

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…

There are three commonly known definitions of the bridge index. These definitions come from combinatorial knot theory, Morse theory, and geometry. In this paper, we prove that the danceability index is a fourth equivalent definition of the…

几何拓扑 · 数学 2024-12-23 Sol Addison , Nancy Scherich , Lila Snodgrass , Everett Sullivan

In this paper, we give a necessary and sufficient condition for an essential simple loop on a $2$-bridge sphere in an even Heckoid orbifold for the trivial knot to be null-homotopic, peripheral or torsion in the orbifold. We also give a…

群论 · 数学 2015-02-17 Donghi Lee , Makoto Sakuma

We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.

几何拓扑 · 数学 2007-05-24 Makoto Ozawa

The obstruction set for graphs with knotless embeddings is not known, but a recent paper of Goldberg, Mattman, and Naimi indicates that it is quite large. Almost all known obstructions fall into four Triangle-Y families and they ask if…

组合数学 · 数学 2023-01-25 Danielle Gregg , Thomas W. Mattman , Zachary Porat , George Todd

It has been conjectured that the algebraic crossing number of a link is uniquely determined in minimal braid representation. This conjecture is true for many classes of knots and links. The Morton-Franks-Williams inequality gives a lower…

几何拓扑 · 数学 2009-07-07 Keiko Kawamuro

Recent years have witnessed a surge of biological interest in the minimum spanning tree (MST) problem for its relevance to automatic model construction using the distances between data points. Despite the increasing use of MST algorithms…

定量方法 · 定量生物学 2015-11-02 Momoko Hayamizu , Hiroshi Endo , Kenji Fukumizu

We pose a natural generalization to the well-studied and difficult no-three-in-a-line problem: How many points can be chosen on an $n \times n$ grid such that no three of them form an angle of $\theta$? In this paper, we classify which…

组合数学 · 数学 2023-11-23 Natalie Dodson , Anant Godbole , Dashleen Gonzalez , Ryan Lynch , Lani Southern

We prove that every smoothly embedded surface in a 4--manifold can be isotoped to be in bridge position with respect to a given trisection of the ambient 4--manifold; that is, after isotopy, the surface meets components of the trisection in…

几何拓扑 · 数学 2022-10-19 Jeffrey Meier , Alexander Zupan

In a linear chord diagram a short chord joins adjacent vertices while a bubble is a region devoid of short chords. We define a bridge to be a chord joining a vertex interior to a bubble to one exterior to it. Building on earlier work, we…

组合数学 · 数学 2024-09-02 Donovan Young

In this paper, we give a simple proof for the small cancellation conditions of the upper presentations of 2-bridge link groups, which holds the key to the proof of the main result of [1]. We also give an alternative proof of the main result…

群论 · 数学 2012-04-20 Daewa Kim , Donghi Lee

In this paper, we show the trivializing number of all minimal diagrams of positive 2-bridge knots and study the relation between the trivializing number and the unknotting number for a part of these knots.

几何拓扑 · 数学 2016-02-24 Kazuhiko Inoue
‹ 上一页 1 8 9 10 下一页 ›