George Boole statue to be erected in Lincoln

It was George Boole’s bicentenary in 2015, so the Heslam Trust is a bit slow to reveal its plans to erect a statue of the great man in his home town of Lincoln.

The sculptors, Martin Jennings and Antony Dufort, have come up with a few designs for the statue, and they’d like the public to vote for their favourite.

There’s already a bust of Boole in University College, Cork, installed in plenty of time for the bicentenary. Here’s a picture of me and HRH Poppy Dog standing next to it, last Summer.

More information

Lincoln maths genius to get statue in city – and here are the designs at LincolnshireLive

Proposals for George Boole monument on the City of Lincoln council website

View the proposals and vote

Hans Rosling and Raymond Smullyan have died

Why should I worry about dying? It’s not going to happen in my lifetime!

Raymond Smullyan, This Book Needs No Title (1986)

This week, the mathematical community has lost not one but two of its most beloved practitioners. Earlier this week, Swedish statistician Hans Rosling passed away aged 68, and today it’s been announced that author and logician Raymond Smullyan has also died, aged 97.

Dani’s OEIS adventures: triangular square numbers

Hi! I’m Dani Poveda. This is my first post here on The Aperiodical. I’m from Spain, and I’m not a mathematician (I’d love to be one, though). I’m currently studying a Spanish equivalent to HNC in Computer Networking. I’d like to share with you some of my inquiries about some numbers. In this case, about triangular square numbers.

I’ll start at the beginning.

I’ve always loved maths, but I wasn’t aware of the number of YouTube maths channels there were. During the months of February and March 2016, I started following some of them (Brady Haran’s Numberphile, James Grime and Matt Parker among others). On July 13th, Matt published the shortest maths video he has ever made:

Maybe it’s a short video, but it got me truly mired in those numbers, as I’ve loved them since I read The Number Devil when I was 8. I only needed some pens, some paper, my calculator (Casio fx-570ES) and if I needed extra help, my laptop to write some code. And I had that quite near me, as I had just got home from tutoring high school students in maths.

I’ll start explaining now how I focused on this puzzle trying to figure out a solution.

Mobile Numbers: Products of Twin Primes

In this series of posts, Katie investigates simple mathematical concepts using the Google Sheets spreadsheet app on her phone. If you have a simple maths trick, pattern or concept you’d like to see illustrated in this series, please get in touch.

Having spoken at the MathsJam annual conference in November 2016 about my previous phone spreadsheet on multiples of nine, I was contacted by a member of the audience with another interesting number fact they’d used a phone spreadsheet to investigate: my use of =MID() to pick out individual digits had inspired them, and I thought I’d share it here in another of these columns (LOL spreadsheet jokes).

Graph Isomorphism panto: oh no it isn’t; oh yes it is!

As we reported back in November 2015, László Babai came up with an algorithm to decide if two graphs are isomorphic in quasipolynomial time. At the time, this proof still needed peer review, and in the last week or so, two big developments have occurred on that front.

On Wednesday 4th January, an error was discovered in the proof. Harald Helfgott (of the University of Göttingen in Germany and France’s National Center for Scientific Research), who studied the paper for several months, discovered that the algorithm was not quasipolynomial ($\displaystyle{ 2^{\mathrm{O}((\log n)^{c})} }$ for some fixed $c>0$) as claimed, but merely subexponenential: growing faster than a polynomial but still significantly slower than exponential growth).

Adorably, Babai posted this message on his website:

I apologize to those who were drawn to my lectures on this subject solely because of the quasipolynomial claim, prematurely magnified on the internet in spite of my disclaimers. I believe those looking for an interesting combination of group theory, combinatorics, and algorithms need not feel disappointed.

But maths is all about the drama, so on Monday 9th January Babai announced a fix for the error, and it’s now back on the quasipolynomial table. This has now been confirmed (as of 14th Jan) by Harald Helfgott himself at the Bourbaki seminar in Paris. Amusingly, Helfgott had only been studying the paper in such detail in order to give the seminar, and it was this close scrutiny which allowed him to discover the mistake.

More information

Announcement on Babai’s website

Fixing the UPCC Case of Split-or-Johnson – Babai’s paper detailing the fix (PDF)

Graph Isomorphism Vanquished — Again, at Quanta Magazine

Bourbaki Seminar – Harald Helfgott, on YouTube