Related papers: Invariant Bridges Between Four Successive Points: …
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…
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…
We define an isotopy invariant of embeddings N -> R^m of manifolds into Euclidean space. This invariant together with the \alpha-invariant of Haefliger-Wu is complete in the dimension range where the \alpha-invariant could be incomplete. We…
Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…
We initiate the study of classical knots through the homotopy class of the n-th evaluation map of the knot, which is the induced map on the compactified n-point configuration space. Sending a knot to its n-th evaluation map realizes the…
Using basic topology and linear algebra, we define a plethora of invariants of boundary links whose values are power series with noncommuting variables. These turn out to be useful and elementary reformulations of an invariant originally…
In this paper, we formulate a construction of ideal coset invariants for surface-links in $4$-space using invariants for knots and links in $3$-space. We apply the construction to the Kauffman bracket polynomial invariant and obtain an…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…
Representations learnt through deep neural networks tend to be highly informative, but opaque in terms of what information they learn to encode. We introduce an approach to probabilistic modelling that learns to represent data with two…
We propose a set of 4 recurrence relations whose linear combination gives the number of group invariants, equivalently the dimension of the invariant subspace, in the tensor product of an arbitrary number of adjoint representations of the…
We show that for every sufficiently large $n$, the number of monotone subsequences of length four in a permutation on $n$ points is at least $\binom{\lfloor n/3 \rfloor}{4} + \binom{\lfloor(n+1)/3\rfloor}{4} + \binom{\lfloor…
Functions satisfying the functional equation \begin{align*} \sum_{r=0}^{n-1} (-1)^r f(x+ry, ny) = f(x,y), \quad \text{for any positive odd integer $n$}, \end{align*} are named the alternating invariant functions. Examples of such functions…
Linking numbers in higher dimensions and their generalization including gauge fields are studied in the context of BF theories. The linking numbers associated to $n$-manifolds with smooth flows generated by divergence-free p-vector fields,…
We revisit the (untwisted) superfield approach to one-dimensional multi-particle systems with N=4 superconformal invariance. The requirement of a standard (flat) bosonic kinetic energy implies the existence of inertial (super-)coordinates,…
We describe recent achievements in the theory of weight systems, which are functions on chord diagrams satisfying so-called $4$-term relations. Our main attention is devoted to constructions of weight systems. The two main sources of these…
We introduce an invertible operation on finite sequences of positive integers and call it "kneading". Kneading preserves three invariants of sequences -- the parity of the length, the sum of the entries, and one we call the "alternant". We…
Human reasoning involves recognising common underlying principles across many examples. The by-products of such reasoning are invariants that capture patterns such as "if someone went somewhere then they are there", expressed using…
This paper addresses the problem of checking invariant properties for a large class of symbolic transition systems, defined by a combination of SMT theories and quantifiers. State variables can be functions from an uninterpreted sort…
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the coefficients in linear combinations of the functions, given the…
The counting function on binary values is extended to the signed case in order to count the number of transitions between contiguous locations. A generalized subdifferential for the sign change counting function is given where classical…