MONOID GROWTH FUNCTIONS FOR BRAID GROUPS

1991 ◽  
Vol 01 (02) ◽  
pp. 201-205 ◽  
Author(s):  
MARCUS BRAZIL

It is shown that for all n, the braid group on n strings, Bn, has rational growth with respect to a certain set of elements of the group which generate it as a monoid. In particular, the precise growth function for B4 is calculated.

2017 ◽  
Author(s):  
Mikael Vejdemo-Johansson

The growth function is the generating function for sizes of spheres around the identity in Cayley graphs of groups. We present a novel method to calculate growth functions for automatic groups with normal form recognizing automata that recognize a single normal form for each group element, and are at most context free in complexity: context free grammars can be translated into algebraic systems of equations, whose solutions represent generating functions of their corresponding non-terminal symbols. This approach allows us to seamlessly introduce weightings on the growth function: assign different or even distinct weights to each of the generators in an underlying presentation, such that this weighting is reflected in the growth function. We recover known growth functions for small braid groups, and calculate growth functions that weight each generator in an automatic presentation of the braid groups according to their lengths in braid generators.


2017 ◽  
Author(s):  
Mikael Vejdemo-Johansson

The growth function is the generating function for sizes of spheres around the identity in Cayley graphs of groups. We present a novel method to calculate growth functions for automatic groups with normal form recognizing automata that recognize a single normal form for each group element, and are at most context free in complexity: context free grammars can be translated into algebraic systems of equations, whose solutions represent generating functions of their corresponding non-terminal symbols. This approach allows us to seamlessly introduce weightings on the growth function: assign different or even distinct weights to each of the generators in an underlying presentation, such that this weighting is reflected in the growth function. We recover known growth functions for small braid groups, and calculate growth functions that weight each generator in an automatic presentation of the braid groups according to their lengths in braid generators.


2018 ◽  
Vol 27 (06) ◽  
pp. 1850043 ◽  
Author(s):  
Paul P. Gustafson

We show that any twisted Dijkgraaf–Witten representation of a mapping class group of an orientable, compact surface with boundary has finite image. This generalizes work of Etingof et al. showing that the braid group images are finite [P. Etingof, E. C. Rowell and S. Witherspoon, Braid group representations from twisted quantum doubles of finite groups, Pacific J. Math. 234 (2008)(1) 33–42]. In particular, our result answers their question regarding finiteness of images of arbitrary mapping class group representations in the affirmative. Our approach is to translate the problem into manipulation of colored graphs embedded in the given surface. To do this translation, we use the fact that any twisted Dijkgraaf–Witten representation associated to a finite group [Formula: see text] and 3-cocycle [Formula: see text] is isomorphic to a Turaev–Viro–Barrett–Westbury (TVBW) representation associated to the spherical fusion category [Formula: see text] of twisted [Formula: see text]-graded vector spaces. The representation space for this TVBW representation is canonically isomorphic to a vector space of [Formula: see text]-colored graphs embedded in the surface [A. Kirillov, String-net model of Turaev-Viro invariants, Preprint (2011), arXiv:1106.6033 ]. By analyzing the action of the Birman generators [J. Birman, Mapping class groups and their relationship to braid groups, Comm. Pure Appl. Math. 22 (1969) 213–242] on a finite spanning set of colored graphs, we find that the mapping class group acts by permutations on a slightly larger finite spanning set. This implies that the representation has finite image.


2008 ◽  
Vol 17 (01) ◽  
pp. 47-53 ◽  
Author(s):  
PING ZHANG

It is shown that for the braid group Bn(M) on a closed surface M of nonnegative Euler characteristic, Out (Bn(M)) is isomorphic to a group extension of the group of central automorphisms of Bn(M) by the extended mapping class group of M, with an explicit and complete description of Aut (Bn(S2)), Aut (Bn(P2)), Out (Bn(S2)) and Out (Bn(P2)).


2000 ◽  
Vol 09 (08) ◽  
pp. 1005-1009
Author(s):  
Reinhard Häring-Oldenburg

We recast the braid-lift representation of Contantinescu, Lüdde and Toppan in the language of B-type braid theory. Composing with finite dimensional representations of these braid groups we obtain various sequences of finite dimensional multi-parameter representations.


1998 ◽  
Vol 1998 ◽  
pp. 47-47
Author(s):  
R.M. Lewis ◽  
G.C. Emmans ◽  
G. Simm ◽  
W.S. Dingwall ◽  
J. FitzSimons

The idea that an animal of a given kind has, and grows to, a final or mature size is a useful one and several equations have been proposed that describe such growth to maturity (Winsor, 1932; Parks, 1982; Taylor, 1982). The Gompertz is one of these growth functions and describes in a comparatively simple, single equation the sigmoidal pattern of growth. It has 3 parameters, only 2 of which are important - mature size A and the rate parameter B. Estimates of A and B, however, are highly correlated. Considering A and B as a lumped parameter (AB) may overcome this problem. A Gompertz, or any other, growth function is not expected to describe all growth curves. When the environment (e.g., feed, housing) is non-limiting, it may provide a useful and succinct description of growth. The objectives of this study were to examine: (i) if the Gompertz equation adequately describes the growth of two genotypes of sheep under conditions designed to be non-limiting; and, (ii) if the lumped parameter AB has more desirable properties for estimation than A and B separately.


Author(s):  
Anthony Genevois

In this paper, we initiate a geometric study of graph braid groups. More precisely, by applying the formalism of special colorings introduced in a previous paper, we determine precisely when a graph braid group is Gromov-hyperbolic, toral relatively hyperbolic and acylindrically hyperbolic.


2020 ◽  
Vol 29 (01) ◽  
pp. 1950097
Author(s):  
Jacob Mostovoy ◽  
Christopher Roque-Márquez

The group of planar (or flat) pure braids on [Formula: see text] strands, also known as the pure twin group, is the fundamental group of the configuration space [Formula: see text] of [Formula: see text] labeled points in [Formula: see text] no three of which coincide. The planar pure braid groups on 3, 4 and 5 strands are free. In this note, we describe the planar pure braid group on 6 strands: it is a free product of the free group on 71 generators and 20 copies of the free abelian group of rank two.


1992 ◽  
Vol 15 (3) ◽  
pp. 499-508
Author(s):  
Mohammad H. Ahmadi

We start with finitely many1's and possibly some0's in between. Then each entry in the other rows is obtained from the Base2sum of the two numbers diagonally above it in the preceding row. We may formulate the game as follows: Defined1,jrecursively for1, a non-negative integer, andjan arbitrary integer by the rules:d0,j={1     for   j=0,k         (I)0   or   1   for   0<j<kd0,j=0   for   j<0   or   j>k              (II)di+1,j=di,j+1(mod2)   for   i≥0.      (III)Now, if we interpret the number of1's in rowias the coefficientaiof a formal power series, then we obtain a growth function,f(x)=∑i=0∞aixi. It is interesting that there are cases for which this growth function factors into an infinite product of polynomials. Furthermore, we shall show that this power series never represents a rational function.


2005 ◽  
Vol 14 (08) ◽  
pp. 1087-1098 ◽  
Author(s):  
VALERIJ G. BARDAKOV

We construct a linear representation of the group IA (Fn) of IA-automorphisms of a free group Fn, an extension of the Gassner representation of the pure braid group Pn. Although the problem of faithfulness of the Gassner representation is still open for n > 3, we prove that the restriction of our representation to the group of basis conjugating automorphisms Cbn contains a non-trivial kernel even if n = 2. We construct also an extension of the Burau representation to the group of conjugating automorphisms Cn. This representation is not faithful for n ≥ 2.


Sign in / Sign up

Export Citation Format

Share Document