科研速览 · Science Skim继续刷下去 · Keep skimming →
◆ Journal of the Mathematical Society of Japan2026-09-02· Bridge (graph theory)

Bridge positions of links that cannot be monotonically simplified

Puttipong Pongtanapaisan, Daniel Rodman

原始摘要(英文原文)· Original abstract
For any pair of integers $m$ and $n$ such that $3 < m < n$, we provide an infinite family of links where each link in the family has a locally minimal $n$-bridge position and a globally minimal $m$-bridge position. We accomplish this by applying the criterion of Takao et al. The $n$-bridge position is interesting because the corresponding bridge sphere is unperturbed, so it must be perturbed at least once before it can be de-perturbed to attain a globally minimal $m$-bridge sphere.
读原文 · Read the paper ↗

AI 追问PRO

登录后使用 AI 追问

讨论区

登录后参与讨论

相关论文 · Related

Bridge positions of links that cannot be monotonically simplified — 科研速览 Science Skim