Related papers: Braid analysis of (low-dimensional) chaos
The main aim of this paper is to detect dynamical properties of the Gy\"orgyi-Field model of the Belousov-Zhabotinsky chemical reaction. The corresponding three-variable model given as a set of nonlinear ordinary differential equations…
In a topological description of elementary matter proposed by Bilson-Thompson, the leptons and quarks of a single generation, together with the electroweak gauge bosons, are represented as elements of the framed braid group of three…
We give a method for constructing an interactive art piece which illustrates two different definitions of the braid groups, along with their faithful action on the free group. The box also demonstrates how all motions of points in the plane…
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…
Bonded knots arise naturally in topological protein modeling, where intramolecular interactions such as disulfide bridges stabilize folded configurations. These structures extend classical knot theory by incorporating embedded graphs, and…
In this paper, we construct invariants of braids, knots and links by studying dynamics of points in $\R^{2}$ and applying the Ptolemy relation $ac+bd=xy$.
A methodology is proposed for inferring the topology underlying point cloud data. The approach employs basic elements of Morse Theory, and is capable of producing not only a point estimate of various topological quantities (e.g., genus),…
A symbolic language allowing to solve statistical problems for the systems with nonabelian braid-like topology in 2+1 dimensions is developed. The approach is based on the similarity between growing braid and "heap of colored pieces". As an…
We develop a calculus for diagrams of knotted objects. We define Arrow presentations, which encode the crossing informations of a diagram into arrows in a way somewhat similar to Gauss diagrams, and more generally w-tree presentations,…
In certain two-dimensional time-dependent flows, the braiding of periodic orbits provides a way to analyze chaos in the system through application of the Thurston-Nielsen classification theorem (TNCT). We expand upon earlier work that…
String and particle braiding statistics are examined in a class of topological orders described by discrete gauge theories with a gauge group $G$ and a 4-cocycle twist $\omega_4$ of $G$'s cohomology group…
This article is a survey on the braid groups, the Artin groups, and the Garside groups. It is a presentation, accessible to non-experts, of various topological and algebraic aspects of these groups. It is also a report on three points of…
Alexander's and Markov's theorems state that any link type in $R^3$ is represented by a closed braid and that such representations are related by some elementary operations called Markov moves. We generalize the notion of a braid to that in…
We present a braid-theoretic approach to combinatorially computing knot Floer homology. To a knot or link K, which is braided about the standard disk open book decomposition for (S^3,\xi_std), we associate a corresponding multi-pointed nice…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer $k$-th order Markov chains, for arbitrary $k$, from finite data by applying Bayesian methods to both…
In the spirit of recent works on topological chaos generated by sequential rotation of infinitely thin stirrers placed in a viscous liquid, we consider the statistical properties of braiding exponent which quantitatively characterizes the…
Turbulence theory is usually concerned with the statistical moments of the velocity or its fluctuations. One could also analyze the implicit probability distributions. This is the purview of information theory. Here we use information…
The Burau representation of the braid group can be used to recover the Alexander polynomial of the closure of a braid. We define twisted Burau maps and use them to compute twisted Alexander polynomials.
We study a certain type of braid closure which resembles the plat closure but has certain advantages; for example, it maps pure braids to knots. The main results of this note are a Markov-type theorem and a description of how Vassiliev…