Marston Conder

Marston Conder: The Man Who Counted the Symmetries

A working mathematician anywhere in the world who needs to know every trivalent symmetric graph on up to ten thousand vertices does not derive it. They download Marston Conder's list. The same is true for regular and chiral maps on surfaces across a wide range of genus, for automorphism groups of compact Riemann surfaces, and for regular and chiral polytopes. Over four decades in Auckland, Conder turned the abstract question "what are the most symmetric objects of this kind?" into something one can look up — and in doing so quietly became one of the most heavily used mathematicians of his generation.

Matamata to Oxford

He was born in September 1955 in Hamilton, New Zealand, and educated at Matamata College — a small-town start about as far from the centres of pure mathematics as it is possible to be. His first higher degree was not in mathematics at all: he took a master's in social science at Waikato University in 1977. Three years later he had a doctorate from Oxford.

The Oxford supervisor was Graham Higman, one of the towering figures of twentieth-century group theory and a founder of the modern combinatorial approach to the subject. Conder's 1980 thesis, "Minimal generating pairs for permutation groups," announced his lifelong preoccupation in its title. The question is deceptively simple: given a group, can you produce all of it from just two elements, and if so which two, chosen as economically as possible? Two-element generation is the hinge on which an enormous amount of symmetry theory turns, because the most symmetric objects in geometry and combinatorics are precisely those whose symmetry groups are generated by a very small number of very simple motions.

Objects of Maximum Symmetry

Conder's programme, sustained for forty years, can be stated in one line: study the discrete structures that have the maximum possible symmetry subject to given constraints. Fix a constraint — a graph must be trivalent, a map must live on a surface of genus five, a polytope must have a given rank — and ask which objects satisfying it are as symmetric as they can possibly be. The answers are rarely obvious and almost never numerous, which is what makes them worth cataloguing.

The tools came from combinatorial and computational group theory, including techniques for handling finitely presented groups and their images. This is the branch of algebra in which a group is specified not by listing its elements but by a handful of generators and relations, and the central difficulty is that such a presentation can hide almost anything — including a group that is infinite, or trivial, with no easy way to tell. Conder's speciality was extracting hard, exhaustive, provably complete answers from presentations of that kind, at a scale that only became feasible when computation was married properly to theory.

Maps, Chirality and Polytopes

The richest vein was maps: embeddings of graphs into surfaces, where the interesting cases are the regular ones, whose symmetry group acts as transitively as the structure allows. Alongside them sit the chiral objects, which admit every rotational symmetry but no reflection — the mathematical analogue of a left hand, superimposable on no mirror image of itself. The Royal Society of New Zealand's 2018 Jones Medal cited exactly this: his work on "symmetry and chirality in discrete structures."

He extended the same approach outward. The Institute of Combinatorics and its Applications, awarding him its Euler Medal, listed graph symmetries and embeddings, regular and chiral maps, regular and chiral polytopes, edge-partitions of graphs, higher-dimensional expander graphs and binary Gray codes — a range that runs from classical surface topology to objects with direct application in coding and network theory. More than 170 papers came out of it, and fifteen doctoral students.

The Census-Taker

What distinguishes Conder from other strong algebraists is what he did with the results. Rather than publishing a theorem and moving on, he built and published repositories — complete censuses of classes of objects, computed once, correctly, and given away. The catalogue of trivalent symmetric graphs runs to 10,000 vertices. The map and polytope censuses cover ranges nobody had previously reached. These are consulted internationally, including by researchers with no interest in group theory who simply need to know whether an object with certain properties exists, or to test a conjecture against every known case before wasting a year on it.

That habit — of treating knowledge as infrastructure rather than personal property — is explicitly part of his citation record; the ICA singled out his reputation for freely sharing knowledge and for research repositories that anyone can use.

The Public Mathematician

Conder became a full professor at Auckland in 1993 and a Distinguished Professor in 2012. He served as president of the New Zealand Mathematical Society from 1993 to 1995, as co-director of the New Zealand Institute of Mathematics and its Applications, and as president of the Academy of the Royal Society of New Zealand from 2006 to 2008 — the country's senior scientific office, held by a pure mathematician, which is not the usual arrangement anywhere.

The honours followed the work: the James Cook Research Fellowship in 2011, Fellowship of the American Mathematical Society in 2012, the Hector Medal in 2014, the Jones Medal in 2018, and in 2020 both the Euler Medal of the Institute of Combinatorics and its Applications — for distinguished lifetime contributions to combinatorial research — and appointment as an Officer of the New Zealand Order of Merit.

Why Marston Is Called a Genius

The specific quality is a rare hybrid: algebraic depth married to computational discipline. Plenty of mathematicians can prove a theorem about symmetric structures; plenty of others can write code that enumerates examples. Conder's characteristic achievement is the exhaustive classification — a proof that a computed list is not merely long but complete, that nothing has been missed. That demands theory to bound the search space, computation to sweep it, and a tolerance for error-checking that most theoreticians find beneath them and most programmers find beyond them. His censuses have stood; that is the whole test.

The Euler Medal citation names forty years of distinguished contribution across graph symmetries, chiral maps and polytopes, expanders and Gray codes, and the Jones Medal names symmetry and chirality specifically. These are professional bodies using their most senior instruments, which is as close as combinatorics comes to using the word.

The counter-case is worth stating plainly. Conder solved no famous open problem and introduced no theory that bears his name. There is no Conder conjecture, no Conder invariant. His genius is of the cartographic sort — the exhaustive, reliable mapping of territory whose boundaries others had drawn — rather than the sort that opens new country. A hard-nosed assessor would say he is the finest census-taker mathematics has produced in his area, and that being indispensable is not the same as being revolutionary. The reply is that in a discipline drowning in unverified claims, complete and correct answers are rarer than clever ones, and last longer.

Legacy

Conder's most durable legacy is peculiar for a pure mathematician: it is a set of tables. His repositories will be consulted by people who never read his proofs and may not know his name, in the way that engineers consult tables of physical constants. Behind them is the harder legacy — a demonstration that a small country with almost no critical mass in his field could produce world-leading work, and that a mathematician could run a national academy without ceasing to be a working researcher. Fifteen doctoral students and 170 papers later, New Zealand's combinatorics is a recognised international node rather than an outpost, and much of that traces to one man in Auckland who kept counting.

Achievements

• Hector Medal — 2014
• Officer of the New Zealand Order of Merit — 2020
• Fellow of the Royal Society Te Apārangi — 1998
• Euler Medal — 2020
• Held posts at University of Auckland and University of Auckland
• Fields: graph theory and group theory