paper

An Algorithmic Search for Knots Bounding Möbius Bands in

arXiv:2607.23582

Abstract

This study examines the smooth non-orientable -genus of knots using a large-scale computational search. Knot invariant obstructions were computed, and existing computational algorithms were extended to identify prime knots in of crossing number at most that bound Möbius bands in . The findings significantly expand the known examples of knots of non-orientable -genus equal to and contribute new data relevant to the study of the non-orientable -genus.

29 pages, 8 figures