Speaker:
Ana Zumalacárregui
Zugehörigkeit:
U. Autónoma de Madrid
Datum:
Mit, 2013-05-08 14:15 - 15:15
I will present a unified framework to deal with threshold
functions for the existence of certain combinatorial structures in random
sets. More precisely, let M·x=0 be a linear system defining our structure
(k-arithmetic progressions, k-sums, B_h[g] sets or Hilbert cubes, for
example), and A be a random set on {1,...,n} where each element is chosen
independently with the same probability.
I will show that, under certain natural conditions, there exists a
threshold function for the property "A^m contains a non-trivial solution of
English
Deutsch