相关论文: Enhancing an R-matrix

We restructure and advance the classification theory of finite racks and quandles by employing powerful methods from transformation groups and representation theory, especially Burnside rings. These rings serve as universal receptacles for…

We study possibilities for automated invariant generation in parametric systems. We use (a refinement of) an algorithm for symbol elimination in theory extensions to devise a method for iteratively strengthening certain classes of safety…

This article is about applications of linear algebra to knot theory. For example, for odd prime p, there is a rule (given in the article) for coloring the arcs of a knot or link diagram from the residues mod p. This is a knot invariant in…

Simple closed curves in the plane can be mapped to nontrivial knots under the action of origami foldings that allow the paper to self-intersect. We show all tame knot types may be produced in this manner, motivating the development of a new…

This paper is the first to construct and motivate a Machine Learning algorithm solely with Enriched Category Theory, supplementing evidence that Category Theory can provide valuable insights into the construction and explainability of…

The warping matrix has been defined for knot projections and knot diagrams by using warping degrees. In particular, the warping matrix of a knot diagram represents the knot diagram uniquely. In this paper we show that the rank of the…

An $r$-matrix is a matrix with symbols in $\{0,1,\ldots,r-1\}$. A matrix is simple if it has no repeated columns. Let ${\cal F}$ be a finite set of $r$-matrices. Let $\hbox{forb}(m,r,{\cal F})$ denote the maximum number of columns possible…

While Graph Neural Networks (GNNs) recently became powerful tools in graph learning tasks, considerable efforts have been spent on improving GNNs' structural encoding ability. A particular line of work proposed subgraph GNNs that use…

A methodology that seeks to enhance model prediction performance is presented. The method involves generating multiple auxiliary models that capture relationships between attributes as a function of each other. Such information serves to…

We present an intuitive geometrical entanglement criterion. It allows formulation of simple and experimentally friendly sufficient conditions for entanglement. The conditions are illustrated with several examples. Moreover, a generalization…

We use a Riemannian (or pseudo-Riemannian) geometric framework to formulate the theory of the classical r-matrix for integrable systems. In this picture the r-matrix is related to a fourth rank tensor, named the r-tensor, on the…

We ask when a finite set of t-structures in a triangulated category can be `averaged' into one t-structure or, equivalently, when the extension closure of a finite set of aisles is again an aisle. There is a straightforward, positive answer…

An alternative parameterization of R-matrix theory is presented which is mathematically equivalent to the standard approach, but possesses features which simplify the fitting of experimental data. In particular there are no level shifts and…

Cylindrical Algebraic Decomposition (CAD) is an important tool within computational real algebraic geometry, capable of solving many problems for polynomial systems over the reals. It has long been studied by the Symbolic Computation…

Redundancy matrices provide insights into the load carrying behavior of statically indeterminate structures. This information can be employed for the design and analysis of structures with regard to certain objectives, for example…

We develop a reinforcement learning pipeline for simplifying knot diagrams. A trained agent learns move proposals and a value heuristic for navigating Reidemeister moves. The pipeline applies to arbitrary knots and links; we test it on…

The detection of entanglement in a bipartite state is a crucial issue in quantum information science. Based on realignment of density matrices and the vectorization of the reduced density matrices, we introduce a new set of separability…

For a virtual knot $K$ and an integer $r$ with $r\geq2$, we introduce a method of constructing an $r$-component virtual link $L(K;r)$, which we call the $r$-multiplexing of $K$. Every invariant of $L(K;r)$ is an invariant of $K$. We give a…

The authors recently introduced a new construction of a knot as an extended symmetric union of a knot with a single tangle region. In this paper, we generalize the construction to include multiple tangle regions. The constructed knot $K$…

We develop a strong and computationally simple entanglement criterion. The criterion is based on an elementary positive map Phi which operates on state spaces with even dimension N >= 4. It is shown that Phi detects many entangled states…