כותרת: בנייה ומנייה באמצעות השיטה ההסתברותית
תקציר:
שתיים מהשאלות הבסיסיות של המתמטיקאי הטיפוסי הן "האם קיים?" ו"כמה יש?". בהרצאה זו נציג מבוא לשיטה ההסתברותית, שלעתים קרובות מספקת תשובות לשאלות אלה. לאחר הצגת המושגים הבסיסיים נלמד את השיטה דרך דוגמאות:
קיום של גרפים ללא תת-גרף שלם גדול וללא קבוצה בלתי תלויה גדולה:
בהנתן גרף, תת-גרף שלם שלו הינו תת-קבוצה של קודקודים כך שכל הצלעות ביניהם נמצאים בגרף, וקבוצה בלתי תלויה היא תת-קבוצה של הקודקודים ביניהם אין אף צלע.
במאמר שהכניס את השימוש בהסתברות לקומבינטוריקה, פאול ארדש הוכיח שאם בוחרים גרף עם
$2^{k/2}$
Abstract: Let G be a finite abelian group. We say that a given subset of G is uniform if all of its Fourier coefficients are small. We'll show that uniform sets are common and explore some of their nice additive properties.
Abstract: This talk describes two classes of symbolic topological systems, the odometer based and the circular systems. The odometer based systems are ubiquitous--when equipped with invariant measures they form an upwards closed cone in the space of ergodic transformations (in the pre-ordering induced by factor maps). The circular systems are a small class, but represent the diffeomorphisms of the 2-torus built using the Anosov-Katok technique of approximation by conjugacy.
For fixed t>1 and L>3 we establish sharp asymptotic formula for
the log-probability that the number of cycles of length L in the Erdos - Renyi
random graph G(N,p) exceeds its expectation by a factor t, assuming only that
p >> log N/sqrt(N). In a narrower range of p=p(N) we obtain such sharp upper tail
for general subgraph counts and for the Schatten norms of the corresponding adjacency
matrices.
In this talk, based on a joint work with Nick Cook, I will explain our approach,
based on convex-covering and a new quantitative refinement of
Abstract: In Diophantine approximation we are often interested in the Lebesgue and Hausdorff measures of certain $\limsup$ sets. In 2006, Beresnevich and Velani proved a remarkable result --- the Mass Transference Principle --- which allows for the transference of Lebesgue measure theoretic statements to Hausdorff measure theoretic statements for $\limsup$ sets arising from sequences of balls in $\mathbb{R}^k$.
Abstract: We shall try to prove the consistency of d_lambda > r_lambda (and even d_lambda > u_lambda) for a singular cardinal lambda. This is a joint work with Saharon.
This is a continuation of the talk on October 29. After finishing a brief review of basic facts about Berkovich curves, I will associate a reduction datum to differential forms on such curves and explain how a lifting theorem for such data is proved and why it reproves the lifting theorem of [BCGGM].
Abstract: The stable fields conjecture asserts that every infinite stable field is separably closed. We will talk a bit about the history of this conjecture, its connection to an analogous conjecture on dependent fields and some of their consequences. Finally, we will end by proving the conjecture for fields of finite dp-rank.
Title: The Morris model
Abstract: Douglass Morris was a student of Keisler, and in 1970 he announced the
following result: It is consistent with ZF that for every \alpha, there is a set
A_\alpha which is the countable union of countable sets, and the power set of
A_\alpha can be partitioned into \aleph_\alpha non-empty sets.
The result was never published, and survived only in the form of a short
announcement and an exercise in Jech's "The Axiom of Choice". We go over the
proof of this theorem using modern tools, as well as some of its odd
implications about "size" and countability.
The moduli space of smooth curves with a chosen differential form has a natural stratification by the pattern of zeros of the form. In a recent paper of Bainbridge-Chen-Gendron-Grushevsky-Moeller, one used a complicated complex-analytic technique to explicitly describe a compactification of these strata. In a joint work in progress with I. Tyomkin we provide an algebraic proof of these results based on studying differential forms on Berkovich curves over fields of residual characteristic zero.
