Abstract

AbstractThe projective special linear group PSL(V) is generated by dations. Among all factorizations of p ∈ PSL(V) into dations there will be one (or more) with the least number of factors. We determine this number, i.e. we solve the length problem for the projective special linear group. We solve a similar problem for the projective unimodular group which is generated by harmonic homologies. The projective special linear group and the projective unimodular group are the most important special cases of projective hyperreflection groups. We also solve the length problem for the general case.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call