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…
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.
Trend · papers per month
Study on planar graph braid groups' second homology.
Spatial graphs are decomposed into planar forests and braids.
We construct an embedding of any right-angled Artin group defined by a graph into a graph braid group. The number of strands required for the braid group is equal to the chromatic number of . This construction yields an example of a hyperbolic surface subgroup embedded in a two strand planar graph braid g…
We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index . In order to have the necessity part, graphs are organized into small classes so that one of homological or cohomological characteristics of right-angled Artin groups can be applied. Fi…
We give a monoidal presentation of Coxeter and braid 2-groups, in terms of decorated planar graphs. This presentation extends the Coxeter presentation. We deduce a simple criterion for a Coxeter group or braid group to act on a category.
We design an algorithm writing down presentations of graph braid groups. Generators are represented in terms of actual motions of robots moving without collisions on a given graph. A key ingredient is a new motion planning algorithm whose complexity is linear in the number of edges and quadratic in the number of robots…
The n-string braid group of a graph X is defined as the fundamental group of the n-point configuration space of the space X. This configuration space is a finite dimensional aspherical space. A. Abrams and R. Ghrist have conjectured that this braid group is a right angled Artin group if X is planar. We prove their conj…
Study quasi-isometry invariants of square complexes and their applications.
Planar pure braids form a group that acts on a CAT(0) cubical complex.
We consider the braid groups on finite simplicial complexes , which are generalizations of those on both manifolds and graphs that have been studied already by many authors. We figure out the relationships between geometric decompositions for and their effects on braid groups, and provide an al…
We show that a large class of right-angled Artin groups (in particular, those with planar complementary defining graph) can be embedded quasi-isometrically in pure braid groups and in the group of area preserving diffeomorphisms of the disk fixing the boundary (with respect to the -norm metric); this extends resul…
The paper constructs braiding structures for a specific subfactor.
The paper encloses computation of simple centralizer of simple braids and their connection with Fibonacci numbers. Planarity of some commuting graphs is also discussed in the last section.
Maximizes mixing efficiency in surface braids.
Virtual twin groups map to symmetric groups, revealing automorphism structure.
New findings on algebraic structure of hyperbolic graph braid groups.
The paper classifies when certain graph braid groups are 3-manifold groups.
The braided Ptolemy-Thompson group is an extension of the Thompson group by the full braid group on infinitely many strands. This group is a simplified version of the acyclic extension considered by Greenberg and Sergiescu, and can be viewed as a mapping class group of a certain infinite planar s…
Classifies certain graph 2-braid groups up to quasi-isometry.
Automorphisms of fine curve graphs match surface homeomorphisms for planar surfaces.
We investigate the planarity of the boundaries of right-angled Coxeter groups. We show that non-planarity of the defining graph does not necessarily imply non-planarity of every boundary of the associated right-angled Coxeter group, although it does in many cases. Our techniques yield a characterization of the triangle…
We first show that the braid group over a graph topologically containing no -shape subgraph has a presentation related only by commutators. Then using discrete Morse theory and triple Massey products, we prove that a graph topologically contains none of four prescribed graphs if and only if its 4-braid groups is a r…
The study proves properties of specific groups acting on cube complexes.
In this paper, we introduce a bisected vertex leveling of a plane graph. Using this planar embedding, we present elementary proofs of the well-known upper bounds in terms of the minimal crossing number on braid index and arc index for any knot or non-split link , which are $b(L) \leq \frac{1}{2} c(L) +…
The twin group is a right angled Coxeter group generated by involutions and having only far commutativity relations. These groups can be thought of as planar analogues of Artin braid groups. In this note, we study some properties of twin groups whose analogues are well-known for Artin braid groups. We give…
In this paper, we give the sharp upper bound for the number of vertices with positive curvature in a planar graph with nonnegative combinatorial curvature. Based on this, we show that the automorphism group of a planar---possibly infinite---graph with nonnegative combinatorial curvature and positive total curvature is …
Study large-scale geometry of graph braid groups via cubical structures.
In the 1920's Artin defined the braid group in an attempt to understand knots in a more algebraic setting. A braid is a certain arrangement of strings in three-dimensional space. It is a celebrated theorem of Alexander that every knot is obtainable from a braid by identifying the endpoints of each string. Because of th…
String graphs are closely related to planar graphs in terms of distances.
The study finds a subgroup of graph braid groups that is a direct product of non-abelian free groups.
New periodic solutions found in 2n-body problem, braids of pseudo-Anosov type with stretch factors as metallic ratios.
New knot invariant from 3-braids and 6-valent graphs.
Graph braid groups' complexity stabilizes for most graphs.
The paper classifies virtual knot polynomials and trivalent graph invariants using skein theory.
Study periodic solutions in N-body problem, revealing braids with complex dynamics.
Moduli space linked to Tait colorings of planar graphs.
Computes Khovanov homology for 2-strand braids via graph relations.
In this paper, we show that the minimal asymptotic translation length of the Torelli group of the surface of genus on the curve graph asymptotically behaves like , contrary to the mapping class group , which behaves like . We also show that the minimal asymptotic translat…
Let be a finitely generated group acting faithfully and properly discontinuously by homeomorphisms on a planar surface . We prove that admits such an action that is in addition co-compact, provided we can replace by another surface . We also prove that if …
The recent proof by Bigelow and Krammer that the braid groups are linear opens the possibility of applications to the study of knots and links. It was proved by the first author and Menasco that any closed braid representative of the unknot can be systematically simplified to a round planar circle by a sequence of exch…
In this article we calculate the n-string braid groups of certain non-contractible graphs. We use techniques from the work of A. Abrams, F. Connolly and M. Doig combined with Van Kampen's Theorem to prove these results.
In Garside groups, axes of Morse elements are strongly contracting.
This paper explores Brunnian twin groups and their properties.
The graph braid group of a complete bipartite graph is the fundamental group of a configuration space of points on the graph, which is a CAT(0) cube complex. We combine an analysis of the topology of links of vertices in this complex, the description of a hidden symmetry among the parameters, and known results from the…
Proves conjecture on graph configuration spaces' complexity.
Since the foundational work of Chenciner and Montgomery in 2000 there has been a great deal of interest in choreographic solutions of the n-body problem: periodic motions where the n bodies all follow one another at regular intervals along a closed path. The principal approach combines variational methods with symmetry…
We construct a certain cross product of two copies of the braided dual of a quasitriangular Hopf algebra , which we call the elliptic double , and which we use to construct representations of the punctured elliptic braid group extending the well-known representations of the planar braid group attache…