E. Kowalski’s blog

In my paper with É. Fouvry and Ph. Michel where we find upper bounds for the number of certain sheaves on the affine line over a finite field with bounded ramification, the combinatorial part of the argument involves spherical codes and the method of Kabatjanski and Levenshtein, and turns out to depend on the rather recondite question of knowing a lower bound on the size of the largest zero of the -th Hermite polynomial , which is defined for integers by

This is a classical orthogonal polynomial (which implies in particular that all zeros of are real and simple). The standard reference for such questions seems to still be Szegö’s book, in which one can read the following rather remarkable asymptotic formula:

where is the first (real) zero of the function

which is a close cousin of the Airy function (see formula (6.32.8) in Szegö’s book, noting that he observes the Peano paragraphing rule, according to which section 6.32 comes before 6.4).

(Incidentally, if — like me — you tend to trust any random PDF you download to check a formula like that, you might end up with a version containing a typo: the cube root of is, in some printings, replaced by a square root…)

Szegö references work of a number of people (Zernike, Hahn. Korous, Bottema, Van Veen and Spencer), and sketches a proof based on ideas of Sturm on comparison of solutions of two differential equations.

As it happens, it is better for our purposes to have explicit inequalities, and there is an elementary proof of the estimate

which is only asymptotically weaker by a factor from the previous formula. This is also explained by Szegö, and since the argument is rather cute and short, I will give a sketch of it.

Besides the fact that the zeros of are real and simple, we will use the easy facts that , and that is an even function for even, and an odd function for odd, and most importantly (since all other properties are rather generic!) that they satisfy the differential equation

The crucial lemma is the following result of Laguerre:

Let be a polynomial of degree . Let be a simple zero of , and let

Then if is any line or circle passing through and , either all zeros of are in , or both components of contain at least one zero of .

Before explaining the proof of this, let’s see how it gives the desired lower bound on the largest zero of . We apply Laguerre’s result with and . Using the differential equation, we obtain

Now consider the circle such that the segment is a diameter of .

Now note that is the smallest zero of (as we observed above, is either odd or even). We can not have : if that were the case, the unbounded component of the complement of the circle would not contain any zero, and neither would contain all zeros (since ), contradicting the conclusion of Laguerre's Lemma. Hence we get
and this implies

as claimed. (Note that if , one deduces easily that the inequality is strict, but there is equality for .)

Now for the proof of the Lemma. One defines a polynomial by

so that has degree and has zero set formed of the zeros of different from (since the latter is assumed to be simple). Using the definition, we have

We now compute the value at of the logarithmic derivative of , which is well-defined: we have

hence

which becomes, by the above formulas and the definition of , the identity

or equivalently

where is a Möbius transformation.

Recalling that , this means that is the average of the . It is then elementary that for line , either is contained in , or intersects both components of the complement of . Now apply to this assertion: one gets that either is contained in , or intersects both components of the complement of . We are now done, after observing that the lines passing through are precisely the images under of the circles and lines passing through and through (because , and each line passes through in the projective line.)

Topological thinking is rooted in local issues — the soil, the plants, the weather, and the local customs. Peoples’ well-being is its objective.

“Orismology”, from the Oxford English Dictionary Word Of The Day, is the right term for the discussion of technical terminology (the théorie des termes de métier, as we say in French).

I am currently the head of the Mathematics Library at ETH (which is separate from the main library). A few days ago, I surveyed some of the (relatively) old books in our collection with one of the librarians, just to see if some of these should be handled in a special way. We didn’t find anything really out of the ordinary (no copy of Poincaré’s works heavily annotated by H. Weyl, I’m afraid), but one book has some historical interest: it is (or seems to be) Stickelberger’s copy of Jacobi’s “Canon arithmeticus”

a table of primitive roots and discrete logarithms for primes up to 1000.

Stickelberger’s signature is found on one of the first pages

The table itself, as it took me a few minutes to understand (my Latin being non-existent), lists for each prime the “Numeri” and the “Index” , which are defined by the relation

for some primitive root modulo , which can be identified easily by looking for the number for which is equal to :

So above we see that Jacobi selected as primitive root modulo and , and as primitive root modulo , or as primitive root modulo . Obligingly, he also indicates the factorization of (so that all primitive roots can be easily found by checking whether the corresponding index is coprime with ).

Like the copy which was digitized by Google, Stickelberger’s has a list of corrections at the end, and most (if not all: I didn’t check…) of these are incorporated in pencil in the main text, as here with :

However, Stickelberger (if it was him) also had another list of corrections, written down on a separate loose sheet of paper inserted at the end of the book.

These corrections are reproduced from the paper On quasi-mersennian numbers by Lieutenant Colonel Allan Cunningham in Vol. 41 of the Messenger of Mathematics (a volume which seems famous in statistical circles because it contains, ten pages later, an important paper of R.A. Fisher on maximum likelihood…) But even Cunningham’s corrections contain a few mistakes, which Stickelberger reports (though with question marks):

Indeed, for , the primitive root chosen by Jacobi is and we have

instead of reported by Cunningham (and in the Canon).

As far as I could see during my quick inspection, there are no further annotations or comments by Stickelberger, nor any date indicating when he acquired this book. The publication date is 1839, and the only other indication is that the volume of the Messenger of Mathematics with Cunningham’s paper appeared in 1912. I also do not known when and how the book entered the collection of ETH.

From a recent article in the New York Times:

“On the satellite channels, I watch ‘America’s Got Talent’ dubbed in Persian, while at the same time, our state television is showing an hourlong program on mathematics. Which one would you prefer?” asked ************, 30, an insurance salesman.