BEGIN:VCALENDAR PRODID:-//Department of Mathematics and Statistics//Events Calendar//EN VERSION:2.0 CALSCALE:GREGORIAN BEGIN:VEVENT DTSTAMP:20190527T032401Z DTSTART:20181213T183000Z DTEND:20181213T193000Z SUMMARY:Math Colloquium DESCRIPTION:Speaker: Nathan Johnston (Mount Allison University)\nTitle: The Minimal Superpermutation Problem\nAbstract: We discuss the open problem of finding the shortest string on n symbols that contains all permutations of those n symbols as contiguous substrings (for example\, in the n = 3 case the string ”123121321” contains each permutation of ”123” as a substring). We present the best known upper and lower bounds on the minimal length of such a string and discuss how those bounds have improved over time\, including recent advancements made by an anonymous poster on the ”4chan” internet forum as well as science fiction author Greg Egan.\n\nCost: No cost\n\nContact Information: LOCATION:Chase Building - Room 319 URL: UID: END:VEVENT END:VCALENDAR