The Swiss Science Foundation (SNF in German, FNS in French) publishes a regular magazine that surveys current topics concerning science and research in Switzerland. It often highlights subjects that are unexpected and interesting in all areas of science, from the humanities to forestry, the deterioration of prussian blue in paintings and so on, and does so in its three parallel editions, in English, French and German.
The last issue has a special focus on Open Science in its various forms. For some reason, although there is no discussion of Polymath per se, the editors decided to have a picture of a mathematician working on Polymath as an illustration, and they asked me if they could make such a picture with me, and in fact two of them (the photographer is Valérie Chételat) appear in the magazine. Readers may find it amusing to identify which particular comment of the Polymath 8 blog I am feigning to be studying in those pictures…
Besides (and of greater import than) this, I recommend looking at the illustration pages 6 and 7,
which is a remarkably precise computer representation of the 44000 trees in a forest near Baden, each identified and color-coded according to its species… (This is done by the team of M. Schaepman at the University of Zürich).
People studying automorphic forms, automorphic representations, number fields, diophantine equations, function fields, algebraic curves, equidistribution and many other arithmetic objects (j’en passe, et des meilleurs), often end up with some “L-function” to deal with — indeed, probably equally often, with a whole family of them, sometimes not so well-behaved… These objects are fascinating, mystifying, exhilarating, random and possibly spooky. Where they really come from is still a mystery, even with buzzwords aplenty ringing around our ears. But one remarkable thing was already known to Euler and to Riemann: one can compute with L-functions. One impressive research project has been building, for quite a few years, a very sophisticated website presenting enormous amounts of data about L-functions of many kinds. The L-functions Database is now out of its beta status: go see it, and have a look at the list of editors to see who should be thanked for this amazing work!
Two days ago, I was in Paris and visited the École Polytechnique there (for the first time, as it turns out), in order to give the traditional introductory lecture presenting various aspects of mathematics that is given each year to the incoming class of students. (Many people would wonder how a new class can be incoming in April; this is because the students of École Polytechnique, which is a military school, begin their studies with a military/civil service from September to April).
I had selected expander graphs as the topic of my talk, as being simultaneously a very modern subject, that can be presented with very basic definitions (most students, coming from the French “Classes préparatoires” have had two very solid years of mathematical studies, but of a rather traditional kind), and that has links to many different areas, including more applied ones.
The slides of my presentation can be found here, in French, and I prepared an English translation there (up to the handwritten bits of information on certain pictures, which will remain in French…) Actually, the slides by themselves are not particularly interesting, since there are many remarks and details that I only described during the talk.
The talk begins with a discussion of graphs, continues with basic notions of expansion, and then defines expander graphs, with a bit of the history (especially the paper of Barzdin and Kolmogorov that I like very much), and concludes with two applications (among many…): Apollonian circle packings, and the Gromov-Guth knot-distorsion theorem. If this looks like a lot of ground to cover, this is because the talk was 1h30 long…
While preparing the first part of the talk, I researched some examples of graphs with more care than I had done before. Some of the things I found are extremely interesting, and since they might not be so well-known among my readers, I will present them quickly.
(1) The worm is Caenorhabditis elegans, more chummily known as C. elegans, one of the stars of neurosciences, as being the only animal whose entire nervous system has been mapped at the level of all individual neurons and connections between them. This was done in 1986 by White, Southgate, Thomson and Brenner, with minor corrections since then, and an important update and representation in 2011 by Varshney, Chen, Paniagua and Chklovskii. The resulting graph has 302 neurons (this number is apparently constant over all individuals), and about 8000 edges. (Interestingly, it is naturally a mix of directed and un-directed edges, depending on the type of biological connection). The paper of Varshney, Chen, Paniagua and Chklovskii is quite fascinating, as it investigates many mathematical invariants of the graph, and for instance compares the number of small subgraphs of various types with the expected number for random graphs with comparable parameters (certain subgraphs arise with higher frequency…)
Much more about C. elegans is found on dedicated websites, including Openworm, which seems to have as a goal to recreate the animal virtually…
(2) The brain is the humain brain; it can’t be mapped at the level of C. elegans (there are about neurons and synapses, from what I’ve seen), but I read a very interesting survey by Valiant about attempts to understand the computational model underpinning the reasoning capacities of the brain. He presents four basic tasks that must be among those that the brain performs, and explains how he succeeded in earlier work (from 1994 to 2005) in finding realistic algorithms and models for these problems. He comments:
In [5,14] it is shown that algorithms for the four random
access tasks described above can be performed on the
neuroidal model with realistic values of the numerical
parameters. The algorithms used are all of the vicinal
style. Their basic steps are all local in that they only
change synaptic strengths between pairs of neurons that
are directly connected. Yet they need to achieve the more
global objectives of random access. In order that they be
able to do this certain graph theoretic connectivity prop-
erties are required of the network. The property of
expansion , that any set of a certain number of
neurons have between them substantially more neighbors
than their own number, is an archetypal such property.
(This property, widely studied in computer science, was
apparently first discussed in a neuroscience setting .)
The vicinal algorithms for the four tasks considered here
need some such connectivity properties. In each case
random graphs with appropriate realistic parameters have
it, but pure randomness is not necessarily essential.
Here reference  is to the Barzdin-Kolmogorov paper.
(3) Lastly, I was wondering what is the size (number of vertices) of the largest graphs for which the first non-zero Laplace eigenvalue has been computed, approximately. The best I found is a paper of Kang, Breed, Papalexakis, and Faloutsos, which describes an algorithm that they have applied successfully to real-world graphs with about a billion vertices. This is rather impressive…
Yesterday my younger son was playing dice; the game involved throwing 6 dices simultaneously, and he threw a complete set 1, 2, 3, 4, 5, 6, twice in a row!
Is that a millenial-style coincidence worth cosmic pronouncements? Actually, not that much: since the dices are indistinguishable, the probability of a single throw of this type is
so about one and a half percent. And for two, assuming independence, we get a probability
or a bit more than one chance in five throusand. This is small, but not extraordinarily so.
(The dices are thrown from a cup, so the independence assumption is quite reliable here.)