2020-11-23 10:00 — 11:00 ZOOM (See link below) René Rodríguez Aldama Minimal linear codes: new constructions Linear codes have been widely used in communication systems since the beginning of the digital age. Mathematical research focused on error-correcting codes because of…
2020-11-16 10:00 — 11:00 ZOOM (See link below) Amar Bapić (UP IAM, Slovenia) Cryptographically significant mappings over $\mathbb{F}_2^n$. In the first part of the talk, we give basic definitions and properties of some cryptographically significant mappings, including (vectorial) bent functions,…
2020-11-09 10:00 — 11:00 ZOOM (See link below) Nastja Cepak (UP IAM, Slovenia) Post-Quantum Cryptography This is the first in a series of seminars by members of the Center of Cryptography. Our research has many practical applications, and in the…
2020-11-02 10:00 — 11:00 ZOOM (See link below) Irena Penev (Charles University, Czech Republic ) Coloring certain even-hole-free graphs This talk will consist of three parts. In the first part of the talk (joint work with Valerio Boncompagni and Kristina…
2020-10-26 10:00 — 11:00 ZOOM (See link below) Peter Muršič (UP FAMNIT) Strong cliques in diamond-free graphs. A strong clique in a graph is a clique intersecting all inclusion-maximal stable sets. Strong cliques play an important role in the study…
On Saturday, 10 October, 2020, the final round of the University Programming Marathon – UPM 2020 took place. Out of 46 teams and 127 competitors, 15 best teams qualified for the finals. Due to measures to prevent the spread of…
2020-10-19 10:00 — 11:00 FAMNIT-VP1 and Zoom Meike Hatzel (TU Berlin, Germany) Constant Congestion Brambles In this talk I will present a small result we achieved during a workshop in February this year. My coauthors on this are Marcin Pilipczuk,…
2020-10-13 10:00 — 11:00 FAMNIT-Muzejski4 Dragan Stevanović (MISANU) On graphs with distinct vertex transmissions Transmission of a vertex in a connected graph is the sum of distances from that vertex to all other vertices in the graph. While the use…
2020-10-12 10:00 — 11:00 FAMNIT-VP1 and Zoom Isolde Adler (University of Leeds) On the tree-width of even-hole-free graphs In recent years, even-hole-free graphs were the object of much attention, however, many questions remain unanswered, such as the existence of a…
The Slovenian Research Agency (ARRS) announced that the University of Primorska again obtained funds for two bilateral scientific and research cooperation projects, this time with universities from Denmark and Norway. The project Post-quantum cryptanalysis of block ciphers, whose principal investigator…