相关论文: A Gathering Process in Artin Braid Groups

We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index $\ge 5$. In order to have the necessity part, graphs are organized into small classes so that one of homological…

We consider the braid groups $\mathbf{B}_n(X)$ on finite simplicial complexes $X$, which are generalizations of those on both manifolds and graphs that have been studied already by many authors. We figure out the relationships between…

Using the recoupling theory, we define a representation of the pure braid group and show that it is not trivial.

Let $X$ be a smooth scheme with an action of a reductive algebraic group $G$ over an algebraically closed field $k$ of characteristic zero. We construct an action of the extended affine Braid group on the $G$-equivariant absolute derived…

The orbifold braid groups of two dimensional orbifolds were defined in [1] (arXiv:math/9907194) to understand certain Artin groups as subgroups of some suitable orbifold braid groups. We studied orbifold braid groups in some more detail in…

As countless examples show, it can be fruitful to study a sequence of complicated objects all at once via the formalism of generating functions. We apply this point of view to the homology and combinatorics of orbit configuration spaces:…

A universal method for the concatenation of a sequence of Markov right processes is established. It is then applied to the continued pasting of two Markov right processes, which can be used for pathwise constructions of locally defined…

We study the centralizer of a braid from the point of view of Garside theory, showing that generically a minimal set of generators can be computed very efficiently, as the ultra summit set of a generic braid has a very particular structure.…

In this paper we indicate one method of construction of linear representations of groups and algebras with translation invariant (except, maybe , finite number) defining relationships. As an illustration of this method, we give one approach…

We introduce and study a novel semi-random multigraph process, described as follows. The process starts with an empty graph on $n$ vertices. In every round of the process, one vertex $v$ of the graph is picked uniformly at random and…

We explore a simplified class of models we call swarms, which are inspired by the collective behavior of social insects. We perform a mean-field stability analysis and perform numerical simulations of the model. Several interesting types of…

Artin's braid groups have been recently suggested as a new source for public-key cryptography. In this paper we propose the first undeniable signature schemes using the conjugacy problem and the decomposition problem in the braid groups…

We consider object detection using a generic model for natural shapes. A common approach for object recognition involves matching object models directly to images. Another approach involves building intermediate representations via a…

In this paper we prove a Markov Theorem for virtual braids and for some analogs of this structure. The virtual braid group is the natural companion in the category of virtual knots, just as the Artin braid group is the natural companion to…

Let $G=\mathop{A\ast B}\limits_C$ be an amalgamated product of finite rank free groups $A$, $B$ and $C$. We introduce atomic measures and corresponding asymptotic densities on a set of normal forms of elements in $G$. We also define two…

We consider flocks of artificial birds and study the emergence of V-like formations during flight. We introduce a small set of fully distributed positioning rules to guide the birds' movements and demonstrate, by means of simulations, that…

We exhibit a new presentation of the (equilateral) Von Dyck groups $D(2,3,n), \ n\ge 3$, in terms of two generators of order $n$ satisfying three relations, one of which is Artin's braid relation. By dropping the relation which fixes the…

We consider natural exponential families of Levy processes with randomized parameter. Such processes are Markov, and under suitable assumptions, pairs of such processes with shared randomization can be stitched together into a single…

We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…

Complex braid groups are the natural generalizations of braid groups associated to arbitrary (finite) complex reflection groups. We investigate several methods for computing the homology of these groups. In particular, we get the Poincar\'e…