Category: Seminars

  • Graded dihedral axial algebras

    Graded dihedral axial algebras

    2019-12-02 10:00 — 11:00 FAMNIT-MP1 Madeleine Whybrow (UP FAMNIT) Graded dihedral axial algebras Axial algebras are non-associative algebras generated by semisimple idempotents, known as axes, whose eigenvectors obey a given […]

  • Generalised voltage graphs.

    Generalised voltage graphs.

    2019-11-25 10:00 — 11:00 FAMNIT-MP1 Micael Toledo (IMFM – UP FAMNIT, Slovenia) Generalised voltage graphs. Given a graph X and a group G we may construct a covering graph Cov(X,Z) […]

  • Modules over axial algebras

    Modules over axial algebras

    2019-11-18 10:00 — 11:00 FAMNIT-MP1 Michiel Van Couwenberghe (Ghent University, Belgium). Modules over axial algebras Axial algebras are a recently defined type of nonassociative algebras. They are primarily used to […]

  • Shellings of polytopes and matroid independence complexes.

    Shellings of polytopes and matroid independence complexes.

    2019-11-11 10:00 — 11:00 FAMNIT-MP1 Jose Alejandro Samper (MPI-MIS Leipzig, Germany) Shellings of polytopes and matroid independence complexes. Matroids are combinatorial objects designed to capture essential features of the notion […]

  • Bipartite Biregular Cages and Block Designs

    Bipartite Biregular Cages and Block Designs

    2019-11-04 10:00 — 11:00 FAMNIT–MP1 Robert Jajcay (Comenius University, Bratislava, Slovakia) Bipartite Biregular Cages and Block Designs A bipartite biregular (n,m;g)-graph G is a bipartite graph of even girth g […]

  • A dichotomy for tame graph classes defined by small forbidden induced subgraphs

    A dichotomy for tame graph classes defined by small forbidden induced subgraphs

    2019-10-28 10:00 — 11:00 FAMNIT-MP1 Nevena Pivač (UP FAMNIT – UP IAM) A dichotomy for tame graph classes defined by small forbidden induced subgraphs Given a graph G, a minimal […]

  • Recognizing vertex-transitive graphs which are wreath products

    Recognizing vertex-transitive graphs which are wreath products

    2019-10-14 10:00 — 11:00 FAMNIT-MP1 Ted Dobson (UP FAMNIT) Recognizing vertex-transitive graphs which are wreath products It is known that a Cayley digraph Cay(A, S) of an abelian group A […]

  • Start Experiencing 8ECM

    Start Experiencing 8ECM

    2019-10-08 11:15–15:00 FAMNIT-VP1 Martin R Bridson, Maria J. Esteban and Volker Mehrmann Start Experiencing 8ECM 11:15 – 12:00: FAMNIT-VP1 Lecturer: Martin R Bridson FRS, 8ECM Prize Committee Chair (University of Oxford) […]

  • Asymmetric Colourings of Infinite Graphs

    Asymmetric Colourings of Infinite Graphs

    2019-10-18 10:00–11:00 FAMNIT-MP1 Monika Pilśniak (AGH University, Poland) Asymmetric Colourings of Infinite Graphs A colouring of a graph G is called asymmetric if the identity is the only auto-morphism preserving […]

  • Between proper and strong edge-colorings

    Between proper and strong edge-colorings

    2019-09-30 10:00–11:00 FAMNIT-MP1 Borut Lužar (Fakulteta za informacijske študije v Novem mestu) Between proper and strong edge-colorings In the talk, we will discuss edge-colorings of (sub)cubic graphs. Namely, we will […]