A computational method for the construction of Siegel sets in complex hyperbolic space

This thesis presents a computational method for constructing Siegel sets for the action of \Gamma = SU(n; 1;O) on HnC, where O is the ring of integers of an imaginary quadratic field with trivial class group. The thesis first presents a basic algorithm for computing Siegel sets and then considers pr...

Full description

Bibliographic Details
Main Author:	Tyler, B. M.
Published:	University College London (University of London) 2010
Subjects:	510
Online Access:	http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.565060

id	ndltd-bl.uk-oai-ethos.bl.uk-565060
record_format	oai_dc
spelling	ndltd-bl.uk-oai-ethos.bl.uk-5650602015-12-03T03:31:31ZA computational method for the construction of Siegel sets in complex hyperbolic spaceTyler, B. M.2010This thesis presents a computational method for constructing Siegel sets for the action of \Gamma = SU(n; 1;O) on HnC, where O is the ring of integers of an imaginary quadratic field with trivial class group. The thesis first presents a basic algorithm for computing Siegel sets and then considers practical improvements which can be made to this algorithm in order to decrease computation time. This improved algorithm is implemented in a C++ program called siegel, the source code for which is freely available at http://code.google.com/p/siegel/, and this program is used to compute explicit Siegel sets for the action of all applicable groups \Gamma on H2C and H3C.510University College London (University of London)http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.565060http://discovery.ucl.ac.uk/147750/Electronic Thesis or Dissertation
collection	NDLTD
sources	NDLTD
topic	510
spellingShingle	510 Tyler, B. M. A computational method for the construction of Siegel sets in complex hyperbolic space
description	This thesis presents a computational method for constructing Siegel sets for the action of \Gamma = SU(n; 1;O) on HnC, where O is the ring of integers of an imaginary quadratic field with trivial class group. The thesis first presents a basic algorithm for computing Siegel sets and then considers practical improvements which can be made to this algorithm in order to decrease computation time. This improved algorithm is implemented in a C++ program called siegel, the source code for which is freely available at http://code.google.com/p/siegel/, and this program is used to compute explicit Siegel sets for the action of all applicable groups \Gamma on H2C and H3C.
author	Tyler, B. M.
author_facet	Tyler, B. M.
author_sort	Tyler, B. M.
title	A computational method for the construction of Siegel sets in complex hyperbolic space
title_short	A computational method for the construction of Siegel sets in complex hyperbolic space
title_full	A computational method for the construction of Siegel sets in complex hyperbolic space
title_fullStr	A computational method for the construction of Siegel sets in complex hyperbolic space
title_full_unstemmed	A computational method for the construction of Siegel sets in complex hyperbolic space
title_sort	computational method for the construction of siegel sets in complex hyperbolic space
publisher	University College London (University of London)
publishDate	2010
url	http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.565060
work_keys_str_mv	AT tylerbm acomputationalmethodfortheconstructionofsiegelsetsincomplexhyperbolicspace AT tylerbm computationalmethodfortheconstructionofsiegelsetsincomplexhyperbolicspace
_version_	1718141555389235200

A computational method for the construction of Siegel sets in complex hyperbolic space

Similar Items