Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-29T18:40:45.126Z Has data issue: false hasContentIssue false

Representation of an element in SL(2, ,) as a short word in two generators

Published online by Cambridge University Press:  24 October 2008

Andreas Bender
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, 16 Mill Lane, Cambridge CB2 1SB

Extract

It is one of the first theorems proved in the theory of modular forms [1, p. 78] that every element in SL (2, ℤ), and hence in SL(2, ), can be written as a product of the two generators

While this is quite an easy result, it required more advanced tools such as spectral analysis on Riemann surfaces [2] to show that there is in fact always such a product of length O(log p). This result is not constructive and therefore immediately [2, p. 102] raises the following:

Problem. Is there an algorithm polynomial in log p for constructing a monomial in S and T, of degree O(log p), whose value is

In this note, we construct such an algorithm. We will carry out all the details only for the particular element

but it will become obvious that our method works for all elements in SL(2, ).

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Serre, J. P.. A course in arithmetic (Springer Verlag, 1973).CrossRefGoogle Scholar
[2]Lubotzky, A.. Discrete groups, expanding graphs and invariant measures (Birkhaüser Verlag, 1994).CrossRefGoogle Scholar
[3]Perron, O.. Die Lehre von den Kettenbrüchen (B. G. Teubner Verlagsgesellschaft, 1954).Google Scholar