activity
20072016
most citedZappa-Szép products of Garside monoids

9 citations · 23 across the 5 of their papers we have counts for

collaborators

6 papers

math.CO2016★ 4 cited

Constructing unlabelled lattices

Volker Gebhardt, Stephen Tawn

We present an improved orderly algorithm for constructing all unlabelled lattices up to a given size, that is, an algorithm that constructs the minimal element of each isomorphism…

math.GR2014★ 6 cited

On the penetration distance in Garside monoids

Volker Gebhardt, Stephen Tawn

We prove that the exponential growth rate of the regular language of penetration sequences is smaller than the growth rate of the regular language of normal form words, if the acce…

math.GR2014★ 9 cited

Zappa-Szép products of Garside monoids

Volker Gebhardt, Stephen Tawn

A monoid is the internal Zappa-Szép product of two submonoids, if every element of admits a unique factorisation as the product of one element of each of the submonoids in…

math.GR2013

Normal forms of random braids

Volker Gebhardt, Stephen Tawn

Analysing statistical properties of the normal forms of random braids, we observe that, except for an initial and a final region whose lengths are uniformly bounded (that is, the b…

math.GR2009★ 3 cited

A presentation for the pure Hilden group

Stephen Tawn

Consider the unit ball, , containing unknotted arcs such that the boundary of each lies in . The Hilden (or Wicke…

math.GR2007★ 1 cited

A presentation for Hilden's subgroup of the braid group

Stephen Tawn

Consider the unit ball, B = D x [0,1], containing n unknotted arcs a_1, ... a_n such that the boundary of each a_i lies in D x {0}. We give a finite presentation for the mapping cl…