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.

169,051 papers · 148 categories

Trend · papers per month

123245368490 · Jun 202019922001200920182026
48 results for dual braid complex

New concept of boundary braids defined for disk configurations.

problem Defining and studying braids with points fixed on the boundary.
method Using configuration spaces and fundamental groups, defining boundary braids and analyzing their geometric properties.
result Boundary braids form a subcomplex that metrically splits into a Euclidean polyhedron and a smaller rank dual braid complex.

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 ↗

For a real oriented hyperplane arrangement, we show that the corresponding Salvetti complex is homotopy equivalent to the complement of the complexified arrangement. This result was originally proved by M. Salvetti. Our proof follows the framework of a proof given by L. Paris and relies heavily on the notation of orien…

2009-05-27abs ↗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 ↗

It is well known that any link can be represented by the closure of a braid. The minimum number of strings needed in a braid whose closure represents a given link is called the braid index of the link and the well known Morton-Frank-Williams inequality reveals a close relationship between the HOMFLY polynomial of a lin…

2016-04-20abs ↗pdf ↗

The study refines contingency matrices for complex stratification and braid group cohomology.

problem Combinatorics of contingency matrices and their applications.
method Refinement of complex stratification and study of braid group cohomology.
result Totally positive meta-matrix formed by contingency matrix sizes.

We use the Birman-Ko-Lee presentation of the braid group to show that all closures of strongly quasipositive braids whose normal form contains a positive power of the dual Garside element δδ are fibered. We classify links which admit such a braid representative in geometric terms as boundaries of plumbings of positive…

2016-10-30abs ↗pdf ↗

The study explores continuous noncrossing partitions and their relation to weighted circular factorizations.

problem Understanding the structure of continuous noncrossing partitions on the unit circle.
method Analyzes degree-d continuous noncrossing partitions and their equivalence classes of weighted linear factorizations.
result Maximal elements in the poset of continuous noncrossing partitions form a subspace homeomorphic to the dual Garside classifying space for the d-strand braid group.

Braids can be represented geometrically as curve diagrams. The geometric complexity of a braid is the minimal complexity of a curve diagram representing it. We introduce and study the corresponding notion of geometric generating function. We compute explicitly the geometric generating function for the group of braids o…

2015-03-02abs ↗pdf ↗

An element in Artin's braid group BnB_n is called periodic if it has a power which lies in the center of BnB_n. The conjugacy problem for periodic braids can be reduced to the following: given a divisor 1d<n11\le d<n-1 of n1n-1 and an element αα in the super summit set of εdε^d, find γBnγ\in B_n such that γ1αγ=εdγ^{-1}αγ=ε^d, …

2016-08-21abs ↗pdf ↗

We prove a long-standing conjecture about complex reflection arrangements.

problem The K(π,1)K(π,1) conjecture for affine Artin groups.
method Recent advancements in dual Coxeter and Artin groups theory, new constructions, and poset shellability.
result The complexified complement of an affine reflection arrangement is a classifying space.

The braid group of a complex reflection group is shown to be an index d subgroup.

problem Understanding the structure of braid groups associated with complex reflection groups.
method Presented a compatible presentation for the braid group of the orbifold quotient and a tagged triangulation of the disk.
result The braid group of the complex reflection group G(d,d,n)G(d,d,n) is an index dd subgroup of the braid group of the orbifold quotient.

We show that the limiting Khovanov chain complex of any infinite positive braid categorifies the Jones-Wenzl projector. This result extends Lev Rozansky's categorification of the Jones-Wenzl projectors using the limiting complex of infinite torus braids. We also show a similar result for the limiting Lipshitz-Sarkar-Kh…

2016-10-14abs ↗pdf ↗

Researchers describe unitary representations of mixed braid groups.

problem Understanding unitary representations of mixed braid groups.
method Explicitly describe unitary representations on cohomology of Abelian branched covers.
result Image of the representation is generated by complex reflections and related to the multivariate Burau representation.

We point out, and draw some consequences of, the fact that the Poisson Lie group G* dual to G=GL_n(C) (with its standard complex Poisson structure) may be identified with a certain moduli space of meromorphic connections on the unit disc having an irregular singularity at the origin. The Riemann-Hilbert map for such co…

2000-11-09abs ↗pdf ↗

We simplify Khovanov homology for torus braids using Gaussian elimination.

problem Computing Khovanov homology for torus braids is complex and computationally intensive.
method Applying Gaussian elimination to reduce the number of generators in the Khovanov chain complex.
result We provide a bound on the number of generators in the whittled complex at fixed homological degree.

The genus of knots is a one of the fundamental invariant and can be seen as a complexity of knots. In this paper, we give a lower bound of genus using Dehornoy floor, which is a measure of complexity of braids in terms of braid ordering.

2008-05-14abs ↗pdf ↗

Braids can be represented geometrically as laminations of punctured disks. The geometric complexity of a braid is the minimal complexity of a lamination that represents it, and tight laminations are representatives of minimal complexity. These laminations give rise to a normal form of braids, via a relaxation algorithm…

2015-07-12abs ↗pdf ↗

The paper defines parabolic subgroups for complex braid groups and proves they form a lattice.

problem Defining and characterizing parabolic subgroups in complex braid groups.
method Introducing and studying parabolic subgroups of generalized braid groups associated with complex reflection groups.
result Parabolic subgroups form a lattice in most cases, with specific properties and conjectures about hyperbolicity.

New link groups are derived from torus necklaces, connecting braid groups to reflection groups.

problem Understanding the relationship between braid groups and reflection groups.
method Constructing torus necklaces and linking them to braid groups of JJ-reflection groups.
result Link groups of torus necklaces are precisely braid groups of JJ-reflection groups, with meridians as braid reflections.

Researchers compute connectivity of braid group in bipartite graph configuration space.

problem Understanding connectivity of braid group in complex configuration space.
method Analysis of topology, hidden symmetry, and literature results.
result Explicit computation of connectivity at infinity for braid group.

We describe a series of complexes that relate to the braid groups as the matching complexes relate to the symmetric groups. A modified construction applies as well to other complexes based on edge sets in graphs. We show that our constructions will yield Cohen-Macauley complexes provided the underlying complexes are Co…

2003-10-27abs ↗pdf ↗

We describe a new method for combinatorially computing the transverse invariant in knot Floer homology. Previous work of the authors and Stone used braid diagrams to combinatorially compute knot Floer homology of braid closures. However, that approach was unable to explicitly identify the invariant of transverse links …

2017-03-20abs ↗pdf ↗

Choose any oriented link type X and closed braid representatives X[+], X[-] of X, where X[-] has minimal braid index among all closed braid representatives of X. The main result of this paper is a `Markov theorem without stabilization'. It asserts that there is a complexity function and a finite set of `templates' such…

2003-10-18abs ↗pdf ↗

Study definite strongly quasipositive links and their L-space branched covers.

problem Characterize strongly quasipositive links with definite Seifert forms and L-space branched covers.
method Investigate definite strongly quasipositive links, apply previous results, and use Garside elements and braid closures.
result If a strongly quasipositive braid closure is definite, it must be one of specific links or has an L-space branched cover.

We introduce new polynomial isotopy invariants for closed braids. They are constructed as polynomial valued {\em Gauss diagram 1-cocycles} evaluated on the full rotation of the closed braid β^\hat β around the core of the corresponding solid torus. They can be calculated with polynomial complexity with respect to the b…

2018-04-09abs ↗pdf ↗

In [V.O. Manturov, Non-reidemeister knot theory and its applications in dynamical systems, geometry, and topology, arxiv:1501.05208] the first named author gave the definition of kk-free braid groups GnkG_n^k. Here we establish connections between free braid groups, classical braid groups and free groups: we describe e…

2015-07-14abs ↗pdf ↗

New Garside structures found for torus knot groups and related braid groups.

problem Finding Garside structures for torus knot groups and related braid groups.
method Introducing a new Garside monoid M(n,m)\mathcal{M}(n,m) for (n,m)(n,m)-torus knot groups and other braid groups.
result New Garside structures for (n,m)(n,m)-torus knot groups and related braid groups are constructed.

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 ↗

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.

Link between braid groups and q-deformed rationals solves a classification problem.

problem Classifying faithful complex specializations of the Burau representation of braid group B3.
method Established a link between Burau representation and q-deformed rational numbers.
result Proved faithfulness of Burau representation outside a specific annulus.

A new approach uses circuit topology to study complex polymer interactions.

problem Understanding structural phase transitions in entangled polymer systems.
method Braided circuit topology framework for multiple-chain systems.
result Circuit topological motif fractions are effective order parameters for structural transitions.

We begin with a review of the notion of a braid group. We then discuss some known solutions to decision problems in braid groups. We then move on to proving new results in braid group algorithmics. We offer a quick solution to the generalized word problem in braid groups, in the special case of cyclic subgroups. We ill…

2003-05-14abs ↗pdf ↗