2024-09-05 15:00-16:00 FAMNIT-MP1 Morgan Rodgers (University of Kaiserslautern-Landau) Regular sets in finite polar spaces A regular set or equitable bipartition in a (finite simple) graph is a set of vertices $Y$ such that there exist constants $a$ and $b$ for which each vertex…
2024-08-19 16:00-17:00 FAMNIT-MP6 Tomáš Masařík (University of Warsaw) Linear Bounds for Cycle-free Saturation Games Given a family of graphs F, we define the F-saturation game as follows. Two players alternate adding edges to an initially empty graph on n vertices,…
2024-06-07 11:30 – 12:30 FAMNIT-MP1 Besfort Shala (University of Bristol) A tour through multiplicative and probabilistic number theory I will give a general overview of recent developments in number theory, with many old and new results being proved through the…
2024-06-03 15:00-16:00 FAMNIT-MP1 Petr Golovach (University of Bergen) Detours in Directed Graphs We study the ”above guarantee” version of the classical Longest Path problem on undirected and directed graphs called Longest Detour where the task is to decide whether…
2024-05-27 15:00-16:00 FAMNIT-MP1 Tara Abrishami (University of Hamburg) Induced matching treewidth and the maximum independent set problem Width parameters such as treewidth, the most prominent width parameter, are graph invariants that roughly measure how complicated a graph is. Several width…
2024-05-20 15:00-16:00 FAMNIT-MP1 Dilawar Abbas Khan (University of Primorska) Optimal plateaued functions without linear structures In this talk, we address the algebraic method to design plateaued functions with desirable cryptographic properties (such as maximal algebraic degree and balancedness) by employing…
2024-05-13 15:00-16:00 FAMNIT-MP1 Draženka Višnjić (University of Primorska) Homomorphisms on the Coxeter-like graphs Let $\{tilde\Gamma}_n$ be the graph with the vertex set of all symmetric matrices $S_n(F_2)$ with coefficients from binary field $F_2=\{0,1\}$, where two matrices $A,B \in S_n(F_2)$ form…
2024-05-06 15:00-16:00 FAMNIT-MP1 Endre Boros (Rutgers University, USA) Boole’s problem and a zero-one lemma We introduce Boole’s problem, and the reasonably large literature related to it. We then recall an old result of Renyi (1962) that we prefer to call “a…
2024-04-29 15:00 — 16:00 FAMNIT-MP1 Aljaž Kosmač (University of Primorska) Isogeometric collocation for solving the biharmonic equation over planar multi-patch domains We present an isogeometric collocation method for solving the biharmonic equation over planar bilinearly parameterized multi-patch domains. The…
2024-04-22 15:00-16:00 FAMNIT-MP1 Tomaž Pisanski (University of Primorska, Slovenia) Geometric symmetry of graphs This work in progress explores graphs that can be drawn in the Euclidean plane exhibiting non-trivial geometric symmetry. We investigate the significance of semiregular and quasi-semiregular automorphisms…
