Related papers: The Connectivity Order of Links
Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…
Given a link map f into a manifold of the form Q = N \times \Bbb R, when can it be deformed to an unlinked position (in some sense, e.g. where its components map to disjoint \Bbb R-levels) ? Using the language of normal bordism theory as…
This paper is a generalization of the author's previous work on link homotopy to link concordance. We show that the only real-valued finite type link concordance invariants are the linking numbers of the components.
This paper has two parts. First, we recall and detail the definition of the Grothendieck topos of a connectivity space, that is the topos of sheaves on such a space. In the second part, we prove that every finite connectivity space is…
Given any unoriented link diagram, a group of new knot invariants are constructed. Each of them satisfies a generalized 4 term skein relation. The coefficients of each invariant is from a commutative ring. Homomorphisms and representations…
Cut-diagrams are diagrammatic objects, defined in dimensions 1 and 2, that generalize links in 3-space and surface-links in 4-space; in dimension 1, this coincides with the theory of welded links. Using cut-diagrams, we introduce an…
In this paper, we define some polynomial invariants for virtual knots and links. In the first part we use Manturov's parity axioms to obtain a new polynomial invariant of virtual knots. This invariant can be regarded as a generalization of…
We explore indefinite causal order between events in the context of quasiclassical spacetimes in superposition. We introduce several new quantifiers to measure the degree of indefiniteness of the causal order for an arbitrary finite number…
We proved in another paper that every connected graph can be realized as the cut locus of some point on some riemannian surface. Here we give upper bounds on the number of such realizations.
A preferential arrangement of a finite set is an ordered partition. Associated with each such ordered partition is a chain of subsets or blocks endowed with a linear order. The chain may be split into sections by the introduction of a…
End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a…
A linkage of order k of a graph G is a subgraph with k components, each of which is a path. A linkage is vital if it spans all vertices, and no other linkage connects the same pairs of end vertices. We give a characterization of the graphs…
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.…
Among all characteristics exhibited by natural and man-made networks the small-world phenomenon is surely the most relevant and popular. But despite its significance, a reliable and comparable quantification of the question `how small is a…
In previous work, the author defined the intersection graph of a chord diagram associated with string links (as in the theory of finite type invariants). In this paper, we classify the trees which can be obtained as intersection graphs of…
A $k$-connected set in an infinite graph, where $k > 0$ is an integer, is a set of vertices such that any two of its subsets of the same size $\ell \leq k$ can be connected by $\ell$ disjoint paths in the whole graph. We characterise the…
We present a construction of invariants for links using an isomorphism theorem for affine Yokonuma--Hecke algebras. The isomorphism relates affine Yokonuma--Hecke algebras with usual affine Hecke algebras. We use it to construct a large…
We generalize Milnor link invariants to all types of surface-links in $4$--space (possibly with boundary). This is achieved by using the notion of cut-diagram, which is a 2-dimensional generalization of Gauss diagrams, associated to…
A path integral on a link complement of a three-sphere fixes a vector (the "link state") in Chern-Simons theory. The link state can be written in a certain basis with the colored link invariants as its coefficients. We use symmetric webs to…
For each positive integer $n$, we define the divisibility relation graph $D_n$ whose vertex set is the set of divisors of $n$, and in which two vertices are adjacent if one is a divisor of the other. This type of graph is a special case of…