Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

69138206275 · Jun 202019922001200920172026
48 results for random braids

Random walks on braid groups are transient, with specific closure properties for certain braids.

problem Understanding the behavior of random walks on braid groups and their closure properties.
method Analyzing the symplectic representation of braid groups and polynomial conditions on their matrices.
result Random walks on braid groups are transient, and specific closure properties for certain braids are derived.

We consider a random link, which is defined as the closure of a braid obtained from a random walk on the braid group. For such a random link, the expected value for the number of components was calculated by Jiming Ma. In this paper, we determine the most expected number of components for a random link, and further, co…

2015-07-11abs ↗pdf ↗

The study of random positive 3-strand braids reveals patterns in the roots of their Alexander polynomials.

problem Investigating the roots of Alexander polynomials of random positive 3-strand braids.
method Experimental data analysis, conjectures refinement, and proof of results using tools like the signature function of links and Lyapunov exponent of the Burau representation.
result Generically, at least 69% of the roots of Alexander polynomials are on the unit circle, with a large root-free region near the origin.

A result of Malyutin shows that a random walk on the mapping class group gives rise to an element whose fractional Dehn twist coefficient is large or small enough. We show that this leads to several properties of random 3-manifolds and links. For example, random closed braids and open books are hyperbolic.

2015-04-17abs ↗pdf ↗

Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside's weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the conjugacy problem that is successful for random braids in overwhelming probabilit…

2006-11-15abs ↗pdf ↗

Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability. Moreover, with a significant probability, the solution will be the first in the list.…

2004-04-05abs ↗pdf ↗

We describe random walk boundaries (in particular, the Poisson--Furstenberg, or PF-boundary) for a vast family of groups in terms of the hyperbolic boundary of a special free subgroup. We prove that almost all trajectories of the random walk (with respect to an arbitrary nondegenerate measure on the group) converge to …

2007-07-07abs ↗pdf ↗

The reduced Burau representation VnV_n of the braid group BnB_n is obtained from the action of BnB_n on the homology of an infinite cyclic cover of the disc with nn punctures. The group homology H(Bn;Vn)H_*(B_n;V_n) of braid groups with coefficients in the complexified reduced Burau representation is calculated. Our topolog…

2015-06-06abs ↗pdf ↗

The study proves super-rigidity of Gromov's random monster group for various types of groups.

problem Super-rigidity of Gromov's random monster group in various group types.
method Proof of morphisms having finite image and introduction of hereditary super-rigidity.
result Gromov's random monster group has super-rigidity and hereditary super-rigidity with respect to certain groups.

The UNKNOT problem solved using natural language processing and machine learning.

problem Determining if a knot is the unknot.
method Braid word representation, binary classification, Reformer and shared-QK Transformer networks, reinforcement learning, Markov moves, braid relations.
result Reformer and shared-QK Transformer networks outperform fully-connected networks in predicting the unknot.

The paper finds minimal generating sets and abelianizes the quasitoric braid group.

problem Understanding the structure of quasitoric braids and their subgroup properties.
method Provided two minimal generating sets and determined the abelianization.
result Minimal generating sets and abelianization of the quasitoric braid group were determined.

We study the structure of the virtual braid group. It is shown that the virtual braid group is a semi--direct product of the virtual pure braid group and the symmetric group. Also, it is shown that the virtual pure braid group is a semi--direct product of free groups. From these results we obtain a normal form of words…

2004-07-23abs ↗pdf ↗

This paper is concerned with detecting when a closed braid and its axis are 'mutually braided' in the sense of Rudolph. It deals with closed braids which are fibred links, the simplest case being closed braids which present the unknot. The geometric condition for mutual braiding refers to the existence of a close contr…

1999-07-02abs ↗pdf ↗

We show that 3-braid links with given (non-zero) Alexander or Jones polynomial are finitely many, and can be effectively determined. We classify among closed 3-braids strongly quasipositive and fibered ones, and show that 3-braid links have a unique incompressible Seifert surface. We also classify the positive braid wo…

2006-06-19abs ↗pdf ↗

Virtual braids are a combinatorial generalization of braids. We present abstract braids as equivalence classes of braid diagrams on a surface, joining two distinguished boundary components. They are identified up to isotopy, compatibility, stability and Reidemeister moves. We show that virtual braids are in a bijective…

2014-02-03abs ↗pdf ↗

Study on deformation cohomology for braided commutative structures.

problem Classifying and understanding deformations of braided commutative algebras.
method Extending Yang-Baxter Hochschild cohomology to braided commutative deformations.
result Classifies infinitesimal deformations of braided algebras that are braided commutative.

In the present paper we give a new method for converting virtual knots and links to virtual braids. Indeed the braiding method given in this paper is quite general, and applies to all the categories in which braiding can be accomplished. We give a unifying topological interpretation of virtuals and flats (virtual strin…

2004-07-21abs ↗pdf ↗

This paper extends braid lifting to coloured braid groupoids for all simple disc covers.

problem Lifting braids to homeomorphisms on branched covers of the disc.
method Defines a map from a coloured braid groupoid to a mapping class groupoid for all simple covers of the disc.
result Characterizes the lift of every coloured braid, recovering classical lifting on liftable braids.

The notion of a braid is generalized into two and three dimensions. Two-dimensional braids are described by braid monodromies or graphics called charts. In this paper we introduce the notion of curtains, and show that three-dimensional braids are described by braid monodromies or curtains.

2013-12-19abs ↗pdf ↗

Virtual singular braids are generalizations of singular braids and virtual braids. We define the virtual singular braid monoid via generators and relations, and prove Alexander- and Markov-type theorems for virtual singular links. We also show that the virtual singular braid monoid has another presentation with fewer g…

2015-04-05abs ↗pdf ↗

Polynomials with distinct critical values have braid monodromy groups equal to braid groups.

problem Understanding the structure of braid monodromy groups of polynomials.
method Analyzing the critical values of polynomials to determine their braid monodromy groups.
result The braid monodromy group of a polynomial equals the braid group if the polynomial has distinct critical values.

Paper explores relations between braid groups and their quotients.

problem Understanding relations between braid groups and their quotients.
method Recalling and introducing elements of congruence braid groups, establishing isomorphisms between crystallographic and congruence braid groups.
result Established isomorphisms between crystallographic braid groups and quotients of congruence braid groups.

The Helon model identifies Standard Model quarks and leptons with certain framed braids joined together at both ends by a connecting node (disk). These surfaces with boundary are called braided 3-belts (or simply belts). Twisting and braiding of ribbons composing braided 3-belts are interchangeable, and it was shown in…

2018-08-12abs ↗pdf ↗

The aim of the present note is to show that the natural map from classical braids to virtual braids is an inclusion; this proof does not use any complete invariants of classical braids; it is based on the projection from virutal braids to classical braids (similar to the one given in \cite{Projection}); this projection…

2015-04-13abs ↗pdf ↗

We give formulae for the first homology of the nn-braid group and the pure 2-braid group over a finite graph in terms of graph theoretic invariants. As immediate consequences, a graph is planar if and only if the first homology of the nn-braid group over the graph is torsion-free and the conjectures about the first h…

2011-01-13abs ↗pdf ↗

We study the Morton-Franks-Williams inequality for closures of simple braids (also known as positive permutation braids). This allows to prove, in a simple way, that the set of simple braids is a orthonormal basis for the inner product of the Hecke algebra of the braid group defined by Kálmán, who first obtained this r…

2013-08-06abs ↗pdf ↗