2014-01-27 10:00-11:00 FAMNIT-MP2 Samed Bajrić On Certain Construction Methods of Cryptographically Significant Boolean Functions
2014-01-13 10:00-11:00 FAMNIT-MP Ted Dobson (Mississippi State University, USA) On the Cayley Isomorphism Problem We show that if certain arithmetic conditions hold, then the Cayley isomorphism problem for abelian groups, all of whose Sylow subgroups are elementary abelian or cyclic,…
2014-01-06 10:00-11:00 FAMNIT-SEMINA Tomaž Pisanski Combinatorial configurations, quasiline arrangements and systems of curves on surfaces (part II) It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not admit even…
2013-12-23 10:00-11:00 FAMNIT-SEMIN Bojan Kuzma When Hadamard and usual powers coincide? We classify real matrices where the standard power coincides with the Hadamrad entry-wise. The problem appeared recently in vol 51 of IMAGE journal. Time permitting we will present some further problems from…
2013-12-16 10:00-11:00 FAMNIT-SEMIN Tomaž Pisanski Combinatorial configurations, quasiline arrangements and systems of curves on surfaces It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not admit even realizations with…
2013-12-09 10:00-11:00 FAMNIT-SEMIN Dr. Jicheng Ma Arc-transitive regular covers of cubic graphs In this talk, I will briefly remind you the two known approaches for classifying arc-transitive abelian or elementary abelian covering graphs. Also I’ll introduce some of my recent work…
2013-12-02 10:00-11:00 FAMNIT-POŠTA Sergio Hiroki Koike Quintanar On the isomorphism problem of cyclic Haar graphs
2013-11-25 10:00-11:00 FAMNIT-SEMIN prof. dr. Primož Potočnik (UL FMF and UP IAM) How many automorphisms can a graph have? The topic of the talk will be finite connected graphs admitting an automorphism group that acts transitively on the arcs of the…
2013-11-18 10:00-11:00 FAMNIT-SEMIN Ratko Darda Bounds on the Product Irregularity Strength of Graphs For a graph X with at most one isolated vertex and without isolated edges, a product irregular labeling, is a labeling of its edges with the values…
2013-11-11 10:00-11:00 FAMNIT-SEMIN Anja Komatar Second Neighbourhood Conjecture Second Neighbourhood Conjecture states that every oriented graph has a vertex with second neighbourhood at least as large as first. We show that if a counterexample exists, it has a large minimal…