Tag Archives: Geometric combinatorics

A Discrepancy Problem for Planar Configurations

Posted on February 3, 2010 by Gil Kalai

Yaacov Kupitz and Micha A. Perles asked: What is the smallest number C such that for every configuration of n points in the plane there is a line containing two or more points from the configuration for which the difference between the … Continue reading →

Posted in Combinatorics | Tagged Discrepency, Geometric combinatorics | Leave a comment

Extermal Combinatorics II: Some Geometry and Number Theory

Posted on July 17, 2008 by Gil Kalai

Extremal problems in additive number theory Our first lecture dealt with extremal problems for families of sets. In this lecture we will consider extremal problems for sets of real numbers, and for geometric configurations in planar Euclidean geometry. Problem I: Given a set A of … Continue reading →

Posted in Combinatorics, Open problems | Tagged Additive combinatorics, Extremal combinatorics, Geometric combinatorics | 3 Comments

	Pewa on Answer: Lord Kelvin, The Age o…
	Gil Kalai on Answer: Lord Kelvin, The Age o…
	Pewa on Answer: Lord Kelvin, The Age o…
	fedja on Chess can be a Game of Lu…
	qm computing summer… on The Race to Quantum Technologi…
	Murat Aygen on Remote Blogging: Efficiency of…
	Gil Kalai on Chess can be a Game of Lu…
	fedja on Chess can be a Game of Lu…
	Solvig Kadison-Singe… on The Kadison-Singer Conjecture…
	Matthew Cory on Call for nominations for the O…
	Matthew Cory on The Race to Quantum Technologi…
	domotorp on Chess can be a Game of Lu…

Tag Archives: Geometric combinatorics

A Discrepancy Problem for Planar Configurations

Extermal Combinatorics II: Some Geometry and Number Theory

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives