Related papers: Trisected Rainbows and Braids
In this article, we propose the approach to structural optimization of neural networks, based on the braid theory. The paper describes the basics of braid theory as applied to the description of graph structures of neural networks. It is…
Every link is shown to be presentable as a boundary of an unknotted flat banded surface. A (flat) banded link is defined as a boundary of an unknotted (flat) banded surface. A link's (flat) band index is defined as the minimum number of…
Meier and Zupan proved that an orientable surface $\mathcal{K}$ in $S^4$ admits a tri-plane diagram with zero crossings if and only if $\mathcal{K}$ is unknotted, so that the crossing number of $\mathcal{K}$ is zero. We determine the…
Knots and links which are closed 3-braids are a very special class. Like 2-bridge knots and links, they are simple enough to admit a complete classification. At the same time they are rich enough to serve as a source of examples on which,…
We study immersed surfaces in smooth 4-manifolds via singular banded unlink diagrams. Such a diagram consists of a singular link with bands inside a Kirby diagram of the ambient 4-manifold, representing a level set of the surface with…
The flip graph of triangulations has as vertices all triangulations of a convex $n$-gon, and an edge between any two triangulations that differ in exactly one edge. An $r$-rainbow cycle in this graph is a cycle in which every inner edge of…
We give a formula for the duality structure of the 3-manifold obtained by doing zero-framed surgery along a knot in the 3-sphere, starting from a diagram of the knot. We then use this to give a combinatorial algorithm for computing the…
Branch points of a real 2-surface S in a 4-manifold M generalize the branch points of complex curves in complex surfaces: for example, they can occur as singularities of minimal surfaces. We investigate such a branch point p when S is…
We give uniform, explicit, and simple face-pairing descriptions of all the branched cyclic covers of the 3-sphere, branched over two-bridge knots. Our method is to use the bi-twisted face-pairing constructions of Cannon, Floyd, and Parry;…
We construct ribbon surfaces of Euler characteristic one for several infinite families of alternating 3-braid closures. We also use a twisted Alexander polynomial obstruction to conclude the classification of smoothly slice knots which are…
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…
Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…
For classical links Ohyama proved an inequality involving the minimal crossing number and the braid index, then motivated from this Takeda showed an analogous inequality for virtual links. In this paper, we are interested in studying…
The triple linking number of an oriented surface link was defined as an analogical notion of the linking number of a classical link. We consider a certain $m$-component $T^2$-link ($m \geq 3$) determined from two commutative pure $m$-braids…
The classical Thistlethwaite theorem for links can be phrased as asserting that the Kauffman bracket of a link can be obtained from an evaluation of the Bollob\'as-Riordan polynomial of a ribbon graph associated to one of the link's…
A rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint…
Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A triple crossing is a crossing where three strands meet at a single point, such that each strand bisects the…
The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed…
Laundry surfaces for closed braid diagrams are presented. It is shown that braid diagrams are characterized by linking matrices obtained by lifting cycles from these surfaces. Oriented link types are then characterized by equivalence…
We consider a surface link in the 4-space which can be presented by a simple branched covering over the standard torus, which we call a torus-covering link. Torus-covering links include spun $T^2$-knots and turned spun $T^2$-knots. In this…