Raziskovalni matematični seminar - Arhiv
| 2024 | 2023 | 2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 |
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
During the talk, we give a short introduction to some basic definitions and notions regarding (vectorial) bent functions, which have been extensively studied in the past four decades. We present two new superclasses of bent functions obtained from the Maiorana-McFarland class (M) and Carlet's C and D classes. This is the first time bent functions are obtained from the M class by modifying the values on a set rather than some linear/affine subspace of GF(2^m). We also present a new generic construction method for vectorial bent functions using the so-called (P_U) property, which was introduced by Tang et al. in 2017. By combining these results, we obtain new families of vectorial bent functions weakly/strongly outside the completed M class. Some results obtained jointly with Enes Pasalic, Fengrong Zhang and Samir Hodžić are presented.
We are looking forward to meeting you at FAMNIT-MP1.
This Monday, April 4, 2022, from 10 am to 11 am.
Our Math Research Seminar will not be broadcasted via Zoom this time.
Everyone is welcome and encouraged to attend.
During the talk, we give a short introduction to the graph minor project of Robertson and Seymour, that is a series of twenty papers that runs along more than 500 pages published from 1983 to 2004. The main result is the proof of conjecture of Wagner : in any infinite set of graphs, there must be a pair of graphs one of which is a minor of the other. This seemingly simple statement is in fact very deep and has algorithmic consequences of stunning generality. We will explain the statement and its consequences in a gentle way for computer scientists and mathematicians who are not specialists in graph theory (including all basic definitions). We will also present recent developments on analogs of some of the results of Robertson and Seymour when the « minor » containment relation is replaced by the « induced subgraph » containment relation.
Some results obtained jointly with Pierre Aboulker, Isolde Adler, Eunjung Kim and Ni Luh Dewi Sintiari will be presented.
Our Math Research Seminar will not be broadcasted via Zoom this time.
Everyone is welcome and encouraged to attend.
Our Math Research Seminar will not be broadcasted via Zoom this time.
Everyone is welcome and encouraged to attend.
Temporal graphs are graphs with a fixed vertex set and a set of edges that changes over time. This paradigm reflects the structure and operation of a great variety of modern networks, such as social networks, wired or wireless networks whose links change dynamically, transportation networks, etc.
In this talk we will introduce two different problems on temporal graphs (one path-related and one non-path related), and study their complexity.
