2022-10-03 15:00 — 16:00 Famnit MP1 Russ Woodroofe (UP FAMNIT) The extensible No-Three-In-Line problem The classical No-Three-In-Line asks for the largest set of lattice points in the n by n grid that lie in general position; that is, so that…
2022-09-08 14:00 — 15:00 FAMNIT-VP1 Michel Lavrauw (Sabanci University, Turkey) Nets of conics over finite fields A conic in a projective plane is the zero locus of a quadratic form in F[X, Y, Z]. Linear systems of conics are subspaces…
2022-06-06 10:00 — 11:00 FAMNIT-MP1 Sadmir Kudin (UP Famnit, Slovenia) Relations between classes of bent functions and some results on correlation immunity In this talk we will consider the class membership problem for the secondary classes of bent functions C…
2022-05-30 10:00 — 11:00 FAMNIT-MP1 Žiga Velkavrh (UP FAMNIT, Slovenia) Indicators of human sociality in Slovenia and the Netherlands: Evidence from experiments with students In this talk we present the results of a cross-national research designed to detect differences/similarities in…
2022-05-25 15:00 — 16:00 FAMNIT-MP1 Wilfreid Meidl Z_p^k -bent functions To be announced. Everyone is welcome and encouraged to attend.
2022-05-19 18:00 – 19:00 ZOOM (See link below) Tomaž Pisanski, University of Primorska, Slovenia More questions than answers about nut graphs Singular graphs of nullity one admitting a full kernel eigenvector are called nut graphs. Nut graphs constitute a fascinating…
2022-05-16 10:00 — 11:00 ZOOM Ratko Darda (University of Osaka, Japan) On the number of rational points of varieties and stacks Manin-Peyre conjecture predicts the number of integral solutions of polynomial equations, i.e. the number of rational points on varieties.…
2022-05-19 12:30 — 13:30 FAMNIT-MP4 & ZOOM Vladimir Muller (Czech Academy of Sciences, Czech Republic) Matrices of operators Let $T$ be a linear operator on a separable infinite-dimensional Hilbert space $H$. Then $T$ allows for a variety of matrix representations…
2022-05-09 10:00 — 11:00 FAMNIT-MP1 Safet Penjić (UP IAM, Slovenia) A unified view of inequalities for distance-regular graphs In this talk, we introduce the language of a configuration and of t-point counts for distance-regular graphs (DRGs). Every t-point count can…