Related papers: Transition polynomial as a weight system for binar…
This article introduces a natural extension of colouring numbers of knots, called colouring polynomials, and studies their relationship to Yang-Baxter invariants and quandle 2-cocycle invariants. For a knot K in the 3-sphere let \pi_K be…
Link equivalence up to isotopy in a 3-space is the problem that lies at the root of knot theory, and is important in 3-dimensional topology and geometry. We consider its restriction to alternating links, given by two alternating diagrams…
Recent progress in string theory has led to a reformulation of quantum-group polynomial invariants for knots and links into new polynomial invariants whose coefficients can be understood in topological terms. We describe in detail how to…
In this paper we consider self-dual NRT-codes, that is, self-dual codes in the metric space endowed with the Niederreiter-Rosenbloom-Tsfasman (NRT-metric). We use polynomial invariant theory to describe the shape enumerator of a binary…
We define a complete invariant for doodles on a 2-sphere which takes values in series of chord diagrams of certain type. The coefficients at the diagrams with $n$ chords are finite type invariants of doodles of order at most $2n$.
A polynomial transform is the multiplication of an input vector $x\in\C^n$ by a matrix $\PT_{b,\alpha}\in\C^{n\times n},$ whose $(k,\ell)$-th element is defined as $p_\ell(\alpha_k)$ for polynomials $p_\ell(x)\in\C[x]$ from a list…
Delta finite-type invariants are defined analogously to finite-type invariants, using delta moves instead of crossing changes. We show that they are closely related to the lower central series of the commutator subgroup of the pure braid…
We give a combinatorial treatment of transverse homology, a new invariant of transverse knots that is an extension of knot contact homology. The theory comes in several flavors, including one that is an invariant of topological knots and…
Threshold graphs are recursive deterministic network models that have been proposed for describing certain economic and social interactions. One drawback of this graph family is that it has limited generative attachment rules. To mitigate…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
Tutte's dichromate T(x,y) is a well known graph invariant. Using the original definition in terms of internal and external activities as our point of departure, we generalize the valuations T(x,1) and T(1,y) to hypergraphs. In the…
We define a trivariate polynomial combining the NL-coflow and the NL-flow polynomial, which build a dual pair counting acyclic colorings of directed graphs, in the more general setting of regular oriented matroids.
Chern-Simons gauge theory for compact semisimple groups is analyzed from a perturbation theory point of view. The general form of the perturbative series expansion of a Wilson line is presented in terms of the Casimir operators of the gauge…
We describe an efficient algorithm to compute finite type invariants of type $k$ by first creating, for a given knot $K$ with $n$ crossings, a look-up table for all subdiagrams of $K$ of size $\lceil \frac{k}{2}\rceil$ indexed by dyadic…
This paper contains a proof that chromatic weight systems, introduced by Chmutov, Duzhin and Lando, can be expressed in terms of weight systems associated with direct sums of the Lie algebras gl_n and so_n. As a consequence the Vassiliev…
In [3] we constructed the parity-biquandle bracket valued in {\em pictures} (linear combinations of $4$-valent graphs). We gave no example of classical links such that the parity-biquandle bracket of which is not trivial. In the present…
Recently, a plethora of multivariable knot polynomials were introduced by Kashaev and one of the authors, by applying the Reshetikhin-Turaev functor to rigid $R$-matrices that come from braided Hopf algebras with automorphisms. We study the…
In digital signal processing, shift-invariant filters can be represented as a polynomial expansion of a shift operation,that is, the Z-transform representation. When extended to graph signal processing (GSP), this would mean that a…
By using the notion of a rigid R-matrix in a monoidal category and the Reshetikhin--Turaev functor on the category of tangles, we review the definition of the associated invariant of long knots. In the framework of the monoidal categories…
In a recent paper by M.Kazarian and the second author, a recurrence for the Lie algebras $\mathfrak{so}(N)$ weight systems has been suggested; the recurrence allows one to construct the universal $\mathfrak{so}$ weight system. The…