CoSP student workshop 2020 organised by Michael Skotnica will be held remotely on July 29, 2020.
Starting summer 2020 Shira Zerbib is coordinating a CoSP Zoom seminar on topological combinatorics, replacing a conference on the same topic that was supposed to take place in Prague this summer and was cancelled due to COVID-19.
The talks will be given on Tuesdays and Thursdays at 8:00am (CDT), as of June 30, 2020.
REU 2020 (Research Experience for Undergraduates) is due to the corona virus pandemy taking place online. 12 students from Charles University Prague established collaboration with their mentors at Rutgers University (USA). Students presented their projects on 2nd June 2020.
REU 2020 (Research Experience for Undergraduates at Rutgers University) came into its final phase. Students held their final presentations on 22/07/2020 and 23/07/2020. More information about REU 2020 is available here. The whole event was supported by CoSP project.
We are publishing Charles University's student presentations.
Date: 10th September 2020 - 11th September 2020
Place: online through ZOOM; zoom details in the beginning of September
Participants: representatives of CUNI, Technion, CNRS, represeantatives of secondees and host institution researchers
REU 2021 (Research Experience for Undergraduates) is again due to the corona virus pandemy taking place online. 5 students from Charles University Prague established collaboration with their mentors at Rutgers University (USA) and Princeton University (USA).
David Ryzák and David Sychrovsky will be working with Ron Holzman (Princeton University)
Sasha Sami and Vishal Ramesh will be working with Eric Allender (Rutgers University)
Title: Necklace splitting on trees
Martin Tancer, Charles University Prague
video available here
In the classical necklace splitting problem k thieves steal an open-ended necklace with t different types of gems. The number of gems of each type is divisible by k. The target of the thieves is to split the necklace with as few cuts as possible so that they can distribute the pieces so that each thief gets the same number of gems of each type as the other thieves. In this variant, it is well known that (k-1)t cuts are sufficient and for some necklaces also necessary.
During the talk, I will discuss the variant of this problem when the necklace is arranged along the tree. This setting offers several variants of the problem. I will show a combinatorial solution and a geometric solution of some of the variants. The talk is based on joint discussions with Martin Loebl.
Title: Weak saturation on graphs and hypergraphs.
Misha Tyomkyn, Charles University Prague
video available here
Suppose a pandemic spreads on the edges of a graph G as follows. Initially a subset of edges are infected. If at any point two out of three edges forming a triangle in G are infected, the third edge becomes infected too.
Continue until no further infections are possible. What we have just described is known as the weak saturation process, and can be defined for any fixed graph H in place of a triangle. It leads to a variety of interesting questions, most importantly, what is the smallest number of initially infected edges that would guarantee every edge of G to become infected? We will survey some classical and present some new results. Joint work with Denys Bulavka and Martin Tancer.
REU 2021 (Research Experience for Undergraduates) is again due to the corona virus pandemy taking place online. The participation has been really successful, here are the final presentations which involve students from Prague.
David Ryzák and David Sychrovsky have been be working with Ron Holzman (Princeton University) REU_final (1).pdf
Sasha Sami and Vishal Ramesh have been working with Eric Allender (Rutgers University) REU_final (2).pdf