The University of Southampton
University of Southampton Institutional Repository

A bound for the number of automorphisms of an arithmetic Riemann surface

A bound for the number of automorphisms of an arithmetic Riemann surface
A bound for the number of automorphisms of an arithmetic Riemann surface
We show that for every g ? 2 there is a compact arithmetic Riemann surface of genus g with at least 4(g-1) automorphisms, and that this lower bound is attained by infinitely many genera, the smallest being 24.
0305-0041
289-299
Belolipetsky, Mikhail
03ccee8b-7210-44cd-b80d-a043cea3415e
Jones, Gareth A.
fdb7f584-21c5-4fe4-9e57-b58c78ebe3f5
Belolipetsky, Mikhail
03ccee8b-7210-44cd-b80d-a043cea3415e
Jones, Gareth A.
fdb7f584-21c5-4fe4-9e57-b58c78ebe3f5

Belolipetsky, Mikhail and Jones, Gareth A. (2005) A bound for the number of automorphisms of an arithmetic Riemann surface. Mathematical Proceedings of the Cambridge Philosophical Society, 138 (2), 289-299. (doi:10.1017/S0305004104008035).

Record type: Article

Abstract

We show that for every g ? 2 there is a compact arithmetic Riemann surface of genus g with at least 4(g-1) automorphisms, and that this lower bound is attained by infinitely many genera, the smallest being 24.

This record has no associated files available for download.

More information

Published date: March 2005

Identifiers

Local EPrints ID: 41174
URI: http://eprints.soton.ac.uk/id/eprint/41174
ISSN: 0305-0041
PURE UUID: 2287ff46-5283-4eff-8e99-3244e44eb12e

Catalogue record

Date deposited: 25 Jul 2006
Last modified: 15 Mar 2024 08:25

Export record

Altmetrics

Contributors

Author: Mikhail Belolipetsky
Author: Gareth A. Jones

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×