Related papers: Linking numbers and boundaries of varieties
C. Thomassen in \cite{[11]} suggested (see also \cite{[2]}, J. C.Bermond, C. Thomassen, Cycles in Digraphs - A survey, J. Graph Theory 5 (1981) 1-43, Conjectures 1.6.7 and 1.6.8) the following conjectures : 1. Every 3-strongly connected…
A connected graph $G$ with at least $2m + 2n + 2$ vertices which contains a perfect matching is $E(m, n)$-{\it extendable}, if for any two sets of disjoint independent edges $M$ and $N$ with $|M| = m$ and $|N|= n$, there is a perfect…
We construct geometrically two universal link invariants: universal ADO invariant and universal Jones invariant, as limits of invariants given by graded intersections in configuration spaces. More specifically, for a fixed level $\mathscr…
This paper investigates the relationship between the signature and the crossing number of knots and links. We refine existing theorems and provide a comprehensive classification of links with specific properties, particularly those with…
A rational knot or link can be put into a standard alternating format which has horizontal and vertical twist sites (double helices). The number and type of these twist sites are determined by terms of next-to-highest $z$-degree in…
Let $\alpha$ be a contact form on $S^3$, let $\xi$ be its Reeb vector-field and let $v$ be a non-singular vector-field in $ker\alpha$. Let $C_\beta$ be the space of curves $x$ on $S^3$ such $\dot x=a\xi+bv, \dot a=0, a \gneq 0$. Let $L^+$,…
Based on some analogies with the Hodge theory of isolated hypersurface singularities, we define Hodge-type numerical invariants (called H-numbers) of any, not necessarily algebraic, link in $S^3$. They contain the same information as the…
If two G-manifolds are G-cobordant then characteristic numbers corresponding to the fixed point sets (submanifolds) of subgroups of G and to normal bundles to these sets coincide. We construct two analogues of these characteristic numbers…
We prove some necessary conditions for a link to be either concordant to a quasi-positive link, quasi-positive, positive, or the closure of a positive braid. The main applications of our results are a characterisation of positive links with…
Knots and links in 3-manifolds are studied by applying intersection invariants to singular concordances. The resulting link invariants generalize the Arf invariant, the mod 2 Sato-Levine invariants, and Milnor's triple linking numbers.…
In the first part of this paper we develop some theorems in linear algebra applicable to information theory when all random variables involved are linear functions of the individual bits of a source of independent bits. We say that a…
On a real ($\mathbb F=\mathbb R$) or complex ($\mathbb F=\mathbb C$) analytic connected 2-manifold $M$ with empty boundary consider two vector fields $X,Y$. We say that $Y$ {\it tracks} $X$ if $[Y,X]=fX$ for some continuous function…
The {\em disjointness graph} of a set system is a graph whose vertices are the sets, two being connected by an edge if and only if they are disjoint. It is known that the disjointness graph $G$ of any system of segments in the plane is {\em…
A celebrated result in bifurcation theory is that global connected sets of non-trivial solutions bifurcate from trivial solutions at non-zero eigenvalues of odd algebraic multiplicity of the linearized problem when the operators involved…
In this paper, we prove the conjectures of Gharakhloo and Welker (2023) that the positive matching decomposition number (pmd) of a $3$-uniform hypergraph is bounded from above by a polynomial of degree $2$ in terms of the number of…
The 1-2-3 Conjecture asks whether almost all graphs can be (edge-)labelled with $1,2,3$ so that no two adjacent vertices are incident to the same sum of labels. In the last decades, several aspects of this problem have been studied in…
Joinings are fundamental global objects in ergodic theory, yet in compact metric models one naturally observes only finite orbit-distance patterns. We bridge this gap by introducing multi-particle distance arrays, which sample finite orbit…
A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$…
This paper gives new and elementary combinatorial topological proofs of the classification of unoriented and oriented rational knots and links. These proofs are based on the known classification of alternating knots through flyping, and the…
We derive an asymptotic formula for the number of strongly connected digraphs with $n$ vertices and $m$ arcs (directed edges), valid for $m-n\to\infty$ as $n\to \infty$ provided $m=O(n\log n)$. This fills the gap between Wright's results…