Many of us just received the sudden news of the passing of Laci Kovács, who spent amost of his career at the Australian National University and retired around 2001. Laci was a student of Bernhard Neumann and supervised 18 graduate students.
My own personal interaction with Laci started in my honours year. I was lucky enough to have solved a problem in combinatorial group theory and I sent a draft of a paper to a dozen or so group theorists. Laci and I exchanged emails and I looked into the possibility of persuing a PhD with him, but what discouraged me from going to ANU was his plans to take long service leave, and possible retirement. Plus, I was also in contact with Cheryl Praeger who was effectively luring me to the west, and that’s what I eventually ended up doing. Laci ended up being one of my PhD examiners and took great interest in my work. He came to Perth at least a couple of times during my PhD and first postdoc, and we had long enjoyable discussions in my office, on politics (one of Laci’s pet subjects) and mathematics.
Laci was one of the integral members of the golden era of group theory at ANU, and he will be sorely missed by the GT-community.
Just a quick reminder that the annual “Australasian Conference on Combinatorial Mathematics and Combinatorial Computing” (ACCMCC) will be in Perth this December, and registration is open.
It’s a good idea to get in early in getting accommodation at St George’s College (across the road from UWA), which you must book yourself. The early-bird registration is available until 11th November.
For more information, please go to the conference webpage.
Yesterday, after lunch, Gordon, Luke Morgan, and I decided to grab a coffee from a local establishment:
Me: “We’ll have two long blacks and one short black please”.
Cashier: “Do you want milk in your long black?”
… Then we had this uncomfortable Louis Theroux moment where I looked at her blankly for a longer than normal amount of time.
Me: “If I did, then it wouldn’t be a long black then”.
I guess I’m used to enforcing the clarity of a definition.
I’m in France at the moment, having spent the last week at a workshop on matroid computation at Henry Crapo’s house in the tiny village of La Vacquerie et Saint Martin de Castries, but now I’ve moved on to Paris for a week.
I had been intending to drop in to see Michel Las Vergnas, but it seems that I somehow missed the sad news that he died in January. Although I only met him once, a few years go in Barcelona, we had frequently communicated about an exasperating conjecture of his.
A quick bit of background: start with the vertex-edge incidence matrix of the graph, such that the column corresponding to the edge has exactly two non-zero entries, both equal to one, in rows and . Viewed as a matrix over , the row space and null space of this matrix are called the cocycle space and the cycle space of the graph. The non-zero vectors in , called the cocycles, are the (characteristic vectors of the) cut-sets of the graph, while the non-zero vectors in , called the cycles, are the subgraphs in which every vertex has even degree. (Notice that this notion of cycle is considerably broader than the usual graph-theoretic notion.) A set of edges that is simultaneously a cycle and a cocycle is called a bicycle, and the bicycle space is the vector space . (A coding theorist would call this the hull of the linear code .)
If is the Tutte polynomial of the graph, then it is well known that
where is the dimension of the bicycle space.
Among many other things, Las Vergnas was interested in a variety of evaluations of the Tutte polynomial along the diagonal where , and so he considered the polynomial and (for reasons unknown to me) its derivates , , , etc. all evaluated at the point . While he could not find an interpretation for , , he noticed that the sequence of values generated appeared to be divisible by unexpectedly high powers of , with each differentiation reducing the exponent of by at most one. So he made the following conjecture:
If is a graph with bicycle dimension , and is its diagonal Tutte polynomial, then for all .
For example, for the graph , we have
and so , , , , which are indeed divisible by , , and respectively.
However a quick computer search revealed that as it stands, the conjecture is false — the graph is a counterexample. But I was slightly intrigued by now, so I searched a bit harder and noticed that no matter how hard I tried, I could not find any planar graphs that did not have the property of the conjecture. So I emailed Michel and we revised the conjecture to
If is a planar graph with bicycle dimension , and is its diagonal Tutte polynomial, then for all .
And that’s basically where it stands. Although it is not a particularly important statement in itself, if it is true, then surely there must be some more combinatorial information to be wrung from the Tutte polynomial if only we knew how to look at it in the right way!
In fact, I think that planar graphs is not the precisely correct class to be working with, but rather some class that includes planar graphs; something perhaps like graphs.
One of the central and important concepts in projective geometry is the beautiful connection between 3-dimensional projective space and the Klein quadric. As is indicated by the title, this correspondence between these two geometries was named after the German mathematician Felix Klein, who studied it in his dissertation Über die Transformation der allgemeinen Gleichung des zweiten Grades zwischen Linien-Koordinaten auf eine kanonische Form (1868). The Klein Correspondence can be used to give geometric understanding for certain isomorphisms of low rank classical groups, and we will give an example of some of these in a follow-up post. In geometry, the Klein Correspondence can sometimes illuminate an obscure object in projective 3-space, for the Klein quadric is naturally embedded in a 5-dimensional projective space where there is an added richness to the geometry, and one has available other ways to distinguish certain configurations. For example, if you were to learn about linear complexes in 3-dimensional projective space, you might find one class known as the “parabolic congruences” as a somewhat messy object of pencils of lines centered on the points of a common line. However, under the Klein Correspondence, a parabolic congruence becomes a quadratic cone: one of the first 3-dimensional geometric objects we first encountered in school mathematics. Notice that I have not specified the field we are working over; it won’t matter!
The day started badly. I woke at 3am to a sick and miserable one-year-old, I got stuck in a traffic jam on the way to work, and by lunchtime I was feeling down about the usual whackacademic innuendo. But at 3pm, Eric Swartz knocked on my door. Eric has stunningly proved an outstanding conjecture on generalised quadrangles which I’ll report on when I have his blessing.
Rather than let this blog die off due to lack of posts, I thought I’d write about a small but annoying problem that I’ve been thinking about recently, but without success, and a natural conjecture that has arisen from it.
[Note: On some browsers there appears to be a sizing problem with the images WordPress uses for LaTeX formulas, and they appear ten times the right size. If this happens, reloading the webpage seems to fix it]
The problem arose in the context of binary matroids, but because a binary matroid is really just a set of points in a binary vector space, it can be phrased entirely as a linear algebra problem.
So let be a set of non-zero vectors in the vector space such that spans and, for reasons to be clarified later, no vector in is independent of the others. In matroid terminology, this just says that is a simple binary matroid of rank with no coloops.
Then define a basis of to be a linearly independent subset of of rank (in other words, just a basis of and a circuit of to be a minimally dependent set of vectors, i.e. a set of vectors that is linearly dependent but any proper subset of which is linearly independent.
As an example, take (a.k.a the Fano plane) — this means to take all the non-zero vectors in . This has 28 bases (7 choices for a first vector , 6 for a second vector and then 4 for the third vector which cannot be , or , then all divided by 6 because this counts each basis times). It has 7 circuits of size 3 (each being of the form , , ) and 7 circuits of size 4, being the complements of the circuits of size 3, for a total of 14 circuits.
Letting , denote the numbers of bases and circuits of respectively, the question is about the ratio of these two numbers. More precisely,
Determine a lower bound, in terms of the rank , for the ratio ?