2015-11-30 10:00-11:00 FAMNIT-POSTA István Kovács (UP IAM, UP FAMNIT) Integral automorphisms of affine spaces over finite fields Let $GF(q)$ denote the finite field with $q$ elements, and let $S$ denote the set of all square elements of $GF(q)$. The norm…
2015-11-23 10:00-11:00 FAMNIT-POŠTA Robert Jajcay (UP FAMNIT and Comenius University (Slovakia)) k-regular families of automorphisms and generalized Cayley graphs Abstract: A family F of automorphisms of a vertex-transitive graph G is said to be k-regular if for every pair u,v…
2015-11-16 10:00-11:00 FAMNIT-POSTA Edin Husić Submodular functions In this talk we will give an overview of various aspects of submodular set functions. Several examples of submodular functions will be presented, including modular functions, polymatroid functions, and objective functions of various…
2015-11-09 10:00-11:00 FAMNIT-POSTA Martin Milanič (UP IAM, UP FAMNIT) 1-Sperner hypergraphs and new characterizations of threshold graphs A hypergraph is a pair (V,E) such that V is a finite set and E is a set of subsets of V (members…
2015-11-02 10:00 – 11:00 FAMNIT-POŠTA Štefko Miklavič (UP IAM, UP FAMNIT) Distance-regular cayley graphs In this talk we consider the following problem: for a given class of groups ${\cal G}$, classify distance-regular Cayley graphs $Cay(G;S)$, where $G \in {\cal G}$.
2015-10-26 11:00-12:00 Famnit-VP Wilfried Imrich (Department Mathematics and Information Technology, Montanuniversität Leoben, Austria) Symmetry breaking in graphs In a graph, a set of vertices that is stabilized setwise by only the trivial automorphism is called a distinguishing set. Tom Tucker…
2015-10-26 10:00-11:00 Famnit-VP Mats Gyllenberg (Finnish Centre of Excellence in Analysis and Dynamics Research, Department of Mathematics and Statistics, University of Helsinki) Finite dimensional state representation of nonlinear delay systems In this talk I give necessary and sufficient conditions for…
2015-10-19 10:00 – 11:00 FAMNIT-POSTA Dragan Marušič (UP FAMNIT, UP IAM) Odd automorphisms An automorphism (or symmetry) of a combinatorial graph may be called even or odd according to whether it acts as an even or odd permutation on the…
2015-10-12 10:00-11:00 FAMNIT-POSTA Stephen E. Wilson (UP IAM, UP FAMNIT) Operartors on Maniplexes (Part II) ‘Maniplex’ is a generalization of ‘polytope’ and is at the same time a generalization of ‘map’. We are interested in those which have large symmetry…
2015-10-05 10:00-11:00 FAMNIT-POSTA Stephen E. Wilson (UP IAM, UP FAMNIT) Operartors on Maniplexes ‘Maniplex’ is a generalization of ‘polytope’ and is at the same time a generalization of ‘map’. We are interested in those which have large symmetry groups, and…