Crossing number of (closed) homogeneous braids
St. Petersburg Mathematical Journal · 22.04.2026 · 36 (5) · 701-710
DOI: 10.1090/spmj/1879 ↗Kurz gefasst
Fachartikel in der Zeitschrift St. Petersburg Mathematical Journal, online erschienen am 22.04.2026. Verfasst von I. Alekseev. Die Arbeit nennt 48 Literaturangaben.
Abstract (Originalsprache)
The Polyak and Brandenbursky invariants are applied to estimate the crossing number of (closed) braids and extend the previously known minimality criteria for diagrams of positive and alternating braids to homogeneous ones. In particular, it is proved that a diagram of a homogeneous braid is minimal if and only if this diagram is homogeneous. These results lay the groundwork for a potential solution to the recognition problem for homogeneous knots and links. The approach developed here is conceptually similar to recognizing alternating links on the basis of the Tait conjectures.
Zitieren
APA
Alekseev, I. (2026). Crossing number of (closed) homogeneous braids. St. Petersburg Mathematical Journal, 36(5), 701-710. https://doi.org/10.1090/spmj/1879
Vancouver
Alekseev I. Crossing number of (closed) homogeneous braids. St. Petersburg Mathematical Journal. 2026;36(5):701-710. doi:10.1090/spmj/1879
BibTeX
@article{Alekseev2026,
author = {Alekseev, I.},
title = {Crossing number of (closed) homogeneous braids},
journal = {St. Petersburg Mathematical Journal},
year = {2026},
volume = {36},
number = {5},
pages = {701--710},
doi = {10.1090/spmj/1879}
}
EUVIMED