Tag Archives: David Larman

Andriy Bondarenko Showed that Borsuk’s Conjecture is False for Dimensions Greater Than 65!

Posted on May 27, 2013 by Gil Kalai

The news in brief Andriy V. Bondarenko proved in his remarkable paper The Borsuk Conjecture for two-distance sets that the Borsuk’s conjecture is false for all dimensions greater than 65. This is a substantial improvement of the earlier record (all dimensions … Continue reading →

Posted in Combinatorics, Geometry, Open problems | Tagged Andriy Bondarenko, Borsuk's conjecture, David Larman, Dom DeCaen, Strongly regular graphs | 2 Comments

	Margene on Some Philosophy of Scienc…
	Seth on Navier-Stokes Fluid Computers
	John Sidles on BosonSampling and (BKS) Noise…
	ashish soni on Navier-Stokes Fluid Computers
	Gil Kalai on Navier-Stokes Fluid Computers
	Joseph Malkevitch on Navier-Stokes Fluid Computers
	gowers on Polymath5 – Is 2 logarit…
	John Sidles on Navier-Stokes Fluid Computers
	Gil Kalai on Navier-Stokes Fluid Computers
	Gil Kalai on Navier-Stokes Fluid Computers
	Gil Kalai on Navier-Stokes Fluid Computers
	John Sidles on Navier-Stokes Fluid Computers

Tag Archives: David Larman

Andriy Bondarenko Showed that Borsuk’s Conjecture is False for Dimensions Greater Than 65!

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives

Follow “Combinatorics and more”