news_import

news_import

Mathematical Advent Calendar 2019

Elementary School students (8th and 9th year) and High School students are invited to compete in solving problems as part of the  Mathematical Advent Calendar. The competitors are divided into three categories: 1st level (Elementary School, 2nd level (High School,…

Minimal linear codes: new constructions

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…

Measures remain in place at least until the New Year

Yesterday a meeting of university representatives with the Ministry of Education, Science and Sport and National Institute of Public Health took place.  We were informed about current COVID-19 situation, spreading trends and consequently expected gradual easing of measures. Considering all…

Cryptographically significant mappings over $\mathbb{F}_2^n$.

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,…

Post-Quantum Cryptography

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…

Coloring certain even-hole-free graphs

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…

Strong cliques in diamond-free graphs.

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…

The finals of UPM 2020 are concluded

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…

Constant Congestion Brambles

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,…

On graphs with distinct vertex transmissions

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…

Accessibility Toolbar