Centre for Interdisciplinary Research in Computational Algebra (CIRCA) seminar

András Salamon will present The Slowest Sloth is Busy Beaver's Friend.

Abstract: I'll discuss recent work on variants of the Slowest Sloth function with Michael Wehar. The Slowest Sloth grows so slowly that no superconstant computable function is slower growing. Bounded versions of the Slowest Sloth are computable, yet when we compose them with the uncomputable Busy Beaver function, the resulting function grows at most linearly fast.

Struan McCartney will present New External Difference Families and Related Constructions from Graph Valuations.

Abstract: Digraph-defined external difference families were recently introduced as a natural generalization of several well-studied combinatorial objects motivated by information security. I will show various types of vertex-labelling for graphs and digraphs along with a blow up technique that can be used to create digraph-defined external difference families. Using these methods I will give a new infinite family of circular external difference families.

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