# E. Kowalski's blog

Comments on mathematics, mostly.

## Archive for Computers

07.05.2015

### New versions, new bugs

Filed under: Computers,Mathematics @ 9:22

Ph. Michel found the first bug in the new version of Kloostermania: when entering a modulus for a sum from the menu, there was no check that it is prime (or adjustment to make it so). This is now corrected in version 1.01, to be found in the usual place.

As another bonus feature, a double tap on the screen will cycle between the types of sums presented: Kloosterman sum to Birch sum to both to Kloosterman…

04.05.2015

### Kloostermania turns 1.0

Filed under: Computers,Mathematics @ 18:21

Since the Pocket Kloostermania has remained unchanged for almost five years, an update is probably welcome! This is now available, in time to honor N. Katz on the occasion of this 71st birthday (which I will help celebrate in China next week).

Important changes in the new version:

(1) It was recompiled — hence a new modern look instead of a style reminiscent of the dark ages –, and the resulting binary should work on any Android system with version 4.0.3 or later;

(2) To keep up with recent progress, the program now displays Kloosterman sums and/or Birch sums, instead of Kloosterman and/or Salié sums. On the other hand, the moduli used are now restricted to primes, to simplify things a bit, and only one parameter is used: the sums displayed are
$\sum_{x\in\mathbf{F}_p^{\times}}e\Bigl(\frac{ax+\bar{x}}{p}\Bigr)$
and
$\sum_{x\in\mathbf{F}_p}e\Bigl(\frac{ax+x^3}{p}\Bigr)$

(3) In addition to being able to change the modulus by swiping horizontally, a vertical swipe on the screen scrolls among the values of the parameter $a$. As was the case in the previous version (and even more because phones are faster now), the scrolling is usually too fast for a single step, so tapping once close to one of the edges of the window displaying the sum will perform just one step of the corresponding move (e.g., tapping close to the right of the screen goes to the next prime modulus). The value of the sum and its parameters and then displayed quickly.

(4) The plots are presented in orthonormal configurations, to give a more faithful representation of the paths in the plane;

Kloostermania

(5) In the “About” dialog, a single click will display (if a PDF viewer is installed) the paper of W. Sawin and myself that explains the limiting distribution of Kloosterman (and Birch) paths…

(6) It is possible to save (or rather to “share” in the usual Android way) a picture of the sums currently displayed, as a PNG file.

(6) And the launcher icon is better.

Icon

The installation file is available right now on the updated Kloostermania page!

11.04.2015

### Worms, brains and “graphes expanseurs”

Filed under: Computers,France,Mathematics,Science @ 13:03

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 $10^{11}$ neurons and $10^{15}$ 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 [15], 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 [16].)
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 [16] 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…

06.05.2012

### P. vs. NP and all that

Filed under: Computers,ETH,Mathematics @ 17:46

The coming Monday, Tuesday and Thursday, A. Wigderson will be in Zürich to give the yearly Pauli Lectures, with a general title of “The computational lens”. It seems to be the best possible time to share the following insight

from one of my family’s Minecraft sessions…

26.12.2011

### Emulation

Filed under: Computers,Language,Literature @ 19:06

One of the nicest things about Linux (and Open Source software in general) is that new versions often offer clear measurable improvements on the previous ones. And another is that this does not usually require abandoning whatever might have been worth keeping from other computer-ages. In particular, if one has very old software, there’s a good chance that one can still keep them working, even if they are written for a completely different operating system, through the wonders of emulation. In my case, this applies to Windows 3.1-era dictionary cdroms, and to Motorola 68000-era Mac software.
Recently, I had somewhat lapsed in performing the necessary tweaks to make these old programs work on my laptop (a decidedly modern 4-core Lenovo), but on upgrading Fedora, I decided to try again. It’s quite amazing that, through the wonders of Wine, I can enjoy again the Grand Robert de la Langue Française

(originally available for MS-DOS and Windows 3.1) as well as the American Heritage Dictionary

(though I use the O.E.D instead when I’m connected to the ETH network). The Grand Robert is the best anti-pedant tool I know against so-called défenseurs de la langue française; it usually reveals that their favorite anglicisms are perfectly French (e.g., opportunité, in the sense of “occasion, circumstance”, which goes back to 1355 in French, and is at least as French as Baudelaire…)

I’m even more impressed to be able to boot the equivalent of my old Mac SE30,

and thereby play with, or recover, the old files I used to work with during my PhD thesis and before. (In fact, the emulator boots in something like 1.5 seconds on my laptop, which is about a hundred times faster than it ever did in real life…) Afficionados will note the realistic 512 x 384 resolution of the screen.

Next Page »

© 2015 E. Kowalski's blog   Hosted by uzh|ethz Blogs