Centre for Interdisciplinary Research in Computational Algebra (CIRCA) seminar

Duncan Adamson will present Colouring Temporal Graphs.

Abstract: Temporal graphs are a generalisation of (static) graphs, representing networks that change over time via the addition and removal of edges. These graphs are comprised of a sequence of “snapshots”, static graphs defined over a common vertex set with a changing edge set. In this talk, we will talk about one generalisation of the well known colouring problem to temporal graphs, the “temporal recolouring problem”. This is a joint work with George B. Mertzios and Paul G. Spirakis, based on the paper “Maintaining Bipartite Colourings on Temporal Graphs on a Budget”, available here https://arxiv.org/abs/2511.20338.

Violeta Lopez Lopez will present Lines in a cubic surface: complex and real.

Abstract: This talk will be about algebraic cubic surfaces, i.e., solution sets of degree three polynomials in four variables. A classical result in Algebraic Geometry, due to Cayley and Salmon, states that every complex cubic surface contains exactly 27 lines. After a brief introduction, we will check the analogous result for cubic surfaces defined over the real numbers. The contents of this talk are based on my undergrad thesis.

Further details about this event, along with information about CIRCA, can be found on the CIRCA website https://circa.st-andrews.ac.uk