Related papers: On Crossing Ball Structure in Knot and Link Comple…
We introduce and study knots and links in 2-dimensional complexes. In particular, we define linking numbers for oriented two-component links in 2-complexes and a Kauffman-type bracket polynomial for links in 2-complexes. We also discuss…
We prove a linear upper bound for the number of singular points on the boundary of a quadrature domain, improving a previously known quadratic bound due to Gustafsson \cite{Gus88}. This linear upper bound on the number of boundary double…
It is shown that if a link in 3-space bounds a proper oriented surface (without closed component) in the upper half 4-space, then the link bounds a proper oriented ribbon surface in the upper half 4-space which is a renewal embedding of the…
We present two practical and widely applicable methods, including some criteria and a general procedure, for detecting Brunnian property of a link, if each component is known to be unknot. The methods are based on observation and handwork.…
We define the Witt coindex of a link with non-trivial Alexander polynomial, as a concordance invariant from the Seifert form. We show that it provides an upper bound for the (locally flat) slice Euler characteristic of the link, extending…
The first examples of totally geodesic Seifert surfaces are constructed for hyperbolic knots and links, including both free and totally knotted surfaces. Then it is proved that two bridge knot complements cannot contain totally geodesic…
We generalize the results of [AS], finding large classes of totally geodesic Seifert surfaces in hyperbolic knot and link complements, each the lift of a rigid 2-orbifold embedded in some hyperbolic 3-orbifold. In addition, we provide a…
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
It is known that any tame hyperbolic 3-manifold with infinite volume and a single end is the geometric limit of a sequence of finite volume hyperbolic knot complements. Purcell and Souto showed that if the original manifold embeds in the…
Building complex software systems necessitates the use of component-based architectures. In theory, of the set of components needed for a design, only some small portion of them are "custom"; the rest are reused or refactored existing…
We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…
We introduce a novel model of multipartite entanglement based on topological links, generalizing the graph/hypergraph entropy cone program. We demonstrate that there exist link representations of entropy vectors which provably cannot be…
We generalize H. Seifert's algorithm for finding a Seifert surface for a knot or link. The generalization applies to "framed oriented measured lamination links." For knots, a Seifert surface determines a unique framing. In our setting, we…
Welded knotted objects are a combinatorial extension of knot theory, which can be used as a tool for studying ribbon surfaces in $4$-space. A finite type invariant theory for ribbon knotted surfaces was developped by Kanenobu, Habiro and…
In the note, we give a proof, based on the Generalized Thom Conjecture, of Bennequin's Theorem on upper bound for the Euler number of a link which is considered as a closed braid. A lower bound for the Euler number of a link is also given.
Understanding the notion of a model is not always easy in logic courses. Hence, tools such as Euler diagrams are frequently applied as informal illustrations of set-theoretical models. We formally investigate Euler diagrams as an…
In this paper, we apply Kauffman bracket skein algebras to develop a theory of skein adequate links in thickened surfaces. We show that any alternating link diagram on a surface is skein adequate. We apply our theory to establish the first…
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…
This chapter from the upcoming Handbook of Knot Theory (eds. Menasco and Thistlethwaite) shows how to construct hyperbolic structures on link complements and perform hyperbolic Dehn filling. Along with a new elementary exposition of the…
I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…