The symbolic value of grafting in ancient Rome

Some scholars have read Virgil’s grafted tree (G. 2.78–82) as a sinister image, symptomatic of man’s perversion of nature. However, when it is placed within the long tradition of Roman accounts of grafting (in both prose and verse), it seems to reinforce a consistently positive view of the technique, its results, and its possibilities. Virgil’s treatment does represent a significant change from Republican to Imperial literature, whereby grafting went from mundane reality to utopian fantasy. This is reflected in responses to Virgil from Ovid, Columella, Calpurnius, Pliny the Elder, and Palladius (with Republican context from Cato, Varro, and Lucretius), and even in the postclassical transformation of Virgil’s biography into a magical folktale.

Asymptotic expansions for Taylor coefficients of the composition of two functions

We give an asymptotic expansion for the Taylor coe±cients of L(P(z)) where L(z) is analytic in the open unit disc whose Taylor coe±cients vary `smoothly' and P(z) is a probability generating function. We show how this result applies to a variety of problems, amongst them obtaining the asymptotics of Bernoulli transforms and weighted renewal sequences.

Ω-results for Beurling's zeta function and lower bounds for the generalised Dirichlet divisor problem

In this paper we study generalised prime systems for which the integer counting function NP(x) is asymptotically well behaved, in the sense that NP(x)=ρx+O(xβ), where ρ is a positive constant and . For such systems, the associated zeta function ζP(s) is holomorphic for . We prove that for , for any ε>0, and also for ε=0 for all such σ except possibly one value. The Dirichlet divisor problem for generalised integers concerns the size of the error term in NkP(x)−Ress=1(ζPk(s)xs/s), which is O(xθ) for some θ<1. Letting αk denote the infimum of such θ, we show that .

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

'Quasi'-norm of an arithmetical convolution operator and the order of the Riemann zeta function

In this paper we study Dirichlet convolution with a given arithmetical function f as a linear mapping 'f that sends a sequence (an) to (bn) where bn = Pdjn f(d)an=d. We investigate when this is a bounded operator on l2 and ¯nd the operator norm. Of particular interest is the case f(n) = n¡® for its connection to the Riemann zeta function on the line 1, 'f is bounded with k'f k = ³(®). For the unbounded case, we show that 'f : M2 ! M2 where M2 is the subset of l2 of multiplicative sequences, for many f 2 M2. Consequently, we study the `quasi'-norm sup kak = T a 2M2 k'fak kak for large T, which measures the `size' of 'f on M2. For the f(n) = n¡® case, we show this quasi-norm has a striking resemblance to the conjectured maximal order of j³(® + iT )j for ® > 12 .

Typography papers, 9

This latest issue of the series of Typography papers opens with a beautifully illustrated article by the type designer Gerard Unger on ‘Romanesque’ letters. A further installment of Eric Kindel’s pathbreaking history of stencil letters is published in contributions by him, Fred Smeijers, and James Mosley. Maurice Göldner writes the first history of an early twentieth-century German typefounder, Brüder Butter. William Berkson and Peter Enneson recover the notion of ‘readability’ through a history of the collaboration between Matthew Luckiesh and the Linotype Company. Paul Luna discusses the role of pictures in dictionaries. Titus Nemeth describes a new form of Arabic type for metal composition. The whole gathering shows the remarkable variety and vitality of typography now.

An optimization problem concerning multiplicative functions

In this paper we study the problem of maximizing a quadratic form 〈Ax,x〉 subject to ‖x‖q=1, where A has matrix entries View the MathML source with i,j|k and q≥1. We investigate when the optimum is achieved at a ‘multiplicative’ point; i.e. where x1xmn=xmxn. This turns out to depend on both f and q, with a marked difference appearing as q varies between 1 and 2. We prove some partial results and conjecture that for f multiplicative such that 0

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.