Classic braids embed in virtual braids.
problem Embedding classic braids in virtual braids.
method Elementary proof using generalizations of braid groups.
result Classical braid group injects into virtual braid group.
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
48 results for “Braids”
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…
Satellite links of fully positive braids are characterized.
problem Characterizing satellite links of fully positive braids.
method Analyzing fully positive braids and their satellites.
result Satellite links of fully positive braids are characterized by specific conditions.
Formula found for braid index of -bridge braids.
problem Finding a formula for the braid index of -bridge braids.
method Elementary, effective, self-contained proof.
result Closed form formula for braid index of -bridge braids.
Most simple braids have positive topological entropy.
problem Understanding the topological entropy of simple braids.
method Reduction from simple braids to non-simple 3-strand braids.
result The proportion of simple braids with positive entropy approaches 100% as the number of strands increases.
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…
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…
The paper examines subgroup separability for surface and virtual braid groups.
problem Subgroup separability of surface and virtual braid groups.
method Study of subgroup separability (LERF) properties.
result Properties of subgroup separability for surface and virtual braid groups are explored.
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…
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.
Magic braids can be made with leatherworking technique.
problem Determine which braids can be made with leatherworking technique.
method Explore their relation to several braid groups.
result Magic braids can be made with leatherworking technique.
Study virtual braid groups, proving a key subgroup result.
problem Understanding congruence subgroups in virtual braid groups.
method Using an extension of the integral Burau representation.
result Proved level 2 congruence subgroup of virtual braid group is pure virtual braid group.
Machine learning classifies braids and discovers new invariants.
problem Classifying and discovering invariants of braids and flat braids.
method Supervised learning with neural networks to classify braids as trivial or non-trivial.
result Found new convenient invariants of braids, including a complete invariant of flat braids.
Virtual Braidsmath.GT
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…
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.
New braid representations using virtual knot theory.
problem No classical features in virtual knot theory.
method Construct new braid representations using virtual knot theory.
result New representations of classical braids.
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…
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.
Invariants defined for braid systems under Hurwitz equivalence.
problem Invariants for braid systems under Hurwitz equivalence.
method Crossing matrix and polynomial invariant introduced.
result Invariant defined for surface braids and surface links.
Paper defines generalized braids and proves their subgroup status.
problem Understanding the structure of generalized braids and knots.
method Defined generalized braid theories and computed their generating sets.
result Quasitoric normal generalized braids form a subgroup of normal generalized braid group.
Multi-agent Q-learning untangles braids, improving over training.
problem Untangling braids using reinforcement learning.
method Two competing players learn to tangle and untangle braids in the OpenAI Gym environment.
result The system improves at untangling braids with more training, producing good tangled examples.
New family of braided Thompson groups introduced using recursive braids.
problem Dehornoy-Brin braided Thompson group generalization.
method Using recursive braids and strand diagrams to define new groups.
result New groups are finitely generated if is finitely generated.
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…
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…
Braids for pretzel linksmath.GT
A method to convert pretzel links into braids.
problem Representing pretzel links as braids.
method General procedure to convert any pretzel link into a braid.
result A specific braid word corresponding to the pretzel link.
On homotopy braidsmath.GR
Paper proves homotopy braid group properties over integers and three strands.
problem Understanding homotopy braid group properties.
method Proved linearity over integers and torsion freeness for three strands.
result Homotopy braid group on three strands is torsion free.
Twisted braidsmath.GT
Paper proves any twisted link can be described as a unique twisted braid.
problem Understanding twisted links and braids.
method Proved using Alexander and Markov Theorems for classical braids and links.
result Any twisted link can be described as the closure of a unique twisted braid.
New operations transform braids into P-fibered braids.
problem Transforming braids into P-fibered braids.
method Satellite operations and full twists.
result Any braid can be transformed into a P-fibered braid.
We give formulae for the first homology of the -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 -braid group over the graph is torsion-free and the conjectures about the first h…
Paper defines a new braid invariant and shows it's commutative.
problem Understanding the structure of braids and their invariants.
method Defining purified determinant and analyzing crossing matrices.
result The purified determinant is commutative for any pair of braids.
Positive braid knots have simple knot Floer homology.
problem Computing knot Floer homology for positive braids.
method Computed the next-to-top term of knot Floer homology.
result Rank is 1 for any prime positive braid knot.
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…
On braids and groups math.GT
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 -free braid groups . Here we establish connections between free braid groups, classical braid groups and free groups: we describe e…
On the negative band numbermath.GT
Study negative band numbers in braids and links.
problem Characterizing braids with negative band numbers.
method Using Birman, Ko, and Lee's left-canonical form.
result Characterize strongly and almost strongly quasipositive braids.
New representation for braid groups and surface braid groups, extending Lawrence-Krammer-Bigelow.
problem Constructing representations for braid groups and surface braid groups.
method Pro-nilpotent tower of representations, starting with the original LKB representation.
result 3-variable enrichment of the Lawrence-Krammer-Bigelow representation.
Study on braid groups' congruence subgroups and their crystallographic quotients.
problem Understanding congruence subgroups and crystallographic quotients of braid groups.
method Investigation of lower central series of congruence braid groups related to .
result Quotients of congruence braid groups are almost crystallographic.
New procedures connect braid charts, triplane diagrams, and braid movies for knotted surfaces.
problem Understanding the braid index and bridge index of knotted surfaces in 4D.
method Introducing rainbow diagrams and new procedures for passing among triplane diagrams, braid movies, and braid charts.
result Inequalities relating braid index and bridge index of 2-knots are obtained.
Braided chord diagramsmath.GT
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which can be represented as closed 3-braids. Partial results are obtained about spann…
Study on symmetric braid index of ribbon knots, deriving bounds and characterizations.
problem Understanding the symmetric braid index of ribbon knots.
method Defining symmetric braid index, using Khovanov homology, and calculating bounds.
result Existence of knots with symmetric braid index greater than braid index.
Braid theory optimizes neural network structures.
problem Optimizing the architecture of neural networks.
method Using braid theory to describe and construct neural network structures.
result Braid-based networks outperform other architectures in classification tasks.
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…
Boundary Braidsmath.GR
The n-strand braid group can be defined as the fundamental group of the configuration space of n unlabeled points in a closed disk based at a configuration where all n points lie in the boundary of the disk. Using this definition, the subset of braids that have a representative where a specified subset of these points …
New polynomial invariants derived from birack and switch structures.
problem Polynomial invariants of braids.
method Switch structures, birack colorings, quiver-valued invariants.
result New polynomial invariants of braids.
Maximizes mixing efficiency in surface braids.
problem Finding the maximum mixing efficiency in surface braids.
method Introduced an efficient algorithm to compute topological entropy and TEPO for surface braids.
result Conjectured a novel candidate braid to have maximal mixing efficiency.
Extended welded links are a generalization of Fenn, Rimányi, and Rourke's welded links. Their braided counterpart are extended welded braids, which are closely related to ribbon braids and loop braids. In this paper we prove versions of Alexander and Markov's theorems for extended welded braids and links, following Kam…