Related papers: Links and Planar Diagram Codes
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…
Classical knot theory deals with {\em diagrams} and {\em invariants}. By means of horizontal {\em trisecants}, we construct a new theory of classical braids with invariants valued in {\em pictures}. These pictures are closely related to…
This paper introduces new invariants of rigid vertex graph embeddings by using non-local combinatorial information that is available at each graphical node. The new non-local information that we use in this paper involves parity in the…
We define and study a class of Reed-Muller type error-correcting codes obtained from elementary symmetric functions in finitely many variables. We determine the code parameters and higher weight spectra in the simplest cases.
We develop a word mechanism applied in knot and link diagrams for the illustration of a diagrammatic property. We also give a necessary condition for determining incompressible and pairwise incompressible surfaces, that are embedded in knot…
Diagrammatic reasoning using string diagrams provides an intuitive language for reasoning about morphisms in a symmetric monoidal category. To allow working with infinite families of string diagrams, !-graphs were introduced as a method to…
Motion planning is a fundamental problem of robotics with applications in many areas of computer science and beyond. Its restriction to graphs has been investigated in the literature for it allows to concentrate on the combinatorial problem…
We define an invariant of tangles and framed tangles given a finite crossed module and a pair of functions, called a Reidemeister pair, satisfying natural properties. We give several examples of Reidemeister pairs derived from racks,…
From the work of X. S. Lin and Z. Wang, it follows that degree two knot invariant admits a decomposition into the sum of a Gauss diagram count and a term involving Arnold invariants. In this paper we establish an analogous description for…
Link prediction in complex networks has attracted considerable attention from interdisciplinary research communities, due to its ubiquitous applications in biological networks, social networks, transportation networks, telecommunication…
Two welded (respectively virtual) link diagrams are homotopic if one may be transformed into the other by a sequence of extended Reidemeister moves, classical Reidemeister moves, and self crossing changes. In this paper, we extend Milnor's…
In this paper Legendrian graphs in $(\mathbb{R}^3,\xi_{\mathrm{st}})$ are considered modulo Legendrian isotopy and edge contraction. To a Legendrian graph we associate a (generalized) rectangular diagram --- a purely combinatorial object.…
In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases…
The Reed-Muller codes are a family of error-correcting codes that have been widely studied in coding theory. In 2020, Wei Yan and Sian-Jheng Lin introduced a variant of Reed-Muller codes so called symmetric Reed-Muller codes. We investigate…
In this work we show that given a connectivity graph $G$ of a $[[n,k,d]]$ quantum code, there exists $\{K_i\}_i, K_i \subset G$, such that $\sum_i |K_i|\in \Omega(k), \ |K_i| \in \Omega(d)$, and the $K_i$'s are $\tilde{\Omega}(…
We define a decomposition of link projections whose pieces we call atoroidal graphs. We describe a surgery operation on these graphs and show that all atoroidal graphs can be generated by performing surgery repeatedly on a family of well…
We introduce a multi-parameter deformation of the triply-graded Khovanov--Rozansky homology of links colored by one-column Young diagrams, generalizing the "$y$-ified" link homology of Gorsky--Hogancamp and work of Cautis--Lauda--Sussan.…
While accurate protein structure predictions are now available for nearly every observed protein sequence, predicted structures lack much of the functional context offered by experimental structure determination. We address this gap with…
We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every…
The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.