Beurling zeta functions, generalised primes, and fractal membranes

We study generalised prime systems P (1 < p(1) <= p(2) <= ..., with p(j) is an element of R tending to infinity) and the associated Beurling zeta function zeta p(s) = Pi(infinity)(j=1)(1 - p(j)(-s))(-1). Under appropriate assumptions, we establish various analytic properties of zeta p(s), including its analytic continuation, and we characterise the existence of a suitable generalised functional equation. In particular, we examine the relationship between a counterpart of the Prime Number Theorem (with error term) and the properties of the analytic continuation of zeta p(s). Further we study 'well-behaved' g-prime systems, namely, systems for which both the prime and integer counting function are asymptotically well-behaved. Finally, we show that there exists a natural correspondence between generalised prime systems and suitable orders on N-2. Some of the above results are relevant to the second author's theory of 'fractal membranes', whose spectral partition functions are given by Beurling-type zeta functions, as well as to joint work of that author and R. Nest on zeta functions attached to quasicrystals.

Assimilation and contrast to group primes: the moderating role of ingroup identification

This research examined the conditions under which behavioral contrast would be observed in relation to ingroup and outgroup primes. The authors tested the hypothesis that differing levels of commitment to the ingroup would predict diverging behavioral responses to outgroup but not ingroup primes. Across two studies, featuring both age and gender groups, we found that ingroup identification predicted responses to outgroup primes with higher identifiers showing an increased tendency to contrast, that is, behave less like the outgroup, and more like the ingroup. Ingroup identification did not predict responses to ingroup primes. The implications of these findings for social comparison and social identity theories are discussed. (c) 2007 Elsevier Inc. All rights reserved.

An example in Beurling's theory of generalised primes

In this paper we prove some connections between the growth of a function and its Mellin transform and apply these to study an explicit example in the theory of Beurling primes.

Mersenne numbers

These notes have been issued on a small scale in 1983 and 1987 and on request at other times. This issue follows two items of news. First, WaIter Colquitt and Luther Welsh found the 'missed' Mersenne prime M110503 and advanced the frontier of complete Mp-testing to 139,267. In so doing, they terminated Slowinski's significant string of four consecutive Mersenne primes. Secondly, a team of five established a non-Mersenne number as the largest known prime. This result terminated the 1952-89 reign of Mersenne primes. All the original Mersenne numbers with p < 258 were factorised some time ago. The Sandia Laboratories team of Davis, Holdridge & Simmons with some little assistance from a CRAY machine cracked M211 in 1983 and M251 in 1984. They contributed their results to the 'Cunningham Project', care of Sam Wagstaff. That project is now moving apace thanks to developments in technology, factorisation and primality testing. New levels of computer power and new computer architectures motivated by the open-ended promise of parallelism are now available. Once again, the suppliers may be offering free buildings with the computer. However, the Sandia '84 CRAY-l implementation of the quadratic-sieve method is now outpowered by the number-field sieve technique. This is deployed on either purpose-built hardware or large syndicates, even distributed world-wide, of collaborating standard processors. New factorisation techniques of both special and general applicability have been defined and deployed. The elliptic-curve method finds large factors with helpful properties while the number-field sieve approach is breaking down composites with over one hundred digits. The material is updated on an occasional basis to follow the latest developments in primality-testing large Mp and factorising smaller Mp; all dates derive from the published literature or referenced private communications. Minor corrections, additions and changes merely advance the issue number after the decimal point. The reader is invited to report any errors and omissions that have escaped the proof-reading, to answer the unresolved questions noted and to suggest additional material associated with this subject.

The poliovirus 2C cis-acting replication element-mediated uridylylation of VPg is not required for synthesis of negative-sense genomes

Nucleotides in the terminal loop of the poliovirus 2C cis-acting replication element (2C(CRE)), a 61 nt structured RNA, function as the template for the addition of two uridylate (U) residues to the viral protein VPg. This uridylylation reaction leads to the formation of VPgpUpU, which is used by the viral RNA polymerase as a nucleotide-peptide primer for genome replication. Although VPg primes both positive- and negative-strand replication, the specific requirement for 2C(CRE)-mediated uridylylation for one or both events has not been demonstrated. We have used a cell-free in vitro translation and replication reaction to demonstrate that 2C(CRE) is not required for the initiation of the negative-sense strand, which is synthesized in the absence of 2C(CRE)-mediated VPgpUpU formation. We propose that the 3' poly(A) tail could serve as the template for the formation of a VPg-poly(U) primer that functions in the initiation of negative-sense strands.

Generalised prime systems with periodic integer counting function

We study generalised prime systems (both discrete and continuous) for which the `integer counting function' N(x) has the property that N(x) ¡ cx is periodic for some c > 0. We show that this is extremely rare. In particular, we show that the only such system for which N is continuous is the trivial system with N(x) ¡ cx constant, while if N has finitely many discontinuities per bounded interval, then N must be the counting function of the g-prime system containing the usual primes except for finitely many. Keywords and phrases: Generalised prime systems. I

Bad reduction of genus three curves with complex multiplication

Let C be a smooth, absolutely irreducible genus 3 curve over a number field M. Suppose that the Jacobian of C has complex multiplication by a sextic CM-field K. Suppose further that K contains no imaginary quadratic subfield. We give a bound on the primes p of M such that the stable reduction of C at p contains three irreducible components of genus 1.