פעילויות השבוע
AGNT
Introduction to Diophantine approximation and a generalisation of Roth‘s theorem
מאי 11, 16:00—17:00, 2022, -101
מרצה
Paolo Dolce (BGU)
תקציר
Classically, Diophantine approximation deals with the problem of studying ”good“ approximations of a real number by rational numbers. I will explain the meaning of ”good approximants“ and the classical main results in this area of research. In particular, Klaus Roth was awarded with the Fields medal in 1955 for proving that the approximation exponent of a real algebraic number is 2. I will present a recent extension of Roth‘s theorem in the framework of adelic curves. These mathematical objects, introduced by Chen and Moriwaki in 2020, stand as a generalisation of global fields.
BGU Probability and Ergodic Theory (PET) seminar
Density of oscillating sequences in the real line Online
מאי 12, 11:10—12:00, 2022, -101
מרצה
Ioannis Tsokanos (The University of Manchester)
תקציר
In this talk, we study the density properties in the real line of oscillating sequences of the form $( g(k) \cdot F(kα) )_{k \in \mathbb{N}}$, where $g$ is a positive increasing function and $F$ a real continuous $1$-periodic function. This extends work by Berend, Boshernitzan and Kolesnik who established differential properties on the function F ensuring that the oscillating sequence is dense modulo 1.
More precisely, when $F$ has finitely many roots in $[0,1)$, we provide necessary and sufficient conditions for the oscillating sequence under consideration to be dense in $\mathbb{R}$. All the related results are stated in terms of the Diophantine properties of $α$, with the help of the theory of continued fractions.
קולוקוויום
A Solution to Ringel‘s Circle Problem (1959)
מאי 17, 14:30—15:30, 2022, Math -101
מרצה
Shakhar Smorodinsky (BGU)
תקציר
In 1959 Gerhard Ringel posed the following problem which remained open for over 60 years. Suppose we are given a finite family $\C$ of circles in the plane no three of which are pairwise tangent at the same point. Is it possible to always color the circles with five colors so that tangent circles get distinct colors.
When the circles are not allowed to overlap (i.e., the discs bounded by the circles are pairwise interiorly disjoint) then the number of colors that always suffice is four and this fact is equivalent to the Four-Color-Theorem for planar graphs.
We construct families of circles in the plane such that their tangency graphs have arbitrarily large girth and chromatic number. Moreover, no two circles are internally tangent and no two circles are concentric. This provides a strong negative answer to Ringel‘s 1959 open problem. The proof relies on a (multidimensional) version of Gallaiӳ theorem with polynomial constraints, which we derive using tools from Ramsey-Theory.
Joint work with James Davis, Chaya Keller, Linda Kleist and Bartosz Walczak
אשנב למתמטיקה
בעיית אוסף הקופונים
מאי 17, 16:10—17:30, 2022, אולם -101, בניין מתמטיקה
מרצה
דניאל ברנד
תקציר
בכל קופסא של דגני בוקר ישנו קופון. יש $n$ סוגים של קופונים. הקופונים שווי שכיחות. כמה קופסאות יש לקנות בממוצע על מנת להשיג לפחות קופון אחד מכל סוג?
הבעייה ידועה כבעיית אוסף הקופונים. היא הוצגה כבר ע“י דה-מואבר לפני יותר מ-300 שנה.
נציג מספר תוצאות המתייחסות לבעייה ולואריאנטים שלה וכן מספר שימושים.