BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260513T115257Z
UID:Seminar-ACTO-943@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Nikhil Mande:MAILTO:Nikhil.Mande@liverpool
DTSTART:20200805T140000
DTEND:20200805T150000
SUMMARY:Algorithms, Complexity Theory and Optimisation Series
DESCRIPTION:Duncan Adamson: Multidimensional Necklaces: Counting, Generation and Ranking\n\nCrystals are highly periodic structures, defined by a unit cell which periodically tiles an infinite three dimensional space. Due to this tiling of space, there are many functionally identical unit cells, most obviously those that are the same up to translation. To explore the space of possible unit cells within a discrete unit space it is necessary to capture these symmetries.\n\n\n\nIn a single dimension these symmetries can be easily captured by representing the unit cell as a necklace -lexicographically minimal representation of a cyclic strings- therefore it seems reasonable to generalise this structure to multiple dimensions. This talk will focus on the generalisation of several key results on one dimensional necklaces to the multidimensional case. These are the classical problem of counting, as well algorithms for the efficient generation and ranking of all necklaces.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=943
LOCATION:Online MT CSACTOO365Team
END:VEVENT
END:VCALENDAR