2019-05-13 10:00–11:00 FAMNIT-MP1 Nina Chiarelli (FAMNIT and IAM, UP) Linear separation of connected dominating sets in graphs A connected dominating set in a graph is a dominating set of vertices that induces a connected subgraph. In this talk we present…
2019-05-16 11:00–12:00 FAMNIT-VP2 Elvis Baraković (University of Tuzla, Bosnia and Herzegovina) Axial torsion waves in metric-affine gravity We construct new explicit vacuum solutions of quadratic metric-affine gravity. The approach of metric-affine gravity in using an independent affine connection produces a…
2019-05-06 10:00–11:00 FAMNIT-MP1 Martin Milanič (IAM and FAMNIT, University of Primorska) Decomposing 1-Sperner hypergraphs, with applications to graphs Hypergraphs are generalizations of graphs in which edges (in this context referred to as hyperedges) can have arbitrary cardinality. A hypergraph is…
2019-04-26 11:00–12:00 FAMNIT-MP6 Riste Škrekovski (UL FMF, UP FAMNIT, IMFM, FIŠ) Some results and problems on unique-maximum colorings of plane graphs A unique-maximum coloring of a plane graph G is a proper vertex coloring by natural numbers such that each…
2019-04-15 10:00-11:00 FAMNIT-MP1 Graziano Gentili (Universita degli studi Firenze, Italy) Regular functions of a quaternionic variable with applications The recent notion of quaternionic slice regularity has identified a new class of functions which can play the role of holomorphic (and…
2019-04-08 10:00-11:00 FAMNIT-MP1 Berenice Martinez-Barona (Universitat Politecnica de Catalunya and University of Primorska) Identifying codes in digraphs A (1,le ell)-identifying code in a digraph D is a dominating subset C of vertices of D such that all distinct subsets of…
2019-04-01 10:00-11:00 FAMNIT-MP1 Peter Muršič (University of Primorska) Hypergraph Nim Nim is an impartial game in which two players take turns choosing a pile and removing a positive tokens from it, with the player making the last move winning. Impartial…
2019-03-25 10:00 — 11:00 FAMNIT-Muzejski 1 Russ Woodroofe (University of Primorska) Binomial divisibility to 7 billion In earlier work with John Shareshian, we asked whether for every number n, there are primes p and r so that every nontrivial binomial…
2019-03-21 10:00-11:00 FAMNIT-MP4 Slobodan Filipovski (University of Primorska) A connection between a question of Bermond and Bollobas and Ramanujan graphs If we let n(k, d) denote the order of the largest undirected graphs of maximum degree k and diameter d,…
2019-03-18 10:00-11:00 FAMNIT-MP1 Samir Hodžić (University of Primorska) On secondary constructions of bent and plateaued functions In this talk, we consider secondary construction methods of bent and plateaued functions. The first part of this talk focuses on plateaued functions, where…