Related papers: More ties than we thought

As the context limits of Large Language Models (LLMs) increase, the range of possible applications and downstream functions broadens. In many real-world tasks, decisions depend on details scattered across collections of often disparate…

Let K be a hyperbolic (-2,3,n) pretzel knot and M = S^3 K its complement. For these knots, we verify a conjecture of Reid and Walsh: there are at most three knot complements in the commensurability class of M. Indeed, if n \neq 7, we show…

Pre-trained language models demonstrate general intelligence and common sense, but long inputs quickly become a bottleneck for memorizing information at inference time. We resurface a simple method, Memorizing Transformers (Wu et al.,…

We establish an operator formula for the number of monotone trapezoids with prescribed bottom row, generalizing alternating sign matrices. The special case of the formula for monotone triangles previously provided an alternative proof for…

Templates are branched 2-manifolds with semi-flows used to model `chaotic' hyperbolic invariant sets of flows on 3-manifolds. Knotted orbits on a template correspond to those in the original flow. Birman and Williams conjectured that for…

Interaction nets are a form of restricted graph rewrite system that can serve as a graphical or textual programming language. As such, benefits include one-step confluence, ease of parallelism and explicit garbage collection. However, some…

In this paper we outline a topological framework for constructing 2-periodic knitted stitches and an algebra for joining stitches together to form more complicated textiles. Our topological framework can be constructed from certain…

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…

Using Kirby Calculus, we explicitly pass from Berge's R-R descriptions of ten families of knots with lens space surgeries to surgery descriptions on the minimally twisted five chain link (MT5C). Since the MT5C admits a strong involution, we…

The work addresses the analogy between trivial knotting and excluded volume in looped polymer chains of moderate length, $N<N_0$, where the effects of knotting are small. A simple expression for the swelling seen in trivially knotted loops…

Using Monte Carlo simulations and advanced knot localization methods, we analyze the length and distribution of prime components in composite knots tied on Freely Jointed Rings (FJRs). For increasing contour length, we observe the…

This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…

We prove that every knot type in $\mathbb{R}^3$ can be parametrised by a smooth function $f:S^1\to\mathbb{R}^3$, $f(t)=(x(t),y(t),z(t))$ such that all derivatives $f^{(n)}(t)=(x^{(n)}(t),y^{(n)}(t),z^{(n)}(t))$, $n\in\mathbb{N}$,…

We enumerate the state diagrams of the twist knot shadow which consist of the disjoint union of two trivial knots. The result coincides with the maximal number of regions into which the plane is divided by a given number of circles. We then…

A graph is called intrinsically knotted if every embedding of the graph contains a knotted cycle. Johnson, Kidwell and Michael showed that intrinsically knotted graphs have at least 21 edges. Recently Lee, Kim, Lee and Oh, and,…

We present an enhanced prime decomposition theorem for knots that gives the isotopy classes of composite knots that can be constructed from a given list of prime factors (allowing for the mirroring and orientation reversing for each…

Transformer architectures are the backbone of most modern language models, but understanding the inner workings of these models still largely remains an open problem. One way that research in the past has tackled this problem is by…

We introduce a novel approach for building language models based on a systematic, recursive exploration of skip n-gram models which are interpolated using modified Kneser-Ney smoothing. Our approach generalizes language models as it…

Let $M_n$ be the topological moduli space of all parallel n-cables of long framed oriented knots in 3-space. We construct in a combinatorial way for each natural number $n>1$ a 1-cocycle $R_n$ which represents a non trivial class in…