Search for tag: "combinatorics"
Sivakanth Gopi - Locally decodable codes and arithmetic progressions in random settings(1) A set D of natural numbers is called t-intersective if every positive upper density subset A of natural numbers contains a (t+1)-length arithmetic progression (AP) whose common differences is in…
From Katie Gentilello
14 plays
0
|
|
Lutz Warnke - Large girth approximate Steiner triple systemsIn 1973 Erdos asked whether there are n-vertex partial Steiner triple systems with arbitrary high girth and quadratically many triples. (Here girth is defined as the smallest integer g \ge 4 for…
From Katie Gentilello
206 plays
0
|
|
86 Years of Ramsey R(3,k) (and counting!) - Joel SpencerThe search for the asymptotics of the Ramsey function R(3,k) has a long and fascinating history. It begins in the hill country surrounding Budapest and winding over the decades through Europe,…
From Katie Gentilello
53 plays
0
|
|
Modern Erdos Magic - Joel SpencerTraditional Erdos Magic (a.k.a. The Probabilistic Method) proves the existence of an object with certain properties by showing that a random (appropriately defined) object will have those properties…
From Katie Gentilello
40 plays
0
|
|
A constant-factor approximation algorithm for the asymmetric traveling salesman problem - László A. VéghWe give a constant-factor approximation algorithm for the asymmetric traveling salesman problem. Our approximation guarantee is analyzed with respect to the standard LP relaxation, and thus our…
From Katie Gentilello
43 plays
0
|
|
Emergent Pfaffian Relations in QuasiPlanar Models - Michael Aizenmanhttps://mediaspace.gatech.edu/media/Federico+Bonetto+-+Aizenman/1_li7b58fv
From Katie Gentilello
9 plays
0
|
|