DOAJ Open Access 2020

Asymptotic laws for knot diagrams

Harrison Chapman

Lihat Sumber DOI

Abstrak

We study random knotting by considering knot and link diagrams as decorated, (rooted) topological maps on spheres and sampling them with the counting measure on from sets of a fixed number of vertices n. We prove that random rooted knot diagrams are highly composite and hence almost surely knotted (this is the analogue of the Frisch-Wasserman-Delbruck conjecture) and extend this to unrooted knot diagrams by showing that almost all knot diagrams are asymmetric. The model is similar to one of Dunfield, et al.

Topik & Kata Kunci

Mathematics

Penulis (1)

Harrison Chapman

Format Sitasi

APA MLA BibTeX

Chapman, H. (2020). Asymptotic laws for knot diagrams. https://doi.org/10.46298/dmtcs.6329

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.6329

Informasi Jurnal

Tahun Terbit: 2020
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.6329
Akses: Open Access ✓