2017-05-17 13:00 – 14:00 FAMNIT-MP1 Safet Penjić (UP IAM) On the Terwilliger Algebra of Bipartite Distance-regular graphs (Disposition of the PhD Thesis) This is a presentation of the PhD thesis topic.Let \G denote a bipartite distance-regular graph with diameter D \ge 4 and valency k \ge 3. Let…
2017-05-15 10:00-11:00 FAMNIT-POŠTA Russ Woodroofe (Mississippi State University, USA) Arrangements and the independence polynomial I’ll show how to construct a subspace arrangement which encodes the independence polynomial of a graph G. I’ll discuss possible applications to unimodality questions.
2017-05-08 10:00-11:00 FAMNIT-POŠTA Bogdan Soban Matematika in digitalna umetnost Povezanost med umetnostjo in znanostjo, še posebej z matematiko, je zgodovinsko dokazana. S pojavom digitalne umetnosti je matematika pridobila še dodatno vlogo, saj se neposredno vključuje v sam proces nastajanja umetniških…
2017-04-24 10:00-11:00 FAMNIT-POŠTA Nastja Cepak (UP IAM & UP FAMNIT) Bent functions in C and D outside the completed Maiorana-McFarland class Two new classes of bent functions derived from the Maiorana-McFarland class, so-called C and D, were introduced by Carlet…
2017-04-10 10:00-11:00 FAMNIT-POŠTA Sanja Rukavina (University of Rijeka, Croatia) Quasi-symmetric designs derived from AG(3,4) Some connections between designs and codes will be discussed. Further, we present the enumeration of quasi-symmetric 2-(64,24,46) designs supported by the dual code C^{\perp} of the…
2017-04-03 10:00-11:00 FAMNIT-POŠTA Dean Crnković (University of Rijeka, Croatia) On some regular Hadamard matrices and related codes A Hadamard matrix of order m is a (m \times m) matrix H=( h_{i,j}), h_{i,j} \in \{ -1,1 \}, satisfying HH^T=H^TH=mI_m, where I_m…
2017-03-27 10:00-11:00 FAMNIT-POŠTA Slobodan Filipovski (UP IAM, UP FAMNIT) On bipartite cages of excess 4 The Moore bound M(k,g) is a lower bound on the order of k-regular graphs of girth g (denoted (k,g)-graphs). The excess e of a (k,g)-graph…
2017-03-24 9:30-10:30 FAMNIT-POŠTA Matthew Johnson (Durham University, England) Kempe equivalence in regular graphs Let G be a graph with a proper vertex colouring. Let a and b be two of the colours. Then a connected component of the subgraph induced…
2017-03-20 10:00-11:00 FAMNIT-POŠTA Daniel Paulusma (Durham University, England) Colouring Diamond-free Graphs The Colouring problem is that of deciding, given a graph G and an integer k, whether G admits a (proper) k-colouring. For all graphs H up to five vertices,…
2017-03-13 10:00-11:00 FAMNIT-POŠTA Tomaž Pisanski (University of Primorska) What have we learned from the visit of the President of the ERC in Slovenia? The aim of this talk is to analyze poor performance of Slovenia at the ERC grant calls.…