Table of Contents
  Encyclosphere.org ENCYCLOREADER
  supported by EncyclosphereKSF

Abstract prime number theory

From Encyclopedia of Mathematics - Reading time: 7 min


In various branches of number theory, abstract algebra, combinatorics, and elsewhere in mathematics, it is sometimes possible and convenient to formulate a variety of enumeration or counting questions in a unified way in terms of the concept of an arithmetical semi-group G (cf. Abstract analytic number theory; Semi-group).

Special interest then attaches to the basic counting functions (for nZ): G(n)=#{aG:|a|=n} , P(n)=#{pP:|p|=n} where P denotes the set of "prime" elements in G.

If one of the functions G(n),P(n) has a certain type of asymptotic behaviour, it may then be possible to deduce that of the other by a uniform method of derivation. Theorems of the latter kind may then be referred to as abstract prime number theorems within the context considered.

Some concrete examples are given below.

Types of arithmetical semi-groups.[edit]

Axiom A[edit]

The prototype of all arithmetical semi-groups is of course the multiplicative semi-group N of all positive integers {1,2,3,}, with its subset PN of all rational prime numbers {2,3,5,7,}. Here one may define the norm of an integer |n| to be |n|=, so that the number N(n)=1 for n1.

Although N(n) would be too trivial to mention if one were not interested in a wider arithmetical theory, the corresponding function PN(n) remains mysterious to this day (as of 2000). The asymptotic behaviour of π(x)=nxPN(n) for large x forms the content of the famous prime number theorem, which states that

π(x)xlogx as x (cf. also de la Vallée-Poussin theorem).

A suitably generalized form of this theorem holds for many other naturally-occurring arithmetical semi-groups. For example, it is true for the multiplicative semi-group GK of all non-zero ideals in the ring R=R(K) of all algebraic integers in a given algebraic number field K, with |I|=card(R/I) for any non-zero ideal I in R. Here, the prime ideals act as prime elements of the semi-group GK, and both the corresponding functions GK(n), PK(n) are non-trivial to estimate in general. However, Landau's prime ideal theorem establishes that

πK(x)=nxPK(n)xlogx as x, while classical theorems of Weber and Landau yield

nxGK(n)=AKx+O(xηK) as x for explicit positive constants AK and ηK<1.

Similar types of asymptotic behaviour are displayed by many quite different types of concrete arithmetical semi-groups (cf. [a4], Part II, where these are referred to as "semi-groups satisfying axiom A" ).

Axiom A#.[edit]

For a simple but nevertheless interesting example of an additive arithmetical semi-group, one may consider the multiplicative semi-group Gq of all monic polynomials in one indeterminate X over a finite field Fq with q elements, with (a)=deg(a) and set Pq of prime elements represented by the irreducible polynomials (cf. also Irreducible polynomial). Here, Gq#(n)=qn, and it is a well-known theorem that

Pq#(n)=1nr|nμ(r)qn/r,

where μ is the classical Möbius function on N.

Up to isomorphism, Gq is the simplest special case of the semi-group GR of all non-zero ideals in the ring R=R(K) of all integral functions in an algebraic function field K in one variable X over Fq. Here, the set PR of prime ideals in R acts as the set of prime elements, and the degree (I) is defined by q(I)=card(R/I). The case K=Fq(x) leads back to Gq, and in general it can be proved that

GR#(n)=ARqn+O(1) as n,

and

PR#(n)=1nqn+O(1nqn/2) as n,

where AR is a positive constant.

Similar examples arise if one considers the semi-group GK of all "integral divisors" of K, instead of GR. Related types of asymptotic behaviour are also displayed by many quite different kinds of concrete additive arithmetical semi-groups (cf. [a6], [a11], where these are referred to as "semi-groups satisfying axiom A#" ).

Axioms G1 and Gλ.[edit]

Yet another natural class of additive arithmetical semi-groups G is provided by those satisfying axiom G1: "Almost all" elements of G are prime, in the sense that G#(n)>0 for sufficiently large n, and P#(n)G#(n) as n, i.e.,

limnP#(n)G#(n)=1.

Examples of this slightly unexpected property are provided by various classes Γ of finite graphs with the property that a graph H lies in Γ if and only if each connected component of H lies in Γ. Let the disjoint union d be used as follows to define a "product" operation on the set GΓ of all unlabelled graphs (i.e., isomorphism classes H of graphs H) in Γ: H1H2=H1dH2. Also, let (H)=# vertices in H. Then GΓ becomes an additive arithmetical semi-group.

For some classes Γ, GΓ satisfies axiom G1, and this is also true for the quite different multiplicative semi-group Gq,k formed by all associate-classes of non-zero polynomials in k>1 indeterminates X1,,Xk over a finite field Fq (cf. [a5]).

Ignoring the corresponding limit zero which occurs under axiom A#, and also under axiom A (in a certain sense), R. Warlimont [a10] raised the interesting question as to whether there are any "natural" instances of additive arithmetical semi-groups G satisfying axiom Gλ: There exists a 0<λ<1 with

limnP#(n)G#(n)=λ.

In the next section, a variety of "natural" examples of semi-groups satisfying axiom Gλ for various values of λ in (0,1) will be given.

Axiom Φ.[edit]

The concrete examples described below provide a variety of natural illustrations of additive arithmetical semi-groups G with the following property (axiom Φ): There exist real constants C>0, q>1, α>1, depending on G, such that

P#(n)Cqnnα as n.

Under these assumptions one has (cf. [a3]) an abstract (inverse) prime number theorem: If G is an additive arithmetical semi-group satisfying axiom Φ, then

G#(n)CZG(q1)qnnα as n,

where ZG(y)=r=0G#(r)yr.

It follows that if G satisfies axiom Φ, then G also satisfies axiom Gλ, for λ=λG=1/ZG(q1).

The set F of all unlabelled (i.e., isomorphism classes of) finite forests forms an additive arithmetical semi-group, whose prime elements are the unlabelled trees. A famous theorem of R. Otter [a7] states that the total number T#(n) of unlabelled trees with n vertices satisfies

T#(n)C0q0nn5/2 as n,

where C0 and q0 are explicitly described positive constants (q0>1). E.M. Palmer and A.J. Schwenk [a8] estimated the corresponding total number F#(n) of all unlabelled forests with n vertices. They showed that

F#(n)K0C0q0nn5/2 as  n,

where K0>1 is also an explicitly described constant.

This and various other families of trees provide "natural" examples of Warlimont's axiom Gλ as well as axiom Φ.

As considered by P. Hanlon [a2], an interval graph is defined mathematically as a finite graph H whose vertices are in one-to-one correspondence with a set of real closed intervals in such a way that two vertices are joined by an edge in H if and only if their corresponding intervals intersect non-trivially. If all the intervals have length one, H is called a unit-interval graph; if H is connected, and no two adjacent vertices have exactly the same set of neighbouring vertices, H is called reduced.

Based on the asymptotic estimates of Hanlon [a2] one may then deduce that the semi-group I corresponding to all unit-interval graphs satisfies axiom Φ.

Substantial advances have occurred in recent years (as of 2000) concerning the asymptotic enumeration of the non-isomorphic (combinatorially distinct) convex 3-polyhedra (or 3-polytopes).

Indeed, let PE#(n) denote the total number of combinatorially distinct convex 3-polyhedra with n edges (cf. also Polyhedron). L.B. Richmond and N.C. Wormald [a9] showed that

PE#(n)1468π4nn7/2 as n.

Soon after that, E.A. Bender and Wormald [a1] considered the corresponding numbers PV#(n), PF#(n) when n now represents the number of vertices, respectively faces, and derived a similar asymptotic estimate.

Let SE, SV, SF denote the additive arithmetical semi-groups which arise from the set S of all combinatorial equivalence classes of the above special 3-dimensional simplicial complexes.

Then it follows from the abstract inverse prime number theorem above that SE, SV and SF are further natural examples of semi-groups satisfying axiom Φ.

References[edit]

[a1] E.A. Bender, N.C. Wormald, "Almost all convex polyhedra are asymmetric" Canad. J. Math. , 27 (1985) pp. 854–871
[a2] P. Hanlon, "Counting interval graphs" Trans. Amer. Math. Soc. , 272 (1982) pp. 383–426
[a3] A. Knopfmacher, J. Knopfmacher, "Arithmetical semi-groups related to trees and polyhedra" J. Combin. Th. , 86 (1999) pp. 85–102
[a4] J. Knopfmacher, "Abstract analytic number theory" , North-Holland (1975) (Reprinted: Dover, 1990)
[a5] J. Knopfmacher, "Arithmetical properties of finite graphs and polynomials" J. Combin. Th. , 20 (1976) pp. 205–215
[a6] J. Knopfmacher, "Analytic arithmetic of algebraic function fields" , M. Dekker (1979)
[a7] R. Otter, "The number of trees" Ann. of Math. , 49 (1948) pp. 583–599
[a8] E.M. Palmer, A.J. Schwenk, "On the number of trees in a random forest" J. Combin. Th. B , 27 (1979) pp. 109–121
[a9] L.B. Richmond, N.C. Wormald, "The asymptotic number of convex polyhedra" Trans. Amer. Math. Soc. , 273 (1982) pp. 721–735
[a10] R. Warlimont, "A relationship between two sequences and arithmetical semi-groups" Math. Nachr. , 164 (1993) pp. 201–217
[a11] J. Knopfmacher, W.-B. Zhang, "Number theory arising from finite fields, analytic and probabilistic theory" , M. Dekker (2001)

How to Cite This Entry: Abstract prime number theory (Encyclopedia of Mathematics) | Licensed under CC BY-SA 3.0. Source: https://encyclopediaofmath.org/wiki/Abstract_prime_number_theory
12 views |
↧ Download this article as ZWI file
Encyclosphere.org EncycloReader is supported by the EncyclosphereKSF