Reading-working seminar
My seminar is for highschool students, decent undergraduates, bright graduates, and outstanding professors. (I. M. Gelfand)
My seminar is for highschool students, decent undergraduates, bright graduates, and outstanding professors. (I. M. Gelfand)
In 2026 spring term we will (usually) meet on Fridays at VU MIF Computer Science Institute, Didlaukio 47, Vilnius; for precise time and room, see Programme
You can also join us online on MS Teams via this link
You are welcome in room 513 for tea and biscuits 15 minutes before the start of the talk.
2026 pavasario semestrą (paprastai) susitiksime penktadieniais 11 val., VU MIF Informatikos Institute, Didlaukio g. 47, Vilnius; tikslų laiką ir auditoriją rasite programoje
Transliuojame per MS TEAMS nuoroda
Esate laukiami 513 kambaryje arbatai ir sausainiams 15 minučių prieš pradžią.
May 29 TBA
May 22 No seminar for sure
May 15 No seminar (so far)
May 8 at 10:00 in room 101 (Didlaukio) Matas continues about large deviations
May 1 No seminar 🚩
April 24 at 11:00 in room 102 (Didlaukio), Matas talks about large deviations in the dense random binomial graph, arxiv.org/abs/1008.1946 and arxiv.org/pdf/1210.7013
April 17 at 10:00 in room 101 (Didlaukio) Tomas continues the proof regarding Sparse rulers. 1949 paper by L. Rédei, A. Rényi
April 3, change of room: 102 (Didlaukio) Tomas talks about Sparse rulers
March 26, Cancelled
March 13, Tomas continues On Spencer's six sigma bound in discrepancy theory
March 6 Friday, Tomas talks about On Spencer's six sigma bound in discrepancy theory
References:
N. Alon, J. Spencer, The Probabilistic Method (page 223)
J. Spencer, Six sigmas suffice, Annals of the New York Academy of Sciences. 1989 ; Vol. 555, No. 1. pp. 394-396.
February 27 NO Seminar, but we recommend the talk by M. Bloznelis on his paper arXiv:2602.02166v2 on February 25 Wednesday at 17:00 in room 103 (Didlaukio) MS Teams link
February 20 Friday, Tereza talks about Acyclic edge-coloring using entropy compression https://arxiv.org/abs/1206.1535
February 13 Friday, Matas continues on the Park–Pham theorem
February 6 Friday, Matas on the Park–Pham proof of Kahn–Kalai conjecture about thresholds in product spaces (described the notions and stated the conjecture) https://arxiv.org/abs/2203.17207 ; Park's talk about thresholds ; Park's talk about Kahn-Kalai conjecture proof
December 23 Tuesday, 10:00, Didlaukio str. room 513 Aistis Atminas: Packing edge-colouring: between proper and strong
December 19, no seminar
December 12, room 202 (Naugarduko). Matas about how many times it is sufficient to shuffle a deck of card to make it random. Based on Chapter Shuffling cards from Proofs from the book by Aigner and Ziegler, related to this paper
December 5. No seminar
November 28, room 203, Valentas about Decoupling lemma and quadratic multilinear polynomial concentration in the interval https://arxiv.org/pdf/math/0505156
November 21. (delayed until 10:45) Matas about giant component in random graphs (Erdős–Rényi and inhomogeneous)
November 14. Tereza continues the previous topic, showing application of Lovasz LL.
November 7. Tereza about about embedding oriented trees into digraphs of large out-degree https://arxiv.org/abs/2505.21367
October 31. Tomas about how to bound the number of spanning trees of a graph given its degree sequence. Based on https://sites.math.rutgers.edu/~narayanan/pdf/counting_spanning_trees.pdf
October 24. No seminar
October 17. Tereza about Algorithms for H-free graphs.
An improved upper bound for the multicolour Ramsey number of odd cycles https://arxiv.org/pdf/2510.17981 (reserved for Tomas)
Torsten Mütze. A book proof of the middle levels theorem (2023)
Acyclic edge-coloring using entropy compression by Louis Esperet and Aline Parreau https://www.sciencedirect.com/science/article/pii/S0195669813000310 (reserved for Tereza)