2018-11-28 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Siamak Yassemi (University of Tehran and Institute for Research in Fundamental Sciences, Iran) Castelnuovo – Mumford regularity of edge ideal of graphs Let G be a graph with n vertices, S=\mathbb{K}[x_1,\dots,x_n] be the polynomial ring…
We are happy and honored to announce that our professor and researcher Assoc. Prof. Andreja Kutnar, PhD received the Zois Certificate of Recognition for important achievements in scientific research work in the field of wood science. Zois Awards and Recognitions…
UP FAMNIT and UP IAM are happy to announce that the European Mathematical Society – EMS will provide financial support for the 9th PhD Summer School in Discrete Mathematics. The generous contribution to the organisation of the Summer School is…
The 8th European Congress of Mathematics is under the honorary patronage of His Excellency Mr. Borut Pahor, President of the Republic of Slovenia We are especially honoured that the 8th European Congress of Mathematics is…
2018-11-19 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Ted Dobson (University of Primorska) On Automorphisms of Haar graphs of Abelian Groups Let G be a group and S\subseteq G. A Haar graph of G with connection set S has vertex set \Z_2\times G…
2018-11-12 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Martin Raič (UL FMF and UP FAMNIT) Central limit theorem and the Slepian-Stein method Roughly speaking, the celebrated central limit theorem says that a sum of many small independent random variables with sufficiently nice distributions…
UP IAM Department of Mathematics has recently obtained new funds through a public tender for co-financing scientific research cooperation between Slovenia and USA until September 2020. This means that in the next two years our researchers will strengthen the existing…
2018-11-05 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Tomaž Pisanski (University of Primorska) A new generalization of generalized Petersen graphs We discuss a new family of cubic graphs, which we call $SGP$-graphs, that bears a close resemblance to the family of generalized Petersen…
2018-10-29 10:00-11:00 FAMNIT-MP7 (formerly FAMNIT-POŠTA) Nevena Pivač (UP IAM) On the End-Vertex Problem For a given graph search algorithm and a graph G, a vertex v is said to be an end-vertex if there exists a corresponding search ordering of…