Counting vertex-labelled bipartite graphs and computing growth functions of braid monoids

Details Counting vertex-labelled bipartite graphs and computing growth functions of braid monoids Counting vertex-labelled bipartite graphs and computing growth functions of braid monoids

2012-01-31

arxiv.org/abs/1201.6506v1

Mathematics

Group Theory

15 pages

Scientific paper

We derive a recurrence relation for the number of simple vertex-labelled bipartite graphs with given degrees of the vertices and use this result to obtain a new method for computing the growth function of the Artin monoid of type $A_{n-1}$ with respect to the simple elements (permutation braids) as generators. Instead of matrices of size $2^{n-1}\times 2^{n-1}$, we use matrices of size $p(n)\times p(n)$, where $p(n)$ is the number of partitions of $n$.

Affiliated with

Also associated with

No associations

Rating

Counting vertex-labelled bipartite graphs and computing growth functions of braid monoids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting vertex-labelled bipartite graphs and computing growth functions of braid monoids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting vertex-labelled bipartite graphs and computing growth functions of braid monoids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-56779