Related papers: Braid graphs in simply-laced triangle-free Coxeter…

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 describe an algorithm to identify a minimal set of "braid relations" which span and preserve all sets of involution words for twisted Coxeter systems of finite or affine type. We classify the cases in which adding the smallest possible…

For a Coxeter element $c$ of a finite Coxeter group, we consider a family of subword complexes parameterized by reduced expressions of the longest element. This family generalizes $c-$cluster complexes. We describe vertices of these…

A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active…

We associate to a braided 2-stack ${\cal C}$ a torsor, endowed with a symmetric cube structure (or $\Sigma$-structure), whose triviality is equivalent to the existence on ${\cal C}$ of a fully symmetric monoidal structure. In order to…

We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called {\it flat} if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have…

In the spirit of peripheral subgroups in relatively hyperbolic groups, we exhibit a simple class of quasi-isometrically rigid subgroups in graph products of finite groups, which we call eccentric subgroups. As an application, we prove that,…

We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…

An {\em odd hole} in a graph is an induced subgraph which is a cycle of odd length at least five. An {\em odd parachute} is a graph obtained from an odd hole $H$ by adding a new edge $uv$ such that $x$ is adjacent to $u$ but not to $v$ for…

In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…

This paper presents a construction of fibered links $(K,\Sigma)$ out of chord diagrams $\sL$. Let $\Gamma$ be the incidence graph of $\sL$. Under certain conditions on $\sL$ the symmetrized Seifert matrix of $(K,\Sigma)$ equals the bilinear…

Braided groups and braided matrices are novel algebraic structures living in braided or quasitensor categories. As such they are a generalization of super-groups and super-matrices to the case of braid statistics. Here we construct braided…

We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of…

If a biconnected graph stays connected after the removal of an arbitrary vertex and an arbitrary edge, then it is called 2.5-connected. We prove that every biconnected graph has a canonical decomposition into 2.5-connected components. These…

For an integer $n\geq 2$, the triangular graph has vertex set the $2$-subsets of $\{1,\ldots,n\}$ and edge set the pairs of $2$-subsets intersecting at one point. Such graphs are known to be halved graphs of bipartite rectagraphs, which are…

In the 1950s, H. S. M. Coxeter considered the quotients of braid groups given by adding the relation that all half Dehn twist generators have some fixed, finite order. He found a remarkable formula for the order of these groups in terms of…

We use rational formality of configuration spaces and the bar construction to study the cohomology of the space of braids in dimension four or greater. We provide a diagram complex for braids and a quasi-isomorphism to the de Rham cochains…

A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W. A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions…

In this note, we extend results about unique $n^{\textrm{th}}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified…

We give inductive constructions of independent graphs that contain implied nonedges but do not contain any non-trivial rigid subgraphs, or \emph{nucleations}: some of the constructions and proofs apply to 3-dimensional abstract rigidity…