# The polymath blog

## February 20, 2021

### Polymath projects 2021

Filed under: polymath proposals — Gil Kalai @ 4:11 pm After the success of Polymath1 and the launching of Polymath3 and Polymath4, Tim Gowers wrote a blog post “Possible future Polymath projects” for planning the next polymath project on his blog. The post mentioned 9 possible projects. (Four of them later turned  to polymath projects.) Following the post and separate posts describing some of the proposed projects, a few polls were taken and a problem – the Erdős discrepancy problem, was selected for the next project polymath5. In Combinatorics and more I reviewed some of the proposed projects from 2009, and in the same post I briefly and sometimes vaguely discussed the 2021 list, that I plan to present and discuss in detail in the next couple of months.

## June 9, 2019

### A sort of Polymath on a famous MathOverflow problem

Filed under: polymath proposals — Gil Kalai @ 6:09 pm

Is there any polynomials ${P}$ of two variables with rational coefficients, such that the map $P: \mathbb Q \times \mathbb Q \to \mathbb Q$  is a bijection?  This is a famous 9-years old open question on MathOverflow.  Terry Tao initiated a sort of polymath attempt to solve this problem conditioned on some conjectures from arithmetic algebraic geometry.  This project is based on an plan by Tao for a solution, similar to a 2009 result by Bjorn Poonen who showed that conditioned on the Bombieri-Lang conjecture, there is a polynomial so that the map $P: \mathbb Q \to \mathbb Q \times \mathbb Q$  is injective. (Poonen’s result  answered a question by Harvey Friedman from the late 20th century, and is related also to a question by Don Zagier.)

## February 3, 2019

### Ten Years of Polymath

Filed under: discussion — Gil Kalai @ 3:14 pm
Tags: , Ten years ago on January 27, 2009, Polymath1 was proposed by Tim Gowers  and was launched on February 1, 2009. The first project was successful and it followed by 15 other formal polymath projects and a few other projects of similar nature.

## October 19, 2018

Filed under: discussion — Gil Kalai @ 9:10 am
Tags: , ,

Three short items:

### Progress on Rota’s conjecture (polymath12) by Bucić, Kwan, Pokrovskiy, and Sudakov

First, there is a remarkable development on Rota’s basis conjecture (Polymath12) described in the paper
Halfway to Rota’s basis conjecture, by Matija Bucić, Matthew Kwan, Alexey Pokrovskiy, and Benny Sudakov

Abstract: In 1989, Rota made the following conjecture. Given $n$ bases $B_{1},\dots,B_{n}$ in an $n$-dimensional vector space $V$, one can always find $n$ disjoint bases of $V$, each containing exactly one element from each $B_{i}$ (we call such bases transversal bases). Rota’s basis conjecture remains wide open despite its apparent simplicity and the efforts of many researchers (for example, the conjecture was recently the subject of the collaborative “Polymath” project). In this paper we prove that one can always find $\left(1/2-o\left(1\right)\right)n$ disjoint transversal bases, improving on the previous best bound of $\Omega\left(n/\log n\right)$. Our results also apply to the more general setting of matroids.

http://front.math.ucdavis.edu/1810.07462

Earlier the best result was giving $n/\log n$ disjoint transversal bases.

Here is a subsequent paper about the more general Kahn’s conjecture

https://arxiv.org/abs/1810.07464

### Polymath 16 is alive and kicking

Polymath 16 of the chromatic number of the plane is in its eleventh post. A lot of interesting developments and ideas in various directions!

### The polymath picture

I took some pictures which are a little similar to our logo picture (last picture below). (more…)

## April 10, 2018

### Polymath proposal: finding simpler unit distance graphs of chromatic number 5

Filed under: polymath proposals — ag24ag24 @ 5:56 am

The Hadwiger-Nelson problem is that of determining the chromatic number of the plane ( $\mathrm{CNP}$), defined as the minimum number of colours that can be assigned to the points of the plane so as to prevent any two points unit distance apart from being the same colour. It was first posed in 1950 and the bounds $4 \leq \mathrm{CNP} \leq 7$ were rapidly demonstrated, but no further progress has since been made. In a recent preprint, I have now excluded the case $\mathrm{CNP} = 4$ by identifying a family of non- $4$-colourable finite “unit-distance” graphs, i.e. graphs that can be embedded in the plane with all edges being straight lines of length $1$. However, the smallest such graph that I have so far discovered has $1567$ [EDIT: $1581$ after correction] vertices, and its lack of a $4$-colouring requires checking for the nonexistence of a particular category of $4$-colourings of subgraphs of it that have $388$ [EDIT: $395$ after correction] and $397$ vertices, which obviously requires a computer search.

I’m therefore wondering whether a search for “simpler” examples might work as a Polymath project. An example might be defined as simpler if it has fewer vertices, or if it has a smaller largest subgraph whose $4$-colourability must be checked directly, etc. I feel that a number of features make this nice for Polymath:

1. being graph theory, it’s nicely accessible/seductive to non-specialists
2. it entails a rich interaction between theory and computation
3. simpler graphs may lead to insights into what properties such graphs will always/usually have, which might inspire strategies for seeking 6-chromatic examples, improved bounds to the analogous problem in higher dimensions, etc.

Aubrey de Grey

## January 26, 2018

### A new polymath proposal (related to the Riemann Hypothesis) over Tao’s blog

Filed under: polymath proposals — Gil Kalai @ 7:17 am
Tags: , (From a post “the music of the primes” by  Marcus du Sautoy.)

A new polymath proposal over Terry Tao’s blog who wrote: “Building on the interest expressed in the comments to this previous post, I am now formally proposing to initiate a “Polymath project” on the topic of obtaining new upper bounds on the de Bruijn-Newman constant ${\Lambda}$. The purpose of this post is to describe the proposal and discuss the scope and parameters of the project.”

Briefly showing that $\Lambda \le 0$ is the Rieman Hypothesis, and it is known that $\Lambda \le 1/2$.  Brad Rodgers and Terry Tao proved an old conjecture that $\Lambda \ge 0$. The purpose of the project is to push down this upper bound. (The RH is not considered a realistic outcome.)

### Spontaneous Polymath 14 – A success!

Filed under: polymath proposals — Gil Kalai @ 6:27 am
Tags: ,

This post is to report an unplanned polymath project, now called polymath 14 that took place over Terry Tao’s blog. A problem was posed by Apoorva Khare was presented and discussed and openly and collectively solved. (And the paper arxived.)

## August 22, 2017

### Polymath 13 – a success!

Filed under: polymath proposals — Gil Kalai @ 2:09 pm

This post is to note that the polymath13 project has successfully settled one of the major objective. Reports on it can be found on Gower’s blog especially in this post Intransitive dice IV: first problem more or less solved? and this post Intransitive dice VI: sketch proof of the main conjecture for the balanced-sequences model.

## May 15, 2017

### Non-transitive Dice over Gowers’s Blog

Filed under: polymath proposals — Gil Kalai @ 7:36 am

A polymath-style project on non transitive dice (Wikipedea) is now running over Gowers blog. (Here is the link to the first post.) ## May 5, 2017

### Rota’s Basis Conjecture: Polymath 12, post 3

Filed under: polymath proposals — tchow8 @ 3:48 am

We haven’t quite hit the 100-comment mark on the second Polymath 12 blog post, but this seems like a good moment to take stock.  The project has lost some of its initial momentum, perhaps because other priorities have intruded into the lives of the main participants (I know that this is true of myself).  However, I don’t want to turn out the lights just yet, because I don’t believe we’re actually stuck.  Let me take this opportunity to describe some of the leads that I think are most promising.

### Online Version of Conjecture

For general matroids, the online version of Rota’s Basis Conjecture is false, but it is still interesting to ask how many bases are achievable.  One of the nicest things to come out Polymath 12, in my opinion, has been a partial answer to this question: It is somewhere between n/3 + c and n/2 + c.  There is hope that this gap could be closed.  If the gap can be closed then in my opinion this would be a publishable short paper.  Incidentally, if a paper is published by Polymath 12, what pseudonym should be used?  I know that D. H. J. Polymath was used for the first project, but maybe R. B. C. Polymath would make more sense?

### Graphic Matroids

It was suggested early on that graphic matroids might be a more tractable special case.  It wasn’t immediately clear to me at first why, but I understand better now.  Specifically, graphic matroids with no K4 minor are series-parallel and therefore strongly base-orderable and therefore satisfy Rota’s Basis Conjecture.  Thus, in some sense, K4 is the only obstruction to Rota’s Basis Conjecture for graphic matroids, whereas the analogous claim for matroids in general does not hold.

In one of my papers I showed, roughly speaking, that if one can prove an n × 2 version of Rota’s Basis Conjecture, then this fact can be parlayed into a proof of the full conjecture. Of course the n × 2 version is false in general, but I do believe that a thorough understanding of what can happen in just two columns will give significant insight into the full conjecture.  One question I raised was whether any n × 2 arrangement of edges can yield two columns that are bases if we pull out no more than n/3 edges. This is perhaps a somewhat clumsy question, but it is trying to get at the question of whether there are any n × 2 counterexamples that are not just the disjoint union of copies of K4 that have been expanded by “uncontracting” some edges. If we can classify all n × 2 counterexamples then I think that this would be a big step towards proving the full conjecture for graphic matroids.

This is of course not the only possible way to tackle graphic matroids. The main point is that I think there is potential for serious progress on this special case.

### Computational Investigations

I mentioned an unpublished manuscript by Michael Cheung that reports that the n = 4 case of Rota’s Basis Conjecture is true for all matroids.  I find this to be an impressive computation and I think it deserves independent verification.

Finding 5 × 2 counterexamples to Rota’s Basis Conjecture would also be illuminating in my opinion. Gordon Royle provided a link to a database of all nine-element matroids that should be helpful. Luke Pebody started down this road but as far as I know has not completed the computation.

### Strongly Base-Orderable Matroids

In 1995, Marcel Wild proved the following result (“Lemma 6”): Let $M$ be a matroid on an $n^2$-element set $E$ that is a disjoint union of $n$ independent sets $B_1, \ldots, B_n$ of size $n$. Assume that there exists another matroid $M'$ on the same ground set $E$ with the following properties:

(1) $M'$ is strongly base orderable.

(2) $r(X) \ge |X|/n$ for all $X \subseteq E$, where $r$ is the rank function of $M'$.

(3) All circuits $C$ of $M$ satisfying $\forall j: |C\cap B_j| \le 1$ remain dependent in $M'$.

Then there is an $n\times n$ grid whose $i$th row comprises $B_i$ and whose columns are independent in $M$.

Wild obtained several partial results as a corollary of Lemma 6.  How much mileage can we get out of this?  Can we always find a suitable $M'$ for graphic matroids?

### Variants and Related Conjectures

I’m less optimistic that these will lead to progress on Rota’s Basis Conjecture itself, but maybe I’m wrong.  Gil Kalai made several suggestions:

1. Consider d + 1 (affinely independent) subsets of size d + 1 of $\mathbb R^d$ such that the origin belongs to the interior of the convex hull of each set. Is it possible to find d + 1 sets of size d + 1 such that each set is a rainbow set and the interior of the convex hulls of all these sets have a point in common?
2. The wide partition conjecture or its generalization to arbitrary partitions.
3. If we have sets B1, …, Bn (not necessarily bases) that cannot be arranged so that all n columns are bases, then can you always find disjoint n + 1 sets C1, …, Cn+1 such that each set contains at most one member from each Bj and the intersection of all linear spans of the Ci is non trivial?  (I confess I still don’t see why we should expect this to be true.)

Pavel Paták presented a lemma from one of his papers that might be useful. Let M be a matroid of rank r and let S be a sequence of kr elements from M, split into r subsequences, each of length at most k. Then any largest independent rainbow subsequence of S is a basis of M if and only if there does not exist an integer s < r and set of s + 1 color classes, such that the union of these color classes has rank s.

In a different direction, there are graph-theoretic conjectures such as the Brualdi–Hollingsworth conjecture: If the complete graph K2m (for m ≥ 3) is edge-colored in such a way that every color class is a perfect matching, then there is a decomposition of the edges into m edge-disjoint rainbow spanning trees.

### Remarks on Previous Blog Post

Finally, let me make a few remarks about the directions of research that were suggested in my previous Polymath 12 blog post.  I was initially optimistic about matroids with no small circuits and I still think that they are worth thinking about, but I am now more pessimistic that we can get much mileage out of straightforwardly generalizing the methods of Geelen and Humphries, for reasons that can be found by reading the comments.  Similarly I am more pessimistic now that the algebro-geometric approach will yield anything since being a basis is an open condition rather than a closed condition.

The other leads in that blog post have not been pursued much and I think they are still worth looking at.  In particular, that old standby, the Alon–Tarsi Conjecture, may still admit more partial results. Rebecca Stones’s suggestion that maybe LnevenLnodd ≢ 0 (mod p) when p = 2n + 1 is prime still looks to me like a good idea and I don’t think many people have seriously thought about this. Also I agree with David Glynn that more people should study Carlos Gamas’s recent paper on the Alon–Tarsi Conjecture.

Next Page »

Blog at WordPress.com.