Related papers: Enhancing an R-matrix
We introduce a version of the Alexander polynomial for singular knots and tangles and show how it can be strengthened considerably by introducing a perturbation. For singular long knots, we also prove that our Alexander polynomial agrees…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
We present a kind of construction for a class of special matrices with at most two different eigenvalues, in terms of some interesting multiplicators which are very useful in calculating eigenvalue polynomials of these matrices. This class…
Explainability is crucial for probing graph neural networks (GNNs), answering questions like "Why the GNN model makes a certain prediction?". Feature attribution is a prevalent technique of highlighting the explanatory subgraph in the input…
We give a sufficient criterion for a lower bound of the cactus rank of a tensor. Then we refine that criterion in order to be able to give an explicit sufficient condition for a non-redundant decomposition of a tensor to be minimal and…
In this note we classify the necessary and the sufficient conditions that an index of a superconformal theory in $3\leq d \leq 6$ must obey for the theory to have enhanced supersymmetry. We do that by noting that the index distinguishes a…
If one wants to establish optimality of a given bipartite entanglement witness, the current standard approach is to check whether it has the spanning property. Although this is not necessary for optimality, it is most often satisfied in…
We construct a new order 1 invariant for knot diagrams. We use it to determine the minimal number of Reidemeister moves needed to pass between certain pairs of knot diagrams.
In this note we give concise formulas, which lead to a simple and fast computer program that computes a powerful knot invariant. This invariant $\rho_1$ is not new, yet our formulas are by far the simplest and fastest: given a knot we write…
We introduce a new class of quantum enhancements we call biquandle brackets, which are customized skein invariants for biquandle colored links.Quantum enhancements of biquandle counting invariants form a class of knot and link invariants…
In this note we present a parameterized class of lower triangular matrices. The components of the eigenvectors grow rapidly and will exceed the representational range of any finite number system. The eigenvalues and the eigenvectors are…
Let G be a simple complex algebraic group. By using a notion of a G-category we define invariants of tangles with flat G-connections in their complements. We also show that quantized universal enveloping algebras at roots of unity provide…
We formulate a notion of "geometric reductivity" in an abstract categorical setting which we refer to as adequacy. The main theorem states that the adequacy condition implies that the ring of invariants is finitely generated. This result…
It is shown that the enhanced (nonlinear) realignment criterion is equivalent to the family of linear criteria based on correlation tensor. These criteria generalize the original (linear) realignment criterium and give rise to the family of…
Deep learning models have proven to be exceptionally useful in performing many machine learning tasks. However, for each new dataset, choosing an effective size and structure of the model can be a time-consuming process of trial and error.…
We present local invariants of multi-partite pure or mixed states, which can be easily calculated and have a straight-forward physical meaning. As an application, we derive a new entanglement criterion for arbitrary mixed states of $n$…
We provide a class of inequalities for detecting entanglements in multi-mode systems. Necessary conditions for fully separable, bi-separable and sufficient conditions for fully entangled states are explicitly presented.
A first order inference system, called R-calculus, is defined to develop the specifications. It is used to eliminate the laws which is not consistent with the user's requirements. The R-calculus consists of the structural rules, an axiom, a…
In this paper we give the new sufficient conditions of entanglement for multipartite qubit density matrixes. We discuss in detail the case for tripartite qubit density matrixes. As a criterion in concrete application, its steps are quite…
We extend the notion of biquandle brackets to the case of psyquandles, defining quantum enhancements of the psyquandle counting invariant for singular knots and pseudoknots. We provide examples to illustrate the computation of these…