## You're reading: Posts Tagged: Polymath

### The 12th Polymath project has started: resolve Rota’s basis conjecture

Timothy Chow of MIT has proposed a new Polymath project: resolve Rota’s basis conjecture.

What’s that? It’s this:

… if $B_1$, $B_2$, $\ldots$, $B_n$ are $n$ bases of an $n$-dimensional vector space $V$ (not necessarily distinct or disjoint), then there exists an $n \times n$ grid of vectors ($v_{ij}$) such that

1. the $n$ vectors in row $i$ are the members of the $i$th basis $B_i$ (in some order), and

2. in each column of the matrix, the $n$ vectors in that column form a basis of $V$.

Easy to state, but apparently hard to prove!

### Terence Tao has solved the Erdős discrepancy problem!

Terence Tao has just uploaded a preprint to the arXiv with a claimed proof of the Erdős discrepancy problem.

### Bound on prime gaps bound decreasing by leaps and bounds

Update 17/06/2013: The gap is down to 60,744. That’s a whole order of magnitude down from where it started!

When Yitang Zhang unexpectedly announced a proof that that there are infinitely many pairs of primes less than 70 million apart from each other – a step on the way to the twin primes conjecture – certain internet wags amused themselves and a minority of others with the question, “is it a bigger jump from infinity to 70 million, or from 70 million to 2?”.

Of course the answer is that it’s a really short distance from 70 million to 2, and here’s my evidence: the bound of 70 million has in just over three weeks been reduced to just a shade over 100,000.