MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Two years ago, Joel Friedman submitted a paper purporting to prove the Hanna Neumann Conjecture, which eventually turned out to contain a fatal bug and was withdrawn. Quite recently, Friedman repeated his attempt at proof with paper "Sheaves on Graphs and a Proof of the Hanna Neumann Conjecture": . Has this attempt been verified by anyone or is still under review?

share|cite|improve this question

closed as off topic by Gerald Edgar, Qiaochu Yuan, Noah Snyder, Kevin Buzzard, Mark Sapir Jun 5 '11 at 12:08

Questions on MathOverflow are expected to relate to research level mathematics within the scope defined by the community. Consider editing the question or leaving comments for improvement if you believe the question can be reworded to fit within the scope. Read more about reopening questions here.If this question can be reworded to fit the rules in the help center, please edit the question.

Is MO the right place for this kind of discussion? – Alain Valette Jun 3 '11 at 15:30
I don't think it is appropriate to discuss such things here, and I believe there was a meta discussion to that effect when people started posting questions about Deolalikar's paper. – Qiaochu Yuan Jun 3 '11 at 17:44
My motivation for asking this question is: a) this is not a "high profile" problem as RH, Collatz or P/NP, so unlikely to attract much attention on blogs etc. (= hard to know, for me, what the community thinks of it), b) the technology used in the proof seems quite nonstandard, maybe someone knowledgeable could e.g. put this in wider context, previous proof attempts, whether this has any heuristic chance of succeeding etc – Marcin Kotowski Jun 3 '11 at 18:45
For those who is interested in the Hannah Neumann conjecture, both Friedman and Mineyev are going to participate in a Banff workshop in June, and Mineyev is going to participate in the AIM workshop in September. I am co-organizing the AIM workshop and Miklos Abert is co-organizing both. So if not by the end of June, then by the end of September, we will know at least if Mineyev's (shorter) proof is correct. – Mark Sapir Jun 6 '11 at 5:50

I don't think that this latest round has been independently verified.

Igor Mineyev has also announced a solution. See

share|cite|improve this answer

Not the answer you're looking for? Browse other questions tagged or ask your own question.