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

73147220293 · Jun 202019922001200920172026
48 results for simple braids

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 ↗

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.

Study periodic solutions in N-body problem, revealing braids with complex dynamics.

problem Periodic solutions of the planar Newtonian N-body problem with equal masses.
method Analyze braid structures derived from periodic solutions, proving pseudo-Anosov types.
result Braids from Yu's periodic solutions are pseudo-Anosov, with stretch factors reflecting complexity.

We study a subset of square free positive braids and we give a few algebraic characterizations of them and one geometric characterization: the set of positive braids whose closures are unlinks. We describe canonical forms of these braids and of their conjugacy classes.

2010-03-31abs ↗pdf ↗

Researchers provide a simple topological method for Burau representations of loop braid groups.

problem Constructing Burau representations of loop braid groups.
method Simple topological construction of the Burau representations.
result One of the representations is more subtle and topologically natural but not easily combinatorially obvious.

We characterise positive braid links with positive Seifert form via a finite number of forbidden minors. From this we deduce a one-to-one correspondence between prime positive braid links with positive Seifert form and simply laced Dynkin diagrams, as well as a simple classification of alternating positive braid knots.

2012-11-20abs ↗pdf ↗

Two crossing homomorphisms on braid groups are shown to be equivalent.

problem Comparing two definitions of crossing homomorphisms on braid groups.
method Diagrammatic and algebraic definitions of crossing homomorphisms compared and computed for simple braids.
result Diagrammatic and algebraic crossing homomorphisms are equivalent.

Based on a normal form for braid group elements suggested by Dehornoy, we prove several representations of braid groups by automorphisms of a free group to be faithful. This includes a simple proof of the standard Artin's representation being faithful.

2002-03-17abs ↗pdf ↗

A knot type is exchange reducible if an arbitrary closed n-braid representative can be changed to a closed braid of minimum braid index by a finite sequence of braid isotopies, exchange moves and +/- destabilizations. In the manuscript [J Birman and NC Wrinkle, On transversally simple knots, preprint (1999)] a transver…

2000-02-14abs ↗pdf ↗

Using the band representation of the 3-strand braid group, it is shown that the genus of 3-braid links can be read off their skein polynomial. Some applications are given, in particular a simple proof of Morton's conjectured inequality and a condition to decide that some polynomials, like the one of 9_{49}, are not adm…

2001-03-06abs ↗pdf ↗

Drinfel'd used associators to construct families of universal representations of braid groups. We consider semi-associators (i.e., we drop the pentagonal axiom and impose a normalization in degree one). We show that the process may be reversed, to obtain semi-associators from universal representations of 3-braids. We v…

2007-08-04abs ↗pdf ↗

We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its conjugacy class which we call the stabilized set of sliding circuits, and if it …

2010-08-02abs ↗pdf ↗

Turning the skein relation for HOMFLY into a Fibonacci recurrence, we prove that there are only three rational specializations of HOMFLY polynomial: Alexander-Conway, Jones, and a new one. Using the recurrence relation, we find general and relative expansion formulae and rational generating functions for Alexander-Conw…

2010-03-04abs ↗pdf ↗

We give a complete classification of homomorphisms from the braid group on nn strands to the braid group on 2n2n strands when nn is at least 5. We also classify endomorphisms of the braid group on 4 strands, as well as homomorphisms from the commutator subgroup of the braid group on nn strands to the braid group on …

2019-10-01abs ↗pdf ↗

In this paper we define and present a simple combinatorial formula for a 3-variable Laurent polynomial invariant of conjugacy classes in Artin braid group BmB_m. We show that this Laurent polynomial satisfies the Conway skein relation and its coefficients are Vassiliev invariants of braids.

2013-02-27abs ↗pdf ↗

The contents of this 6-page paper have been subsumed into the 13-page paper, "A note on closed 3-braids", arXiv:0802.1072 [math.GT]. This paper is correct, but contains less information than the new one. The topological classification of knots that are closed braids is shown to lead to a classification theorem for tran…

2007-03-22abs ↗pdf ↗

The abstract discusses braided surfaces and their characteristic maps, linking them to algebraic and geometric properties.

problem Characterizing braided surfaces and their characteristic maps.
method Using branched coverings and factorization through free groups, the abstract explores the algebraic and geometric properties of braided surfaces.
result The abstract establishes a connection between braided surfaces and characteristic maps, providing new insights into their structure.

Dehn twists around simple closed curves in oriented surfaces satisfy the braid relations. This gives rise to a group theoretic from the braid group to the mapping class group. We prove here that this map is trivial in stable homology with any trivial coefficients. In particular this proves an old conjecture of J. Harer…

2006-09-21abs ↗pdf ↗

Braidlab is a Matlab package for analyzing data using braids. It was designed to be fast, so it can be used on relatively large problems. It uses the object-oriented features of Matlab to provide a class for braids on punctured disks and a class for equivalence classes of simple closed loops. The growth of loops under …

2014-10-02abs ↗pdf ↗

We construct a braiding operator in terms of the quantum dilogarithm function based on the quantum cluster algebra. We show that it is a q-deformation of the R-operator for which hyperbolic octrahedron is assigned. Also shown is that, by taking q to be a root of unity, our braiding operator reduces to the Kashaev R-mat…

2014-04-08abs ↗pdf ↗

New findings on algebraic structure of hyperbolic graph braid groups.

problem Classifying and understanding the algebraic structure of hyperbolic graph braid groups.
method Analyzing specific graph types (sun and pulsar graphs) and proving theorems about their braid groups.
result 3-strand braid groups of sun graphs are free, while most pulsar graphs contain surface subgroups.

In this paper we study the homeomorphisms of the disk that are liftable with respect to a simple branched covering. Since any such homeomorphism maps the branch set of the covering onto itself and liftability is invariant up to isotopy fixing the branch set, we are dealing in fact with liftable braids. We prove that th…

2001-07-16abs ↗pdf ↗

Benardete, Gutierrez and Nitecki showed an important result which relates the geometrical properties of a braid, as a homeomorphism of the punctured disk, to its algebraic Garside-theoretical properties. Namely, they showed that if a braid sends a curve to another curve, then the image of this curve after each factor o…

2011-05-18abs ↗pdf ↗

Investigates polynomial time algorithms for computing Khovanov homology of braids.

problem Computing Khovanov homology for general braids is intractable.
method Examines polynomial time algorithms for 3-braids and a variation of the scanning algorithm for more general braids.
result Shows that for 3-braids, Khovanov homology can be computed in polynomial time, while for more general braids, it can be computed in polynomial time for bounded homological degrees.

Motivated by the works of Krasner [arXiv:0801.4018] and Lobb [arXiv:1103.1412], we simplify the Khovanov-Rozansky chain complexes of open 2-braids. As an application, we show that, for a knot containing a "long" 2-braid, the sl(N) Rasmussen invariant of this knot depends linearly on the length of this 2-braid. We refin…

2011-11-15abs ↗pdf ↗

We study the rational permutation braids, that is the elements of an Artin-Tits group of spherical type which can be written x1yx^{-1} y where xx and yy are prefixes of the Garside element of the braid monoid. We give a geometric characterization of these braids in type AnA_n and BnB_n and then show that in spherical …

2015-08-27abs ↗pdf ↗

When Daan Krammer and Stephen Bigelow independently proved that braid groups are linear, they used the Lawrence-Krammer-Bigelow representation for generic values of its variables q and t. The t variable is closely connected to the traditional Garside structure of the braid group and plays a major role in Krammer's alge…

2014-11-04abs ↗pdf ↗

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 T2T^2-knots and turned spun T2T^2-knots. In this paper we braid a torus-covering link over the standard 2-sphere. This gives an u…

2009-05-10abs ↗pdf ↗

New algorithms solve word and conjugacy problems in braid group B3.

problem Word and conjugacy problems in braid group B3.
method Classical interpretation of braid group B3 as central extension of modular group, theory of continued fractions.
result Simple and efficient algorithms to solve word and conjugacy problems in braid group B3.

BraidNet uses braid theory to optimize neural networks for image classification.

problem Image classification problems
method Procedural optimization of neural networks combining information theory and braid theory
result BraidNet outperforms other networks in learning speed and accuracy

Using a simple recurrence relation we give a new method to compute Jones polynomials of closed braids: we find a general expansion formula and a rational generating function for Jones polynomials. The method is used to estimate degree of Jones polynomials for some families of braids and to obtain general qualitative re…

2010-02-19abs ↗pdf ↗