2024-03-04 15:00 — 16:00 FAMNIT-MP1 Fabio Vlacci (University of Trieste) On a matrix representation of (hyper)complex numbers and functions We will present a recent approach on matrix representation of hypercomplex regular functions. This topic has been also considered independently by…
2024-02-27 14:00 — 15:00 FAMNIT-VP1 Joy Morris (University of Lethbridge, Canada) Detecting (Di)Graphical Regular Representations Graphical and Digraphical Regular Representations (GRRs and DRRs) are a concrete way to visualise the regular action of a group, using (di)graphs. More precisely, a…
2024-02-19 15:00 — 16:00 FAMNIT-VP1 Marko Orel (University of Primorska) Marko Orel In this talk, a graph Γ = (V, E) is a finite simple graph, which means that V is a finite set and E is a family of…
2024-01-15 15:00 — 16:00 FAMNIT-MP1 Hassan Cheraghpour (University of Primorska) Vanishing Immanants Let $ Q_{n}(CC) $ be the space of all $ ntimes n $ alternate matricesvover the complex field $ CC $ and let $ d_{chi}(A) $ denote the…
2024-01-08 15:00 — 16:00 FAMNIT-MP1 Franc Forstnerič (University of Ljubljana, Slovenia) Minimal surfaces with symmetries A minimal surface in a Euclidean space $mathbb R^n$ for $nge 3$ is an immersed surface which locally minimizes the area. Every oriented minimal surface…
2023-12-18 15:00 — 16:00 FAMNIT-MP1 Safet Penjić (University of Primorska, Slovenia) On combinatorial structure and algebraic characterizations of distance-regular digraphs Let G=G(A) denote a simple strongly connected digraph with vertex set X, diameter D, and let {A_0,A:=A_1,A_2,ldots,A_D} denote the set…
2023-12-11 15:00 — 16:00 Famnit MP1 Jean-Florent Raymond, CNRS, LIMOS, France Induced paths in sparse graphs Every induced path is a path, but the converse is not true. However in some classes of graphs (such as, for instance, planar graphs), the existence…
2023-11-20 14:00 — 15:00 FAMNIT-MP1 Nina Chiarelli (UP FAMNIT) Extendability of certain product graphs A graph G of even order is k-extendable if it has at least 2k+2 vertices, contains a matching of size k, and if every k-matching is…
2023-11-07 14:00 — 15:00 Zoom Blas Fernández (University of Primorska, Slovenia) Terwilliger algebras beyond distance-regular graphs: a combinatorial approach The Terwilliger algebra $T$ has been extensively studied in the context of distance-regular graphs, which have only a few irreducible $T$-modules…
2023-11-06 15:00 — 16:00 FAMNIT-MP1 Sebastian Wiederrecht (DIMAG, IBS, Daejeon, Korea) Structural Parametrizations of the Maximum Independent Set Problem Excluding a graph (or a family of graphs) under a fixed containment relation can yield graph classes with very particular properties.…