Skip Navigation


Bulletin of the London Mathematical Society Advance Access originally published online on May 7, 2008
Bulletin of the London Mathematical Society 2008 40(4):613-618; doi:10.1112/blms/bdn040
This Article
Right arrow FREE Full Text (PDF) Freely available
Right arrow All Versions of this Article:
40/4/613    most recent
bdn040v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chapman, S. T.
Right arrow Articles by Smith, W. W.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2008 London Mathematical Society

On minimal distances in Krull monoids with infinite class group

S. T. Chapman

Department of Mathematics
Trinity University
One Trinity Place
San Antonio, TX 78212-7200
USA

W. A. Schmid

Institut für Mathematik und Wissenschaftliches Rechnen
Karl-Franzens-Univer-sität Graz
Heinrichstraße 36
8010 Graz
Austria
wolfgang.schmid@uni-graz.at

W. W. Smith

Department of Mathematics
The University of North Carolina at Chapel Hill
Phillips Hall
Chapel Hill, NC 27599
USA
wwsmith@email.unc.edu

Received 12 June 2007. Revision received 15 January 2008.

Let H be a Krull monoid with infinite class group such that each divisor class contains a prime divisor. It is shown that for every positive integer n, there exists a divisor closed submonoid S of H such that min {Delta}(S) = n.

2000 Mathematics Subject Classification 20K01, 13F05, 11R27.

The second author is supported by the FWF (Project no. P18779 [GenBank] -N13).


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.