Related papers: An independence system as knot invariant
In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the…
Let $\alpha$ be a map from the set of all knot types ${\mathcal K}$ to a set $X$. Let $\beta$ be a map from ${\mathcal K}$ to a set $Y$. We define the relation between $\alpha$ and $\beta$ to be the image of a map $(\alpha,\beta)$ from…
In this paper, a regional knot invariant is constructed. Like the Wirtinger presentation of a knot group, each planar region contributes a generator, and each crossing contributes a relation. The invariant is call a tridle of the link. As…
In this paper, we give a precise and workable definition of a quantum knot system, the states of which are called quantum knots. This definition can be viewed as a blueprint for the construction of an actual physical quantum system.…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…
To each rail knotoid we associate two unoriented knots along with their oriented counterparts, thus deriving invariants for rail knotoids based on these associations. We then translate them to invariants of rail isotopy for rail arcs.
We study a matrix-based notion of matroid representation over local commutative rings obtained by replacing linear independence with modular independence. This construction always defines an independence system, though not necessarily a…
We discuss different invariants of knots and links that depend on a primitive root of unity. We clarify the definitions of existing invariants with the Reshetikhin-Turaev method, present the generalization of ADO invariants to…
The altenating knots, links and twists projected on the S_2 sphere are identified with the phase Space of a Hamiltonian dynamic system of one degree of freedom. The saddles of the system correspond to the crossing points, the edges, to the…
We introduce the warping matrix which is a new description of oriented knots from a viewpoint of warping degree.
We propose an automated method for computing inductive invariants applied to check deadlock-freedom for parametric component-based systems. The method generalizes the approach for computing structural trap invariants from bounded to…
The notion of a pseudoknot is defined as an equivalence class of knot diagrams that may be missing some crossing information. We provide here a topological invariant schema for pseudoknots and their relatives, 4-valent rigid vertex spatial…
We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal number of Reidemeister moves needed to pass between certain pairs of knot diagrams.
This paper contains the first knot polynomials which can distinguish the orientations of classical knots and which make no excplicit use of the knot group. But they make extensive use of the meridian and of the longitude in a geometric way.…
We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…
Shelling orders are a ubiquitous tool used to understand invariants of cell complexes. Significant effort has been made to develop techniques to decide when a given complex is shellable. However, empirical evidence shows that some shelling…
The genus of knots is a one of the fundamental invariant and can be seen as a complexity of knots. In this paper, we give a lower bound of genus using Dehornoy floor, which is a measure of complexity of braids in terms of braid ordering.
We consider knot theories possessing a {\em parity}: each crossing is decreed {\em odd} or {\em even} according to some universal rule. If this rule satisfies some simple axioms concerning the behaviour under Reidemeister moves, this leads…
We presents an independence relation on sets, one can define dimension by it, assuming that we have an abstract elementary class with a forking notion that satisfies the axioms of a good frame minus stability.