Related papers: An independence system as knot invariant
In this article we discuss applications of neural networks to recognising knots and, in particular, to the unknotting problem. One of motivations for this study is to understand how neural networks work on the example of a problem for which…
Invariant manifolds are important sets arising in the stability theory of dynamical systems. In this article, we take a brief review of invariant sets. We provide some results regarding the existence of invariant lines and parabolas in…
This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…
We refine the Polyak-Viro Gauss diagram formula for the Vassiliev invariant of order two in a very simple way for the 2-cable of a framed long knot. Surprisingly, the resulting isotopy invariant of framed knots can detect already the…
We define a knot/link invariant using set theoretical solutions $(X,\sigma)$ of the Yang-Baxter equation and non commutative 2-cocycles. We also define, for a given $(X,\sigma)$, a universal group Unc(X) governing all 2-cocycles in $X$, and…
We present two different constructions of invariants for Legendrian knots in the standard contact space $\R^3$. These invariants are defined combinatorially, in terms of certain planar projections, and are useful in distinguishing…
We study Coxeter racks over $\mathbb{Z}_n$ and the knot and link invariants they define. We exploit the module structure of these racks to enhance the rack counting invariants and give examples showing that these enhanced invariants are…
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…
The warping degree of an oriented knot diagram is the minimal number of crossing changes which are required to obtain a monotone knot diagram from the diagram. The minimal warping degree of a knot is the minimal value of the warping degree…
An independent set in a graph is a set of pairwise non-adjacent vertices. The independence number $\alpha{(G)}$ is the size of a maximum independent set in the graph $G$. The independence polynomial of a graph is the generating function for…
The state-sum invariants for knots and knotted surfaces defined from quandle cocycles are described using the Kronecker product between cycles represented by colored knot diagrams and a cocycle of a finite quandle used to color the diagram.…
Given any oriented link diagram, one can construct knot invariants using skein relations. Usually such a skein relation contains three or four terms. In this paper, the author introduces several new ways to smooth a crossings, and uses a…
Generalizing a well known theorem for finite matroids, we prove that for every (infinite) connected matroid M there is a unique tree T such that the nodes of T correspond to minors of M that are either 3-connected or circuits or cocircuits,…
Recent work in the area of interdependent networks has focused on interactions between two systems of the same type. However, an important and ubiquitous class of systems are those involving monitoring and control, an example of…
Biracks are algebraic structures related to knots and links. We define a new enhancement of the birack counting invariant for oriented classical and virtual knots and links via algebraic structures called birack dynamical cocycles. The new…
This paper describes a polynomial invariant of virtual knots that is defined in terms of an integer labeling of the virtual knot diagram. This labeling is seen to derive from an essentially unique structure of affine flat biquandle for flat…
Given a knot K in the 3-sphere, consider a singular disk bounded by K and the intersections of K with the interior of the disk. The absolute number of intersections, minimised over all choices of singular disk with a given algebraic number…
We propose a method for learning Markov network structures for continuous data without invoking any assumptions about the distribution of the variables. The method makes use of previous work on a non-parametric estimator for mutual…
Any knot group is the image of the group of a prime knot by a homomorphism that preserves peripheral structure. In fact, there are infinitely many such prime knots. A related partial order on knots is defined, and its properties are…
Starting from elementary considerations about independence and Markov processes in classical probability we arrive at the new concept of conditional monotone independence (or operator-valued monotone independence). With the help of product…