- The paper introduces a novel framework to define hosting and friendship relations among knots through minimal genus Seifert surfaces.
- The paper demonstrates that no single knot can serve as a universal host due to inherent topological constraints quantified by tunnel numbers and genus.
- The paper computes explicit examples, such as the trefoil’s hosting set, and establishes asymmetric and symmetric inter-knot relations with significant graph-theoretic implications.
Hosting and Friendship of Knots on Minimal Genus Seifert Surfaces
Introduction and Context
The paper introduces and systematically explores novel relations—hosting and friendship—between knots, formulated via the embedding of knot types as simple closed curves on minimal genus Seifert surfaces in S3. By defining the set S(K) of knot types realized this way for a given knot K, the work extends the study of Seifert surfaces beyond their conventional use in bounding knots, considering instead how Seifert surfaces interrelate knots through their internal topology.
This analytic lens brings forth both a directed relation (K→J if J∈S(K), termed hosting) and a symmetric variant (K↔J if J and K are mutually present in each other’s hosting sets, termed friendship), establishing a rich framework for understanding the organization and global interaction of knots through their minimal genus Seifert surfaces.
The key constructions are:
- S(K): The set of nontrivial knot types represented by simple closed curves on some minimal genus Seifert surface of K.
- Hosting: S(K)0 if S(K)1; this relation is generally asymmetric.
- Friendship: S(K)2 if both S(K)3 and S(K)4; this is symmetric but not necessarily transitive.
- Universal Host: A knot S(K)5 with S(K)6 (the set of all knot types except the unknot); a universal host family is a class S(K)7 with every knot hosted by some S(K)8.
The hosting relation can be iterated, generating the hosting quiver (a directed graph with arrows for S(K)9) and higher reachability sets K0 analogous to forward closures in directed graphs. The symmetric, undirected friendship graph is also defined and investigated in terms of connectivity and path lengths.
Major Theoretical Results
Universal Host Families and Nonexistence of Universal Host Knots
A central theorem is that while the family of torus knots forms a universal host family (every knot appears on a minimal genus Seifert surface of some torus knot, as per Lyon’s theorem), no single knot is a universal host:
- Theoretical Bound: For fixed K1, there is a uniform upper bound on the tunnel number and Heegaard genus of hosted knots K2, dependent only on K3 via invariants of Seifert surfaces and their exteriors. In particular,
K4
where K5 denotes tunnel number, K6 is the genus of K7, and K8 captures maximal geometric complexity across all minimal genus Seifert surfaces for K9.
- Existence Theorem: For any K→J0, there exists K→J1 with tunnel number exceeding this bound, guaranteeing K→J2. Hence, no knot is a universal host; universal hosting is a collective phenomenon realizable only at the family level.
Explicit Computations: The Trefoil Case
The study computes K→J3, the hosting set of the trefoil, explicitly:
- The fiber surface (a once-punctured torus) produces all knots corresponding to primitive slopes K→J4 with K→J5 and coprime, up to orientation, and their genus is given by a precise formula in terms of K→J6 and K→J7.
- Strong inclusion and exclusion results are established, e.g., K→J8 but K→J9.
Asymmetry and Friendship Pairs
- There exist knot pairs with asymmetric hosting: e.g.,
- J∈S(K)0 (the trefoil appears on a minimal genus Seifert surface of the figure-eight) but J∈S(K)1.
- Concrete friendship pairs: Combining explicit calculation and monotonicity of hosting for torus knots,
- J∈S(K)2 is established; both knots appear on minimal genus Seifert surfaces of each other.
Structural and Graph-Theoretical Implications
- The friendship graph is studied in terms of connectivity and distance, with definitions of J∈S(K)3th friendship (pairs linked by paths of length J∈S(K)4 in the graph).
- Hosting sets J∈S(K)5 and their iterated closures J∈S(K)6 facilitate a preorder on knots, reflecting reachability via the hosting relation.
- The nonexistence of universal host knots and the rigidity revealed in friendship relations suggest a highly structured and nontrivial global architecture for the set of knots organized by their minimal genus Seifert surfaces.
Prospective Problems and Speculative Directions
Several open problems and conjectures are posed:
- Rigidity problems: Is a knot uniquely determined by its hosting set J∈S(K)7? By the set of knots hosting it J∈S(K)8?
- Classification and connectivity: Is the friendship graph connected? Which (if any) families beyond torus knots are universal host families?
- Global structure: What are the combinatorial and geometric properties of the hosting quiver and friendship graph? How prevalent is finite distance in the friendship graph?
Furthermore, the framework exhibits categorical overtones, with questions paralleling Yoneda-type rigidity: to what extent does ambient topology dictate, or is dictated by, the directed and undirected knot relations induced by Seifert surface embeddings?
Conclusion
This paper constructs and analyzes a novel class of relations between knots grounded in the intrinsic topology of Seifert surfaces, yielding powerful nonexistence theorems, precise computational techniques for explicit knots, and illuminating a new landscape of graph-theoretic, combinatorial, and categorical structures in knot theory. The results not only clarify how knots are organized via Seifert surfaces but also pose fundamental questions about the interplay between geometric complexity, surface embeddings, and knot adjacency, charting clear avenues for future research on the algebraic and topological organization of knots in J∈S(K)9.