BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability seminar
SUMMARY:Structured Decompositions: recursive data and recu
rsive algorithms - Benjamin Bumpus\, Glasgow
DTSTART:20221208T150000Z
DTEND:20221208T160000Z
UID:TALK5084AT
URL:/talk/index/5084
DESCRIPTION:What is recursive structure? And how can we exploi
t it algorithmically? \nIn this talk I will give a
s general an answer as I can to these questions by
calling upon the new notion of structured decompo
sitions. This is a category-theoretic formalism th
at Jade Master\, Zoltan Kocsis and I recently intr
oduced which yields a vast generalisation of tree-
width to arbitrary categories. I will explain — as
suming no prior knowledge at all of category theor
y — how to make use of structured decompositions f
or three purposes: (1) defining new tree-width-lik
e invariants\, (2) relating these decompositions t
o each-other via functors and (3) how one might go
about proving algorithmic meta-theorems using the
language of category theory. \nThis is ongoing\,
multidisciplinary work. As such it requires lots p
eople with different types of expertise\, so you s
hould consider this talk is an invitation to get i
nvolved!
LOCATION:LTC
CONTACT:Johannes Carmesin
END:VEVENT
END:VCALENDAR