Hostname: page-component-7b7567c8c-48dgx Total loading time: 0 Render date: 2026-11-18T09:55:13.517Z Has data issue: false hasContentIssue false

The function field abstract prime number theorem

Published online by Cambridge University Press:  24 October 2008

Stephen D. Cohen
Affiliation:
Department of Mathematics, University of Glasgow, Glasgow G12 8QW
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

For arithmetical semigroups modelled on the positive integers, there is an ‘abstract prime number theorem’ (see, for example, [1]). In order to study enumeration problems in the several arithmetical categories whose prototype instead is the ring of polynomials in an indeterminate over a finite field of order q, Knopfmacher[2, 3] introduced the following modification. An additive arithmetical semigroup G is a free commutative semigroup with an identity, generated by a countable set of ‘primes’ P and admitting an integer-valued degree mapping ∂ with the properties

(i) ∂(l) = 0,∂(p) > 0 for p∈P;

(ii) ∂(ab) = ∂(a) + ∂(b) for all a, b in G;

(iii) the number of elements in G of degree n is finite. (This number will be denoted by G(n).)

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1989