Dear Participants of the graduate students' reading seminar,
As agreed on the previous two seminars, we go jointly for a dinner
tomorrow (Thursday 11th) at 7pm to the restaurant Lehka hlava (Clear Head)
https://www.lehkahlava.cz/en/contact/
Please send us a short email if you plan to join.
We have no funds for paying for the dinner, so everybody pays for
herself/himself.
Looking forward to see you there (and still before it, on the seminar
tomorrow),
Robert and Pavel
--
Robert Šámal
IÚUK MFF UK -- CSI of Charles University
Dear KAMAK 2023 Participants, dear grad.student seminar participants,
As proposed earlier, tomorrow -- Thursday January 11, 10:00-12:00, we have
a
KAMAK progress report. It is in a HYBRID form.
Either you can come to the lecture room S8 in Prague, or you can join via
zoom:
https://cesnet.zoom.us/j/97472038049?pwd=VmpRRnpuSVBjL3VCcGNDQkg3MVBzdz09
Meeting ID: 974 7203 8049
Passcode: 743226
We hope that each group will be ready to repeat the problem and share
(partial) results and/or existing open questions with others. Please make
sure that also people not familiar with the problem can understand what you
are speaking about. If your group manages to send us an estimate of time
length for you presentation before the meeting, we will be happy.
We stress that all our graduate students are welcome to attend, even if
they did not take part in last year KAMAK.
See you tomorrow (in person or via zoom),
Robert and Pavel
Hi all,
Just a reminder: this Thursday we will have next edition of "doktorandsky
seminar". As announced on https://kam.mff.cuni.cz/~dsemweb/, our speaker
will be
Petr Chmel
and he will talk about paper
The Hardest Explicit Construction
by Oliver Korten
https://ieeexplore.ieee.org/document/9719750https://arxiv.org/abs/2106.00875
Time: Thursday 9:50-12:10
Place: S8
Probabilistic method is a common technique to show the existence of
interesting combinatorial objects by counting. Often, even in cases when we
can compute that a majority of objects of certain type have a desirable
property, it is still hard to explicitly construct one such object. This is
the purpose of this paper, presented at FOCS'21. It uses methods of
complexity, logic, randomness, etc. So, it will hopefully be interesting
for everybody.
See you there,
R
--
Robert Šámal
IÚUK MFF UK -- CSI of Charles University