Metraipolis › archive › dc_aa35275063df

Ascending, Bridge, and Unknotting Numbers of Knotted Graphs — arXiv:2610.00788

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.00788
License (as archived)
CC0-1.0
Archived
2026-10-06T17:40:46.255Z
SHA-256 of the archived text
6b8c513c43b4246eee697ccf7246f6526f1629dff8ab75045d522983400aa1e3
Stable URL of this page
https://metraipolis.com/documento/dc_aa35275063df

How to cite

Ascending, Bridge, and Unknotting Numbers of Knotted Graphs — arXiv:2610.00788 — arXiv (en), https://arxiv.org/abs/2610.00788 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aa35275063df (Metraipolis archive dc_aa35275063df, sha256 6b8c513c43b4246eee697ccf7246f6526f1629dff8ab75045d522983400aa1e3)
BibTeX
@misc{dcaa35275063df,
  title = {Ascending, Bridge, and Unknotting Numbers of Knotted Graphs — arXiv:2610.00788},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.00788},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aa35275063df; sha256 6b8c513c43b4246eee697ccf7246f6526f1629dff8ab75045d522983400aa1e3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.00788. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this paper we define the ascending number and bridge number for virtual and welded spatial graphs. We prove that the former admits a lower bound in terms of the latter. This relationship allows us to compare different notions of unknotting virtual spatial graphs by crossing changes.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Geometric Topology (math.GT).
Pagina del lavoro: https://arxiv.org/abs/2610.00788 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T16:06:55.824Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).