Generalizes braid theory to multi-crossing braids.
problem Knots with more than two strands at a crossing.
method Extends Alexander's Theorem to multi-crossing braids.
result Every link can be represented in an n-crossing braid form for any even n. Generalizing previous constructions, we present a dual pair of decompositions of the complement of a link L into bipyramids, given any multi-crossing projection of L. When L is hyperbolic, this gives new upper bounds on the volume of L given its multi-crossing projection. These bounds are realized by three closely rela…
The study improves inequalities for link diagrams and introduces weak rectangular diagrams.
problem Improving inequalities for link diagrams and understanding their properties.
method Introducing weak rectangular diagrams and proving new inequalities.
result Generalizes and subsumes many known inequalities related to multi-crossing numbers.
Legendrian knots can be represented by projections with multi-crossings.
problem Representing Legendrian knots with multi-crossings.
method Investigating übercrossing and petal projections in front and Lagrangian projections.
result Legendrian knots with übercrossing projections in front are smoothly isotopic to the unknot.
An increasing sequence of integers is said to be universal for knots if every knot has a reduced regular projection on the sphere such that the number of edges of each complementary face of the projection comes from the given sequence. Adams, Shinjo, and Tanaka have, in a work, shown that (2,4,5) and (3,4,n) (where n i…
A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound on the span of the bracket polynomial of K as 4c_2(K), to the n-crossing number:…
GCAPS-CNN improves GCNNs for graph classification.
problem Challenges in graph classification by current GCNN models.
method Integrates capsule idea into GCNNs for graph classification.
result Significantly outperforms state-of-the-art methods on benchmark datasets.
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.
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 n-bridge braids.
problem Finding a formula for the braid index of n-bridge braids. method Elementary, effective, self-contained proof.
result Closed form formula for braid index of n-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.
This paper identifies braided 3-belts that can be written in a braid-only form.
problem Identifying braided 3-belts that can be written in a braid-only form.
method Developed an algorithm to calculate the braid word for braided 3-belts and determined the conditions for knotted boundaries.
result Identified the set of braided 3-belts that can be written in a braid-only form and derived a formula for the Jones polynomial for knotted boundaries.
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.
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.
Paper studies special braids from chromatic configuration spaces.
problem Understanding braids with crossing-changeable properties.
method Theory of chromatic configuration spaces and braids.
result Introduced braids with the ability to intersect and untangle.
New virtual braid group structure and presentation found.
problem Understanding the structure of virtual pure braid groups.
method Cabling construction and HNN-extension approach.
result New presentation of VP4 and P4 groups. 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.
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…
Classifies closed surface braids up to isotopy and homeomorphism.
problem Classifying closed surface braids up to isotopy and homeomorphism.
method Algebraic classification using surface braid group and mapping class group actions.
result Braids close to isotopic or homeomorphic links if and only if they are conjugate or in the same orbit of the outer action of the mapping class group.
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.
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.
Braids with more twists than strands achieve their braid index.
problem Understanding the braid index of closures of braids with fractional Dehn twist coefficients.
method Characterizing fractional Dehn twist coefficients in terms of the Upsilon function and proving the braid index via homogenization of knot concordance homomorphisms.
result Proves that n-braids with fractional Dehn twist coefficient larger than n−1 realize the braid index of their closure. 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 BVn,r(H) are finitely generated if H is finitely generated. 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…
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.
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.
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.
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.
Polynomial algorithm solves word problem in braid groups on surfaces.
problem Word problem in braid groups on surfaces.
method Theory of straight line programs for polynomial braid combing.
result First algorithm to solve word problem in polynomial time for braid groups on surfaces.
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 n-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 n-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.
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…
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.