Related papers: More ties than we thought
Real-world applications of neural language models often involve running many different models over the same corpus. The high computational cost of these runs has led to interest in techniques that can reuse the contextualized embeddings…
In neural machine translation (NMT), the most common practice is to stack a number of recurrent or feed-forward layers in the encoder and the decoder. As a result, the addition of each new layer improves the translation quality…
Connections between nodes of fully connected neural networks are usually represented by weight matrices. In this article, functional transfer matrices are introduced as alternatives to the weight matrices: Instead of using real weights, a…
We present a novel phenomenological theory describing how topological constraints in prime-knot ring polymers induce collective (cooperative) modes of motion. In low-complexity knots, chain segments can move quasi-independently. However, as…
Binary representations of the trefoil and other knots of up to ten crossings in the simple cubic lattice were created. The BiEntropy of each knot was computed using a variety of binary encodings and compared against controls. This showed…
For a ribbon knot, it is a folk conjecture that the rank of its knot Floer homology must be 1 modulo 8, and another folk conjecture says the same about reduced Khovanov homology. We give the first counter-examples to both of these folk…
Knotted vortices such as those produced in water by Kleckner and Irvine tend to transform by reconnection to collections of unknotted and unlinked circles. The reconnection number $R(K)$ of an oriented knot of link $K$ is the least number…
The ropelength of a knot is the minimum contour length of a tube of unit radius that traces out the knot in three dimensional space without self-overlap, colloquially the minimum amount of rope needed to tie a given knot. Theoretical upper…
The main result of this paper is a negative answer to the question: are all transversal knot types transversally simple? An explicit infinite family of examples is given of closed 3-braids that define transversal knot types that are not…
We present a method for modelling textile structures, such as weft knits, on families of bicontinuous surfaces. By developing a tangible interpretation of mathematical theory, we combine perspectives of art, design, engineering, and science…
The advent of recurrent neural networks for handwriting recognition marked an important milestone reaching impressive recognition accuracies despite the great variability that we observe across different writing styles. Sequential…
We present four models for a random graph and show that, in each case, the probability that a graph is intrinsically knotted goes to one as the number of vertices increases. We also argue that, for $k \geq 18$, most graphs of order $k$ are…
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…
The presence of slipknots in configurations of proteins and DNA has been shown to affect their functionality, or alter it entirely. Historically, polymers are modeled as polygonal chains in space. As an alternative to space curves, we…
The topological underpinnings are presented for a new algorithm which answers the question: `Is a given knot the unknot?' The algorithm uses the braid foliation technology of Bennequin and of Birman and Menasco. The approach is to consider…
The large size limit of matrix integrals with quartic potential may be used to count alternating links and tangles. The removal of redundancies amounts to renormalizations of the potential. This extends into two directions: higher genus and…
Past research has identified a rich set of handcrafted linguistic features that can potentially assist various tasks. However, their extensive number makes it difficult to effectively select and utilize existing handcrafted features.…
We report on new numerical computations of the set of self-contacts in tightly knotted tubes of uniform circular cross-section. Such contact sets have been obtained before for the trefoil and figure eight knots by simulated annealing -- we…
In this paper, we find a more straightforward problem that is equivalent to one of the major challenges in knot theory: the classification of links in the 3-sphere. More precisely, we provide a simpler braid description for all links in the…
A physical interpretation of the rope simulated by the SONO algorithm is presented. Properties of the tight polygonal knots delivered by the algorithm are analyzed. An algorithm for bounding the ropelength of a smooth inscribed knot is…