arXiv research

We introduce and illustrate a new approach to the unknotting problem via the dynamics of vortex strings in a nonlinear partial differential equation of reaction-diffusion type. To untangle a given knot, a Biot-Savart construction is used to initialize the knot as a vortex string in the FitzHugh-Nagumo equation. Remarka…

Study contact instantons and Legendrian links, proving energy inequalities.

Multi-agent Q-learning untangles braids, improving over training.

It has long been known to mathematicians and physicists that while a full rotation in three-dimensional Euclidean space causes tangling, two rotations can be untangled. Formally, an untangling is a based nullhomotopy of the double-twist loop in the special orthogonal group of rotations. We study a particularly simple, …

Neural nets solve braid untangling up to length 20.

The paper analyzes the complexity of untangling knots with a given number of moves.

In mathematics, a knot is a single strand of string crossed over itself any number of times, and connected at the ends. The Reidemeister Moves have been proven to be the three core moves necessary to fully untangle a knot. Some knots can be untangled to a loop (the unknot), while others are fundamentally knotted. We de…

Paper introduces untangling number to quantify 3-periodic tangle complexity.

Paper defines untangling number to measure entanglement complexity in 3-periodic networks.

We introduce HUBERT which combines the structured-representational power of Tensor-Product Representations (TPRs) and BERT, a pre-trained bidirectional Transformer language model. We show that there is shared structure between different NLP datasets that HUBERT, but not BERT, is able to learn and leverage. We validate …

Motivated by the results of Scott and Patel about "untangling" closed geodesics in finite covers of hyperbolic surfaces, we introduce and study primitivity, simplicity and non-filling index functions for finitely generated free groups. We obtain lower bounds for these functions and relate these free group results back …

It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be untangled) are typically easy to identify using fast simplification techniques, wherea…

Knot 11n102 requires 2 changes to untangle.

New moves help untangle complex knots.

Robot untangles knots by walking and switching crossings.

Positive braids minimize knot untangling steps.

We present a sequence of diagrams of the unknot for which the minimum number of Reidemeister moves required to pass to the trivial diagram is quadratic with respect to the number of crossings. These bounds apply both in $S^2$ and in $\R^2$.

Let $K$ be a link of Conway's normal form $C(m)$, $m \geq 0$, or $C(m,n)$ with $mn\textgreater{}0$, and let $D$ be a trigonal diagram of $K.$ We show that it is possible to transform $D$ into an alternating trigonal diagram, so that all intermediate diagrams remain trigonal, and the number of crossings never increases.

Motivated by the work in [15], this paper deals with the theory of the braids from chromatic configuration spaces. This kind of braids possess the property that some strings of each braid may intersect together and can also be untangled, so they are quite different from the ordinary braids in the sense of Artin. This e…

Improved tracking of tangled point sources using Riemannian metrics.

We consider two systems of curves $(α_1,...,α_m)$ and $(β_1,...,β_n)$ drawn on a compact two-dimensional surface $M$ with boundary. Each $α_i$ and each $β_j$ is either an arc meeting the boundary of $M$ at its two endpoints, or a closed curve. The $α_i$ are pairwise disjoint except for possibly sharing endpoints, and s…

We show that the driving force behind the regularizing effect of Laplacian smoothing on surface elements is the popular mean ratio quality measure. We use these insights to provide natural generalizations to polygons and polyhedra. The corresponding functions measuring the quality of meshes are easily seen to be convex…

We prove that deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. We also prove that several natural questions regarding links in the $3$-sphere are NP-hard, including detecting whether a link contains a trivial sublink with $n$ componen…

Study on bounds of knot untangling for specific types of knots.

Study shows fibred knots can't be untied with specific moves.

Suppose $K$ is an unknot lying in the 1-skeleton of a triangulated 3-manifold with $t$ tetrahedra. Hass and Lagarias showed there is an upper bound, depending only on $t$, for the minimal number of elementary moves to untangle $K$. We give a simpler proof, utilizing a normal form for surfaces whose boundary is containe…

Paper corrects bias in online learning algorithms with endogenous data.

New measure shows how links can be untangled as twists increase.

New method to untangle knots using null-homologous twists.

Newsroom in online ecosystem is difficult to untangle. With prevalence of social media, interactions between journalists and individuals become visible, but lack of understanding to inner processing of information feedback loop in public sphere leave most journalists baffled. Can we provide an organized view to charact…

This paper benchmarks uncertainty disentanglement across various tasks.

Analyzes self-attention in recurrent networks, proving it mitigates vanishing gradients.

New method distinguishes data noise from GP uncertainty.

Unbounded primitivity index in free groups linked to Chebyshev function.

We develop a new modeling framework for Inter-Subject Analysis (ISA). The goal of ISA is to explore the dependency structure between different subjects with the intra-subject dependency as nuisance. It has important applications in neuroscience to explore the functional connectivity between brain regions under natural …

Any generic closed curve in the plane can be transformed into a simple closed curve by a finite sequence of local transformations called homotopy moves. We prove that simplifying a planar closed curve with $n$ self-crossings requires $Θ(n^{3/2})$ homotopy moves in the worst case. Our algorithm improves the best previou…

Novel method CHPCA simplifies complex market dynamics.

Deep learning predicts stock movements using social media data.

Limited annotated data available for the recognition of facial expression and action units embarrasses the training of deep networks, which can learn disentangled invariant features. However, a linear model with just several parameters normally is not demanding in terms of training data. In this paper, we propose an el…

Holographic energy equals Hamiltonian energy.

Optimizes energy efficiency in wireless sensor networks with limited information.

Reduces energy for 4D submanifolds in R^n.

Let $E_f$ be the energy of some knot $τ$ for any $f$ from certain class of functions. The problem is to find knots with extremal values of energy. We discuss the notion of the locally perturbed knot. The knot circle minimizes some energies $E_f$ and maximizes some others. So, is there any energy such that the circle ne…

New formula connects Loewner energy to moving frames' renormalised energy.

The paper proves $\Gamma$-convergence of discrete tangent-point energies to continuous energies and ropelength, with applications to biarc curves.

Quantizes Willmore energy in Riemannian manifolds with bounded energy and area.

Paper finds relations between Willmore-type energies, weighted areas, and vertical potential energies for cylindrical critical points.

Energy-efficient DL inference for IoT devices reduces power consumption and improves performance.