Archive for the ‘Combinatorics’ Category

The Unity of Combinatorics

April 10, 2021 Leave a comment

I just finished my very first book review for the Notices of the AMS. The authors are Ezra Brown and Richard Guy, and the book title is the same as the blog post. I had mixed feelings when I accepted the assignment to write this. I knew this would take a lot of work (I was wrong — it took a huge amount of work). But the reason I accepted is because I strongly suspected that there is no “unity of combinatorics”, so I wanted to be proved wrong. Here is how the book begins:

One reason why Combinatorics has been slow to become accepted as part of mainstream Mathematics is the common belief that it consists of a bag of isolated tricks, a number of areas: [very long list – IP] with little or no connection between them. We shall see that they have numerous threads weaving them together into a beautifully patterned tapestry.

Having read the book, I continue to maintain that there is no unity. The book review became a balancing act — how do you write a somewhat positive review if you don’t believe into the mission of the book? Here is the first paragraph of the portion of the review where I touch upon themes very familiar to readers of this blog:

As I see it, the whole idea of combinatorics as a “slow to become accepted” field feels like a throwback to the long forgotten era. This attitude was unfair but reasonably common back in 1970, outright insulting and relatively uncommon in 1995, and was utterly preposterous in 2020.

After a lengthy explanation I conclude:

To finish this line of thought, it gives me no pleasure to conclude that the case for the unity of combinatorics is too weak to be taken seriously. Perhaps, the unity of mathematics as a whole is an easier claim to establish, as evident from [Stanley’s] quotes. On the other hand, this lack of unity is not necessarily a bad thing, as we would be amiss without the rich diversity of cultures, languages, open problems, tools and applications of different areas.

Enjoy the full review! And please comment on the post with your own views on this alleged “unity”.

P.S. A large part of the book is freely downloadable. I made this website for the curious reader.

Remark (ADDED April 17, 2021)
Ezra “Bud” Brown gave a talk on the book illustrating many of the connections I discuss in the review. This was at a memorial conference celebrating Richard Guy’s legacy. I was not aware of the video until now. Watch the whole talk.

2021 Abel Prize

March 17, 2021 2 comments

I am overjoyed with the news of the Abel prize awarded to László Lovász and Avi Wigderson. You can now see three (!) Abel laureates discussing Combinatorics — follow the links in this blog post from 2019. See also Gil Kalai’s blog post for further links to lectures.

My interview

March 9, 2021 1 comment

Readers of this blog will remember my strong advocacy for taking interviews. In a surprising turn of events, Toufik Mansour interviewed me for the journal Enumerative Combinatorics and Applications (ECA). Here is that interview. Not sure if I am the right person to be interviewed, but if you want to see other Toufik’s interviews — click here (I mentioned some of them earlier). I am looking forward to read interviews of many more people in ECA and other journals.

P.S. The interview asks also about this blog, so it seems fitting to mention it here.

Corrections: (March 11, 2021) 1. I misread “What three results do you consider the most influential in combinatorics during the last thirty years?” question as asking about my own three results that are specifically in combinatorics. Ugh, to the original question – none of my results would go on that list. 2. In the pattern avoidance question, I misstated the last condition: I am asking for ec(Π) to be non-algebraic. Sorry everyone for all the confusion!

What if they are all wrong?

December 10, 2020 4 comments

Conjectures are a staple of mathematics. They are everywhere, permeating every area, subarea and subsubarea. They are diverse enough to avoid a single general adjective. They come in al shapes and sizes. Some of them are famous, classical, general, important, inspirational, far-reaching, audacious, exiting or popular, while others are speculative, narrow, technical, imprecise, far-fetched, misleading or recreational. That’s a lot of beliefs about unproven claims, yet we persist in dispensing them, inadvertently revealing our experience, intuition and biases.

The conjectures also vary in attitude. Like a finish line ribbon they all appear equally vulnerable to an outsider, but in fact differ widely from race to race. Some are eminently reachable, the only question being who will get there first (think 100 meter dash). Others are barely on the horizon, requiring both great effort, variety of tools, and an extended time commitment (think ironman triathlon). The most celebrated third type are like those Sci-Fi space expeditions in requiring hundreds of years multigenerational commitments, often losing contact with civilization it left behind. And we can’t forget the romantic fourth type — like the North Star, no one actually wants to reach them, as they are largely used for navigation, to find a direction in unchartered waters.

Now, conjectures famously provide a foundation of the scientific method, but that’s not at all how we actually think of them in mathematics. I argued back in this pointed blog post that citations are the most crucial for the day to day math development, so one should take utmost care in making references. While this claim is largely uncontroversial and serves as a raison d’être for most GoogleScholar profiles, conjectures provide a convenient idealistic way out. Thus, it’s much more noble and virtuous to say “I dedicated my life to the study of the XYZ Conjecture” (even if they never publish anything), than “I am working hard writing so many papers to gain respect of my peers, get a promotion, and provide for my family“. Right. Obviously…

But given this apparent (true or perceived) importance of conjectures, are you sure you are using them right? What if some/many of these conjectures are actually wrong, what then? Should you be flying that starship if there is no there there? An idealist would argue something like “it’s a journey, not a destination“, but I strongly disagree. Getting closer to the truth is actually kind of important, both as a public policy and on an individual level. It is thus pretty important to get it right where we are going.

What are conjectures in mathematics?

That’s a stupid question, right? Conjectures are mathematical claims whose validity we are trying to ascertain. Is that all? Well, yes, if you don’t care if anyone will actually work on the conjecture. In other words, something about the conjecture needs to interesting and inspiring.

What makes a conjecture interesting?

This is a hard question to answer because it is as much psychological as it is mathematical. A typical answer would be “oh, because it’s old/famous/beautiful/etc.” Uhm, ok, but let’s try to be a little more formal.

One typically argues “oh, that’s because this conjecture would imply [a list of interesting claims and known results]”. Well, ok, but this is self-referential. We already know all those “known results”, so no need to prove them again. And these “claims” are simply other conjectures, so this is really an argument of the type “this conjecture would imply that conjecture”, so not universally convincing. One can argue: “look, this conjecture has so many interesting consequences”. But this is both subjective and unintuitive. Shouldn’t having so many interesting conjectural consequences suggest that perhaps the conjecture is too strong and likely false? And if the conjecture is likely to be false, shouldn’t this make it uninteresting?

Also, wouldn’t it be interesting if you disprove a conjecture everyone believes to be true? In some sense, wouldn’t it be even more interesting if until now everyone one was simply wrong?

None of this are new ideas, of course. For example, faced with the need to justify the “great” BC conjecture, or rather 123 pages of survey on the subject (which is quite interesting and doesn’t really need to be justified), the authors suddenly turned reflective. Mindful of self-referential approach which they quickly discard, they chose a different tactic:

We believe that the interest of a conjecture lies in the feeling of unity of mathematics that it entails. [M.P. Gomez Aparicio, P. Julg and A. Valette, “The Baum-Connes conjecture“, 2019]

Huh? Shouldn’t math be about absolute truths, not feelings? Also, in my previous blog post, I mentioned Noga Alon‘s quote that Mathematics is already “one unit“. If it is, why does it need a new “feeling of unity“? Or is that like one of those new age ideas which stop being true if you don’t reinforce them at every occasion?

If you are confused at this point, welcome to the club! There is no objective way to argue what makes certain conjectures interesting. It’s all in our imagination. Nikolay Konstantinov once told me that “mathematics is a boring subject because every statement is equivalent to saying that some set is empty.” He meant to be provocative rather than uninspiring. But the problem he is underlying is quite serious.

What makes us believe a conjecture is true?

We already established that in order to argue that a conjecture is interesting we need to argue it’s also true, or at least we want to believe it to be true to have all those consequences. Note, however, that we argue that a conjecture is true in exactly the same way we argue it’s interesting: by showing that it holds is some special cases, and that it would imply other conjectures which are believed to be true because they are also checked in various special cases. So in essence, this gives “true = interesting” in most cases. Right?

This is where it gets complicated. Say, you are working on the “abc conjecture” which may or may not be open. You claim that it has many consequences, which makes it both likely true and interesting. One of them is the negative solution to the Erdős–Ulam problem about existence of a dense set in the plane with rational pairwise distances. But a positive solution to the E-U problem implies the Harborth’s conjecture (aka the “integral Fáry problem“) that every graph can be drawn in the plane with rational edge lengths. So, counterintuitively, if you follow the logic above shouldn’t you be working on a positive solution to Erdős–Ulam since it would both imply one conjecture and give a counterexample to another? For the record, I wouldn’t do that, just making a polemical point.

I am really hoping you see where I am going. Since there is no objective way to tell if a conjecture is true or not, and what exactly is so interesting about it, shouldn’t we discard our biases and also work towards disproving the conjecture just as hard as trying to prove it?

What do people say?

It’s worth starting with a general (if slightly poetic) modern description:

In mathematics, [..] great conjectures [are] sharply formulated statements that are most likely true but for which no conclusive proof has yet been found. These conjectures have deep roots and wide ramifications. The search for their solution guides a large part of mathematics. Eternal fame awaits those who conquer them first. Remarkably, mathematics has elevated the formulation of a conjecture into high art. [..] A well-chosen but unproven statement can make its author world-famous, sometimes even more so than the person providing the ultimate proof. [Robbert Dijkgraaf, The Subtle Art of the Mathematical Conjecture, 2019]

Karl Popper thought that conjectures are foundational to science, even if somewhat idealized the efforts to disprove them:

[Great scientists] are men of bold ideas, but highly critical of their own ideas: they try to find whether their ideas are right by trying first to find whether they are not perhaps wrong. They work with bold conjectures and severe attempts at refuting their own conjectures. [Karl Popper, Heroic Science, 1974]

Here is how he reconciled somewhat the apparent contradiction:

On the pre-scientific level we hate the very idea that we may be mistaken. So we cling dogmatically to our conjectures, as long as possible. On the scientific level, we systematically search for our mistakes. [Karl Popper, quoted by Bryan Magee, 1971]

Paul Erdős was, of course, a champion of conjectures and open problems. He joked that the purpose of life is “proof and conjecture” and this theme is repeatedly echoed when people write about him. It is hard to overestimate his output, which included hundreds of talks titled “My favorite problems“. He wrote over 180 papers with collections of conjectures and open problems (nicely assembled by Zbl. Math.)

Peter Sarnak has a somewhat opposite point of view, as he believes one should be extremely cautious about stating a conjecture so people don’t waste time working on it. He said once, only half-jokingly:

Since we reward people for making a right conjecture, maybe we should punish those who make a wrong conjecture. Say, cut off their fingers. [Peter Sarnak, UCLA, c. 2012]

This is not an exact quote — I am paraphrasing from memory. Needless to say, I disagree. I don’t know how many fingers he wished Erdős should lose, since some of his conjectures were definitely disproved: one, two, three, four, five, and six. This is not me gloating, the opposite in fact. When you are stating hundreds of conjectures in the span of almost 50 years, having only a handful to be disproved is an amazing batting average. It would, however, make me happy if Sarnak’s conjecture is disproved someday.

Finally, there is a bit of a controversy whether conjectures are worth as much as theorems. This is aptly summarized in this quote about yet another champion of conjectures:

Louis J. Mordell [in his book review] questioned Hardy‘s assessment that Ramanujan was a man whose native talent was equal to that of Euler or Jacobi. Mordell [..] claims that one should judge a mathematician by what he has actually done, by which Mordell seems to mean, the theorems he has proved. Mordell’s assessment seems quite wrong to me. I think that a felicitous but unproved conjecture may be of much more consequence for mathematics than the proof of many a respectable theorem. [Atle Selberg, “Reflections Around the Ramanujan Centenary“, 1988]

So, what’s the problem?

Well, the way I see it, the efforts made towards proving vs. disproving conjectures is greatly out of balance. Despite all the high-minded Popper’s claims about “severe attempts at refuting their own conjectures“, I don’t think there is much truth to that in modern math sciences. This does not mean that disproofs of famous conjectures aren’t celebrated. Sometimes they are, see below. But it’s clear to me that the proofs are celebrated more frequently, and to a much greater degree. I have only anecdotal evidence to support my claim, but bear with me.

Take prizes. Famously, Clay Math Institute gives $1 million for a solution of any of these major open problems. But look closely at the rules. According to the item 5b, except for the P vs. NP problem and the Navier–Stokes Equation problem, it gives nothing ($0) for a disproof of these problems. Why, oh why?? Let’s look into CMI’s “primary objectives and purposes“:

To recognize extraordinary achievements and advances in mathematical research.

So it sounds like CMI does not think that disproving the Riemann Hypothesis needs to be rewarded because this wouldn’t “advance mathematical research”. Surely, you are joking? Whatever happened to “the opposite of a profound truth may well be another profound truth“? Why does the CMI wants to put its thumb on the scale and support only one side? Do they not want to find out the solution whatever it is? Shouldn’t they be eager to dispense with the “wrong conjecture” so as to save numerous researches from “advances to nowhere“?

I am sure you can see that my blood is boiling, but let’s proceed to the P vs. NP problem. What if it’s independent of ZFC? Clearly, CMI wouldn’t pay for proving that. Why not? It’s not like this kind of thing never happened before (see obligatory link to CH). Some people believe that (or at least they did in 2012), and some people like Scott Aaronson take this seriously enough. Wouldn’t this be a great result worthy of an award as much as the proof that P=NP, or at least a nonconstructive proof that P=NP?

If your head is not spinning hard enough, here is another amusing quote:

Of course, it’s possible that P vs. NP is unprovable, but that that fact itself will forever elude proof: indeed, maybe the question of the independence of P vs. NP is itself independent of set theory, and so on ad infinitum! But one can at least say that, if P vs. NP (or for that matter, the Riemann hypothesis, Goldbach’s conjecture, etc.) were proven independent of ZF, it would be an unprecedented development. [Scott Aaronson, P vs. NP, 2016].

Speaking of Goldbach’s Conjecture, the most talked about and the most intuitively correct statement in Number Theory that I know. In a publicity stunt, for two years there was a $1 million prize by a publishing house for the proof of the conjecture. Why just for the proof? I never heard of anyone not believing the conjecture. If I was the insurance underwriter for the prize (I bet they had one), I would allow them to use “for the proof or disproof” for a mere extra $100 in premium. For another $50 I would let them use “or independent of ZF” — it’s a free money, so why not? It’s such a pernicious idea of rewarding only one kind of research outcome!

Curiously, even for Goldbach’s Conjecture, there is a mild divergence of POVs on what the future holds. For example, Popper writes (twice in the same book!) that:

[On whether Goldbach’s Conjecture is ‘demonstrable’] We don’t know: perhaps we may never know, and perhaps we can never know. [Karl Popper, Conjectures and Refutations, 1963]

Ugh. Perhaps. I suppose anything can happen… For example, our civilizations can “perhaps” die out in the next 200 years. But is that likely? Shouldn’t the gloomy past be a warning, not a prediction of the future? The only thing more outrageously pessimistic is this theological gem of a quote:

Not even God knows the number of permutations of 1000 avoiding the 1324 pattern. [Doron Zeilberger, quoted here, 2005]

Thanks, Doron! What a way to encourage everyone! Since we know from numerical estimates that this number is ≈ 3.7 × 101017 (see this paper and this follow up), Zeilberger is suggesting that large pattern avoidance numbers are impossibly hard to compute precisely, already in the range of only about 1018 digits. I really hope he is proved wrong in his lifetime.

But I digress. What I mean to emphasize, is that there are many ways a problem can be resolved. Yet some outcomes are considered more valuable than others. Shouldn’t the research achievements be rewarded, not the desired outcome? Here is yet another colorful opinion on this:

Given a conjecture, the best thing is to prove it. The second best thing is to disprove it. The third best thing is to prove that it is not possible to disprove it, since it will tell you not to waste your time trying to disprove it. That’s what Gödel did for the Continuum Hypothesis. [Saharon Shelah, Rutgers Univ. Colloqium, 2001]

Why do I care?

For one thing, disproving conjectures is part of what I do. Sometimes people are a little shy to unambiguously state them as formal conjectures, so they phrase them as questions or open problems, but then clarify that they believe the answer is positive. This is a distinction without a difference, or at least I don’t see any (maybe they are afraid of Sarnak’s wrath?) Regardless, proving their beliefs wrong is still what I do.

For example, here is my old bog post on my disproof of the Noonan-Zeiberger Conjecture (joint with Scott Garrabrant). And in this recent paper (joint with Danny Nguyen), we disprove in one big swoosh both Barvinok’s Problem, Kannan’s Problem, and Woods Conjecture. Just this year I disproved three conjectures:

  1. The Kirillov–Klyachko Conjecture (2004) that the reduced Kronecker coefficients satisfy the saturation property (this paper, joint with Greta Panova).
  2. The Brandolini et al. Conjecture (2019) that concrete lattice polytopes can multitile the space (this paper, joint with Alexey Garber).
  3. Kenyon’s Problem (c. 2005) that every integral curve in R3 is a boundary of a PL surface comprised of unit triangles (this paper, joint with Alexey Glazyrin).

On top of that, just two months ago in this paper (joint with Han Lyu), we showed that the remarkable independence heuristic by I. J. Good for the number of contingency tables, fails badly even for nearly all uniform marginals. This is not exactly disproof of a conjecture, but it’s close, since the heuristic was introduced back in 1950 and continues to work well in practice.

In addition, I am currently working on disproving two more old conjectures which will remain unnamed until the time we actually resolve them (which might never happen, of course). In summary, I am deeply vested in disproving conjectures. The reasons why are somewhat complicated (see some of them below). But whatever my reasons, I demand and naively fully expect that my disproofs be treated on par with proofs, regardless whether this expectation bears any relation to reality.

My favorite disproofs and counterexamples:

There are many. Here are just a few, some famous and some not-so-famous, in historical order:

  1. Fermat‘s conjecture (letter to Pascal, 1640) on primality of Fermat numbers, disproved by Euler (1747)
  2. Tait’s conjecture (1884) on hamiltonicity of graphs of simple 3-polytopes, disproved by W.T. Tutte (1946)
  3. General Burnside Problem (1902) on finiteness of periodic groups, resolved negatively by E.S. Golod (1964)
  4. Keller’s conjecture (1930) on tilings with unit hypercubes, disproved by Jeff Lagarias and Peter Shor (1992)
  5. Borsuk’s Conjecture (1932) on partitions of convex sets into parts of smaller diameter, disproved by Jeff Kahn and Gil Kalai (1993)
  6. Hirsch Conjecture (1957) on the diameter of graphs of convex polytopes, disproved by Paco Santos (2010)
  7. Woods’s conjecture (1972) on the covering radius of certain lattices, disproved by Oded Regev, Uri Shapira and Barak Weiss (2017)
  8. Connes embedding problem (1976), resolved negatively by Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright and Henry Yuen (2020)

In all these cases, the disproofs and counterexamples didn’t stop the research. On the contrary, they gave a push to further (sometimes numerous) developments in the area.

Why should you disprove conjectures?

There are three reasons, of different nature and importance.

First, disproving conjectures is opportunistic. As mentioned above, people seem to try proving much harder than they try disproving. This creates niches of opportunity for an open-minded mathematician.

Second, disproving conjectures is beautiful. Let me explain. Conjectures tend to be rigid, as in “objects of the type pqr satisfy property abc.” People like me believe in the idea of “universality“. Some might call it “completeness” or even “Murphy’s law“, but the general principle is always the same. Namely: it is not sufficient that one wishes that all pqr satisfy abc to actually believe in the implication; rather, there has to be a strong reason why abc should hold. Barring that, pqr can possibly be almost anything, so in particular non-abc. While some would argue that non-abc objects are “ugly” or at least “not as nice” as abc, the idea of universality means that your objects can be of every color of the rainbow — nice color, ugly color, startling color, quiet color, etc. That kind of palette has its own sense of beauty, but it’s an acquired taste I suppose.

Third, disproving conjectures is constructive. It depends on the nature of the conjecture, of course, but one is often faced with necessity to construct a counterexample. Think of this as an engineering problem of building some pqr which at the same time is not abc. Such construction, if at all possible, might be difficult, time consuming and computer assisted. But so what? What would you rather do: build a mile-high skyscraper (none exist yet) or prove that this is impossible? Curiously, in CS Theory both algorithms and (many) complexity results are constructive (you need gadgets). Even the GCT is partially constructive, although explaining that would take us awhile.

What should the institutions do?

If you are an institution which awards prizes, stop with the legal nonsense: “We award […] only for a publication of a proof in a top journal”. You need to set up a scientific committee anyway, since otherwise it’s hard to tell sometimes if someone deserves a prize. With mathematicians you can expect anything anyway. Some would post two arXiv preprints, give a few lectures and then stop answering emails. Others would publish only in a journal where they are Editor-in-Chief. It’s stranger than fiction, really.

What you should do is say in the official rules: “We have [this much money] and an independent scientific committee which will award any progress on [this problem] partially or in full as they see fit.” Then a disproof or an independence result will receive just as much as the proof (what’s done is done, what else are you going to do with the money?) This would also allow some flexibility for partial solutions. Say, somebody proves Goldbach’s Conjecture for integers > exp(exp(10100000)), way way beyond computational powers for the remaining integers to be checked. I would give this person at least 50% of the prize money, leaving the rest for future developments of possibly many people improving on the bound. However, under the old prize rules such person gets bupkes for their breakthrough.

What should the journals do?

In short, become more open to results of computational and experimental nature. If this sounds familiar, that’s because it’s a summary of Zeilberger’s Opinions, viewed charitably. He is correct on this. This includes publishing results of the type “Based on computational evidence we believe in the following UVW conjecture” or “We develop a new algorithm which confirms the UVW conjecture for n<13″. These are still contributions to mathematics, and the journals should learn to recognize them as such.

To put in context of our theme, it is clear that a lot more effort has been placed on proofs than on finding counterexamples. However, in many areas of mathematics there are no small counterexamples, so a heavy computational effort is crucial for any hope of finding one. Such work is not be as glamorous as traditional papers. But really, when it comes to standards, if a journal is willing to publish the study of something like the “null graphs“, the ship has sailed for you…

Let me give you a concrete example where a computational effort is indispensable. The curious Lovász conjecture states that every finite connected vertex-transitive graph contains a Hamiltonian path. This conjecture got to be false. It hits every red flag — there is really no reason why pqr = “vertex transitive” should imply abc = “Hamiltonian”. The best lower bound for the length of the longest (self-avoiding) path is only about square root of the number of vertices. In fact, even the original wording by Lovász shows he didn’t believe the conjecture is true (also, I asked him and he confirmed).

Unfortunately, proving that some potential counterexample is not Hamiltonian is computationally difficult. I once had an idea of one (a nice cubic Cayley graph on “only” 3600 vertices), but Bill Cook quickly found a Hamiltonian cycle dashing my hopes (it was kind of him to look into this problem). Maybe someday, when the TSP solvers are fast enough on much larger graphs, it will be time to return to this problem and thoroughly test it on large Cayley graphs. But say, despite long odds, I succeed and find a counterexample. Would a top journal publish such a paper?

Editor’s dilemma

There are three real criteria for evaluation a solution of an open problem by the journal:

  1. Is this an old, famous, or well-studied problem?
  2. Are the tools interesting or innovative enough to be helpful in future studies?
  3. Are the implications of the solution to other problems important enough?

Now let’s make a hypothetical experiment. Let’s say a paper is submitted to a top math journal which solves a famous open problem in Combinatorics. Further, let’s say somebody already proved it is equivalent to a major problem in TCS. This checks criteria 1 and 3. Until not long ago it would be rejected regardless, so let’s assume this is happening relatively recently.

Now imagine two parallel worlds, where in the first world the conjecture is proved on 2 pages using beautiful but elementary linear algebra, and in the second world the conjecture is disproved on a 2 page long summary of a detailed computational search. So in neither world we have much to satisfy criterion 2. Now, a quiz: in which world the paper will be published?

If you recognized that the first world is a story of Hao Huang‘s elegant proof of the induced subgraphs of hypercubes conjecture, which implies the sensitivity conjecture. The Annals published it, I am happy to learn, in a welcome break with the past. But unless we are talking about some 200 year old famous conjecture, I can’t imagine the Annals accepting a short computational paper in the second world. Indeed, it took a bit of a scandal to accept even the 400 year old Kepler’s conjecture which was proved in a remarkable computational work.

Now think about this. Is any of that fair? Shouldn’t we do better as a community on this issue?

What do other people do?

Over the years I asked a number of people about the uncertainty created by the conjectures and what do they do about it. The answers surprised me. Here I am paraphrasing them:

Some were dumbfounded: “What do you mean this conjecture could be false? It has to be true, otherwise nothing I am doing make much sense.”

Others were simplistic: “It’s an important conjecture. Famous people said it’s true. It’s my job to prove it.”

Third were defensive: “Do you really think this conjecture could be wrong? Why don’t you try to disprove it then? We’ll see who is right.”

Fourth were biblical: “I tend to work 6 days a week towards the proof and one day towards the disproof.”

Fifth were practical: “I work on the proof until I hit a wall. I use the idea of this obstacle to try constructing potential counterexamples. When I find an approach to discard such counterexamples, I try to generalize the approach to continue working on the proof. Continue until either side wins.”

If the last two seem sensible to you to, that’s because they are. However, I bet fourth are just grandstanding — no way they actually do that. The fifth sound great when this is possible, but that’s exceedingly rare, in my opinion. We live in a technical age when proving new results often requires great deal of effort and technology. You likely have tools and intuition to work in only one direction. Why would you want to waste time working in another?

What should you do?

First, remember to make conjectures. Every time you write a paper, tell a story of what you proved. Then tell a story of what you wanted to prove but couldn’t. State it in the form of a conjecture. Don’t be afraid to be wrong, or be right but oversharing your ideas. It’s a downside, sure. But the upside is that your conjecture might prove very useful to others, especially young researchers. In might advance the area, or help you find a collaborator to resolve it.

Second, learn to check your conjectures computationally in many small cases. It’s important to give supporting evidence so that others take your conjectures seriously.

Third, learn to make experiments, explore the area computationally. That’s how you make new conjectures.

Fourth, understand yourself. Your skill, your tools. Your abilities like problem solving, absorbing information from the literature, or making bridges to other fields. Faced with a conjecture, use this knowledge to understand whether at least in principle you might be able to prove or disprove a conjecture.

Fifth, actively look for collaborators. Those who have skills, tools, or abilities you are missing. More importantly, they might have a different POV on the validity of the conjecture and how one might want to attack it. Argue with them and learn from them.

Sixth, be brave and optimistic! Whether you decide to prove, disprove a conjecture, or simply state a new conjecture, go for it! Ignore the judgements by the likes of Sarnak and Zeilberger. Trust me — they don’t really mean it.

Take an interview!

October 29, 2020 2 comments

We all agree that Math is a human endeavor, yet we know so preciously little about mathematicians as humans working in mathematics. Our papers tend to have preciously few quotable sentences outside of the dry mathematical context. In fact, most introductions are filled with passages of the form “X introduced the celebrated tool pqr, which over the next 20 years was refined by A, B and C, and most recently was used by D to prove Z’s conjecture“. It is such a weak tea to convey contributions of six people in one short sentence, yet we all do this nonetheless.

In my “How to write a clear math paper” article accompanying this blog post, I argue that at least the first paragraph or the first subsection of a long paper can be human and aimed at humans. That is the place where one has freedom to be eloquent, inspiring, congratulatory, prescient, revelatory and quotable. I still believe that, but now I have a new suggestion, see the title of this blog post.

The art of autobiographies

These days many great scientists remain active into very old age, and rarely want or have time to write an autobiography. Good for them, bad for us. Psychologically this is understandable — it feels a little epitaphish, so they would much rather have someone else do that. But then their real voice and honest thoughts on life and math are lost, and can never be recorded. There is blogging, of course, but that’s clearly not for everyone.

There are some notable exceptions to this, of course. When I was in High School, reading autobiographies of Richard Feynman, Stan Ulam and Norbert Wiener was a pure joy, a window into a new world. The autobiоgraphy by Sofya Kovalevskaya was short on mathematical stories, but was so well written I think I finished the whole thing in one sitting. G.H. Hardy’s “Apology” is written in different style, but clearly self-revealing; while I personally disagree with much of his general point, I can see why the book continues to be read and inspire passionate debates.

More recently, I read William Tutte, “Graph Theory As I Have Known It“, which is mostly mathematical, but with a lot of personal stories delivered in an authoritative voice. It’s a remarkable book, I can’t praise it enough. Another one of my favorites is Steven Krantz, “Mathematical Apocrypha” and its followup, which are written in the first person, in a pleasant light rumor mill style. Many stories in these near-autobiographies were a common knowledge decades ago (even if some were urban legends), but are often the only way for us to learn now how it was back then.

On the opposite end of the spectrum there is L.S. Pontryagin’s autobiography (in Russian), which is full of wild rumors, vile accusations, and banal antisemitism. The book is a giant self-own, yet I couldn’t stop myself from hate-reading the whole thing just so I could hear all these interesting old stories from horse’s mouth.

Lately, the autobiographies I’ve been reading are getting less and less personal, with little more than background blurbs about each paper. Here are those by George Lusztig and Richard Stanley. It’s an unusual genre, and I applaud the authors for taking time to write these. But these condensed CV-like auto-bios clearly leave a lot of room for stories and details.

Why an interview?

Because a skillful interviewer can help a mathematician reveal personal stories, mathematical and metamathematical beliefs, and even general views (including controversial ones). Basically, reveal the humanity of a person that otherwise remains guarded behind endless Definition-Lemma-Theorem constructions.

Another reason to interview a person is to honor her or his contributions to mathematics. In the aftermath of my previous blog post, I got a lot of contradictory push-back. Some would say “I am shocked, shocked, to find that there is corruption going on. I have submitted to many invited issues, served as a guest editor for others and saw none of that! So you must be wrong, wrong, wrong.” Obviously, I am combining several POVs, satirizing and paraphrasing for the effect.

Others would say “Yes, you are right, some journals are not great so my junior coauthors do suffer, the refereeing is not always rigorous, the invited authors are often not selected very broadly, but what can I do? The only way I can imagine to honor a person is by a math article in an invited issue of a peer review journal, so we must continue this practice” (same disclaimer as above). Yeah, ok the imaginary dude, that’s just self-serving with a pretense of being generous and self-sacrificing. (Yes, my straw man fighting skill are unparalleled).

In fact, there are many ways to honor a person. You can give a talk about that person’s contributions, write a survey or a biographical article, organize a celebratory conference, or if you don’t want to be bothered simply add a dedication in the beginning of the next article you publish. Or, better yet, interview the honoree. Obviously, do this some time soon, while this person is alive, and make sure to put the interview online for everyone to read or hear.

How to do an interview?

Oh, you know, via Zoom, for example. The technical aspects are really trivial these days. With permission, you can record the audio/video by pushing one button. The very same Zoom (or Apple, Google, Amazon, Microsoft, etc.) have good speech-to-text programs which will typeset the whole interview for you, modulo some light editing (especially of math terminology). Again, with a couple of clicks, you can publish the video or the audio on YouTube, the text on your own website or any social media. Done. Really, it’s that easy!


I have many favorites, in fact. One superb video collection is done by the Simons Institute. I already blogged here about terrific interviews with László Lovász and Endre Szemerédi. The interviewer for both is Avi Wigderson, who is obviously extremely knowledgeable of the subject. He asked many pointed and interesting questions, yet leaving the interviewees plenty of space to develop and expand on their their answers. The videos are then well edited and broken into short watchable pieces.

Another interesting collection of video interviews is made by CIRM (in both English and French). See also general video collections, some of which have rather extensive and professionally made interviews with a number of notable mathematicians and scientists. Let me single out the Web of Stories, which include lengthy fascinating interviews with Michael Atiyah, Freeman Dyson, Don Knuth, Marvin Minsky, and many others.

I already wrote about how to watch a math video talk (some advice may be dated). Here it’s even easier. At the time of the pandemic, when you are Zoom fatigued — put these on your big screen TV and watch them as documentaries with as much or as little attention as you like. I bet you will find them more enlightening than the news, Netflix or other alternatives.

Authorized biography books are less frequent, obviously, but they do exist. One notable recent example is “Genius At Play: The Curious Mind of John Horton Conway” by Siobhan Roberts which is based on many direct conversations. Let me also single out perhaps lesser known “Creative Minds, Charmed Lives” by Yu Kiang Leong, which has a number of interesting interviews with excellent mathematicians, many of the them not on other lists. For example, on my “What is Combinatorics” page, I quote extensively from his interview with Béla Bollobás, but in fact the whole interview is worth reading.

Finally, there is a truly remarkable collection of audio interviews by Eugene Dynkin with leading mathematicians of his era, spanning from 1970s to 2010s (some in English, some in Russian). The collection was digitized using Flash which died about five years ago, rendering the collection unusable. When preparing this post I was going to use this example as a cautionary tale, but to my surprise someone made it possible to download them in .mp3. Enjoy! Listening to these conversations is just delightful.

Final thoughts

Remember, you don’t have to be a professional interviewer to do a good job. Consider two most recent interviews with Noga Alon and Richard Stanley by Toufik Mansour, both published at ECA. By employing a simple trick of asking the same well prepared questions, he allows the reader to compare and contrast the answers, and make their own judgement on which ones they like or agree with the most. Some answers are also quite revealing, e.g. Stanley saying he occasionally thinks about the RH (who knew?), or Alon’s strong belief that “mathematics should be considered as one unit” (i.e. without the area divisions). The problems they consider to be important are also rather telling.

Let me mention that in the digital era, even the amateur long forgotten interviews can later be found and proved useful. For example, I concluded my “History of Catalan numbers” with a quote from an obscure Richard Stanley’s interview to the MIT undergraduate newspaper. There, he was discussing the origins of his Catalan numbers exercise which is now a book. Richard later wrote to me in astonishment as he actually completely forgot he gave that interview.

So, happy watching, listening, and reading all the interviews! Hope you take some interviews yourself for all of us to enjoy!

P.S. (Added Dec 3, 2020) At my urging, Bruce Rothschild has typed up a brief “History of Combinatorics at UCLA“. I only added hyperlinks to it, to clarify the personalities Bruce is talking about (thus, all link mistakes are mine).

P.P.S. (Added Feb 6, 2021) At my request, the editors of ECA clarified their interview process (as of today, they have posted nine of them). Their interviews are conducted over email and are essentially replies to the nearly identical sets of questions. The responses are edited for clarity and undergo several rounds of approval by the interviewee. This practice is short of what one would traditionally describe as a journalistic interview (e.g., there are no uncomfortable questions), and is more akin to writing a puff piece. Still, we strongly support this initiative by the ECA as the first systematic effort to put combinatorialists on record. Hopefully, with passage of time others types of interviews will also emerge from various sources.

How Combinatorics became legitimate (according to László Lovász and Endre Szemerédi)

April 26, 2019 3 comments

Simons Foundation has a series of fantastic interviews with leading mathematicians (ht Federico Ardila).  Let me single out the interviews with László Lovász and Endre SzemerédiAvi Wigderson asked both of them about the history of combinatorics and how it came into prominence.  Watch parts 8-9 in Lovász’s interview and 10-11 in Szemerédi’s interview to hear their fascinating answers.

P.S.  See also my old blog posts on what is combinatoricshow it became legitimate and how to watch math videos.

Some good news

April 17, 2019 Leave a comment

Two of my former Ph.D. students won major prizes recently — Matjaž Konvalinka and Danny Nguyen.  Matjaž is an Associate Professor at University of Ljubljana, Danny is a Lewis Research Assistant Professor at University of Michigan, Ann Arbor.  Congratulations to both of them!

(1) The 2019 Robbins Prize is awarded to Roger Behrend, Ilse Fischer and Matjaž Konvalinka for their paper “Diagonally and antidiagonally symmetric alternating sign matrices of odd order”.  The Robbins Prize is given in Combinatorics and related areas of interest is named after the late David P. Robbins and is given once every 3 years by AMS and MAA.

In many ways, this paper completes the long project of enumerating alternating sign matrices (ASMs) initiated by William Mills, David Robbins, and Howard Rumsey in the early 1980s.  The original #ASM(n)=#TSSCPP(n) conjecture follows from Andrews’s proof of the conjectured product formula for #TSSCPP(n), and Zeilberger’s 84 page computer assisted proof of the the same conjectured product formula for #ASM(n).  This led to a long series of remarkable developments which include Kuperberg’s proof using the Izergin-Korepin determinant for the six vertex model, the Cantini–Sportiello proof of the Razumov-Stroganov conjecture, and a recent self-contained determinantal proof for the number of ASMs by Fischer.  Bressoud’s book (and this talkslides) is a good introduction.  But the full story is yet to be written.

(2)  The 2018 Sacks Prize is awarded to Danny Nguyen for his UCLA Ph.D. dissertation on the complexity of short formulas in Presburger Arithmetic (PA) and many related works (some joint with me, some with others).  See also the UCLA announcement.  The Sacks Prize is given by the international Association for Symbolic Logic for “the most outstanding doctoral dissertation in mathematical logic“.  It is sometimes shared between two awardees, and sometimes not given at all.  This year Danny is the sole winner of the prize.

Danny’s dissertation is a compilation of eight (!) papers Danny wrote during his graduate studies, all on the same or closely related subject.  These papers advance and mostly finish off the long program of understanding the boundary of what’s feasible in PA. The most important of these is our joint FOCS paper which basically says that Integer Programming and Parametric Integer Programming is all that’s left in P, while all longer formulas are NP-hard.  See Featured MathSciNet Review by Sasha Barvinok and an overlapping blog post by Gil Kalai discussing these results.  See also Danny’s FOCS talk video and my MSRI talk video presenting this work.


Just combinatorics matters

March 29, 2019 3 comments

I would really like everyone to know that every time you say or write that something is “just combinatorics” somebody rolls his eyes.  Guess who?

Here is a short collection of “just combinatorics” quotes.  It’s a followup on my “What is Combinatorics?” quotes page inspired by the “What is Combinatorics?” blog post.

ICM Paper

March 14, 2018 2 comments

Well, I finally finished my ICM paper. It’s only 30 pp, but it took many sleepless nights to write and maybe about 10 years to understand what exactly do I want to say. The published version will be a bit shorter – I had to cut section 4 to satisfy their page limitations.

Basically, I give a survey of various recent and not-so-recent results in Enumerative Combinatorics around three major questions:

(1) What is a formula?
(2) What is a good bijection?
(3) What is a combinatorial interpretation?

Not that I answer these questions, but rather explain how one could answer them from computational complexity point of view. I tried to cover as much ground as I could without overwhelming the reader. Clearly, I had to make a lot of choices, and a great deal of beautiful mathematics had to be omitted, sometimes in favor of the Computational Combinatorics approach. Also, much of the survey surely reflects my own POV on the subject. I sincerely apologize to everyone I slighted and who disagrees with my opinion! Hope you still enjoy the reading.

Let me mention that I will wait for a bit before posting the paper on the arXiv. I very much welcome all comments and suggestions! Post them here or email privately.

P.S. In thinking of how approach this paper, I read a large number of papers in previous ICM proceedings, e.g. papers by Noga Alon, Mireille Bousquet-Mélou, Paul Erdős, Philippe Flajolet, Marc Noy, János Pach, Richard Stanley, Benny Sudakov, and many others. They are all terrific and worth reading even if just to see how the field has been changing over the years. I also greatly benefited from a short introductory article by Doron Zeilberger, which I strongly recommend.

Fibonacci times Euler

November 5, 2016 2 comments

Recall the Fibonacci numbers F_n given by 1,1,2,3,5,8,13,21… There is no need to define them. You all know. Now take the Euler numbers (OEIS) E_n 1,1,1,2,5,16,61,272… This is the number of alternating permutations in S_n with the exponential generating function \sum_{n=0}^\infty E_n t^n/n! = \tan(t)+\sec(t).  Both sequences are incredibly famous. Less known are connection between them.

(1) Define the Fibonacci polytope \Phi_n to be a convex hull of  0/1 points in \Bbb R^n with no two 1 in a row. Then  \Phi_n has F_{n+1} vertices and vol(\Phi_n)=E_n/n! This is a nice exercise.

(2) F_n \cdot E_n \ge n! (by just a little). For example, F_4 \cdot E_4 = 5 \cdot 5 = 25 > 4!. This follows from the fact that

F_n \sim \frac{1}{\sqrt{5}} \, \phi^{n+1} and E_n\sim \frac{4}{\pi}\left(\frac{2}{\pi}\right)^{n} n!, where \phi=(1+\sqrt{5})/2 is the golden ratio. Thus, the product F_n \cdot E_n \sim c n! \left(\frac{2\phi}{\pi}\right)^n. Since \pi = 3.14 and 2\phi = 3.24, the inequality F_n \cdot E_n \ge n! is easy to see, but still a bit surprising that the numbers are so close.

Together with Greta Panova and Alejandro Morales we wrote a little note “Why is π < 2φ?” which gives a combinatorial proof of (2) via a direct surjection. Thus we obtain an indirect proof of the inequality in the title.  The note is not a research article; rather, it is aimed at a general audience of college students.  We will not be posting it on the arXiv, so I figure this blog is a good place to advertise it.

The note also explains that the inequality (2) also follows from Sidorenko’s theorem on complementary posets. Let me briefly mention a connection between (1) and (2) which is not mentioned in the note.  I will assume you just spent 5 min and read the note at this point.  Following Stanley, the volume of \Phi_n is equal to the volume of the chain polytope (=stable set polytope), see Two Poset Polytopes.  But the latter is exactly the polytope that Bollobás, Brightwell and Sidorenko used in their proof of the upper bound via polar duality.