BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Mathematical Sciences - ECPv6.17.4.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Mathematical Sciences
X-ORIGINAL-URL:https://uwm.edu/math
X-WR-CALDESC:Events for Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20250309T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20251102T070000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20260308T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20261101T070000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:20270314T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20271107T070000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20260925T140000
DTEND;TZID=America/Chicago:20260925T150000
DTSTAMP:20260922T005826Z
CREATED:20260922T005826Z
LAST-MODIFIED:20260922T005826Z
UID:10016322-1790344800-1790348400@uwm.edu
SUMMARY:Colloquium: Dr. Nicholas Mayers
DESCRIPTION:The combinatorics of seaweed algebras\nSeaweed algebras form a class of Lie algebras for which a number of algebraic invariants can be computed combinatorially. One such invariant is the index\, an important algebraic invariant which is notoriously difficult to compute. Defining seaweed algebras originally as subalgebras of gl(n)\, Dergachev and Kirillov found that their index could be computed combinatorially by counting paths and cycles in a corresponding planar graph called a meander. Since then\, the notion of a seaweed algebra has been extended to the classical Lie algebras (types A\, B\, C\, and D)\, and the likewise extended notion of their associated meanders have been shown to hold much algebraic information. The goal of this talk is to give a tour of these combinatorial results over both gl(n) as well as the classical types. No prior knowledge is necessary for this talk. Open problems will be sprinkled throughout.\n\nFor more information:\nhttps://sites.google.com/view/nmayers?pli=1&authuser=0\n 
URL:https://uwm.edu/math/event/colloquium-dr-nicholas-mayers/
LOCATION:EMS Building\, E495\, 3200 N Cramer St\, Milwaukee\, WI\, United States
CATEGORIES:Colloquia
ORGANIZER;CN="The Department of Mathematical Sciences":MAILTO:math-staff@uwm.edu
X-TRIBE-STATUS:
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20261002T140000
DTEND;TZID=America/Chicago:20261002T150000
DTSTAMP:20260924T185447Z
CREATED:20260924T185447Z
LAST-MODIFIED:20260924T185447Z
UID:10016325-1790949600-1790953200@uwm.edu
SUMMARY:Colloquium: Dr. Jonah Gaster
DESCRIPTION:SIMPLE CLOSED GEODESICS ON HYPERBOLIC\nSURFACES\nMany of the 21st century spectacular advances in geometry and topology involve the study of simple closed geodesics on hyperbolic surfaces (Thurston\, Mirzakhani\, etc). I will tell you about one difficult little aspect of this story that I’ve been thinking about recently: How many simple closed geodesics on a hyperbolic surface may have precisely the same length? I will sketch some of the background ideas that indicate why this question is deep\, and related to other things that sound like they have nothing to do with hyperbolic geometry (like modular curves\, Diophantine approximation\, and solutions to polynomial equations).\n  \n 
URL:https://uwm.edu/math/event/colloquium-dr-jonah-gaster/
LOCATION:EMS Building\, E495\, 3200 N Cramer St\, Milwaukee\, WI\, United States
CATEGORIES:Colloquia
ORGANIZER;CN="The Department of Mathematical Sciences":MAILTO:math-staff@uwm.edu
X-TRIBE-STATUS:
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20261009T140000
DTEND;TZID=America/Chicago:20261009T150000
DTSTAMP:20260924T182118Z
CREATED:20260924T182118Z
LAST-MODIFIED:20260924T182118Z
UID:10016323-1791554400-1791558000@uwm.edu
SUMMARY:Colloquium: Prof. José Luis Ramírez
DESCRIPTION:From Polyominoes to Fibonacci and Catalan Numbers\nPolyominoes are simple geometric objects that lead to many interesting and sometimes surprisingly difficult problems in discrete mathematics and theoretical computer science. In this talk\, I will introduce polyominoes and discuss two classical questions: tiling problems and the enumeration of polyominoes. I will then focus on a recent family of staircase polyominoes that leads to unexpected connections with two of my favorite integer sequences: the Fibonacci and Catalan numbers. If time permits\, I will conclude with some open problems and possible directions for further research.\n\nCheck here for more information!\n  \n  \n 
URL:https://uwm.edu/math/event/colloquium-prof-jose-luis-ramirez/
LOCATION:EMS Building\, E495\, 3200 N Cramer St\, Milwaukee\, WI\, United States
CATEGORIES:Colloquia
ORGANIZER;CN="The Department of Mathematical Sciences":MAILTO:math-staff@uwm.edu
X-TRIBE-STATUS:
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20261016T140000
DTEND;TZID=America/Chicago:20261016T150000
DTSTAMP:20260924T192113Z
CREATED:20260924T183125Z
LAST-MODIFIED:20260924T192113Z
UID:10016324-1792159200-1792162800@uwm.edu
SUMMARY:Colloquium: Dr. Christine Cheng
DESCRIPTION:Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings\nAn instance of the Stable Roommates (SR) problem consists of 2n agents\, each with a preference\nlist that linearly orders the other agents. The goal is to find a perfect matching that is stable – one\nwith no pair of agents who mutually prefer each other to their assigned partners. In this talk\, I\nconsider the problem of finding an optimal stable matching. An efficient algorithm exists for Stable Marriage (SM) instances\, the bipartite version\, but the problem is NP-hard for SR instances. I will sketch a solution showing how an optimal stable matching for an SR instance can be obtained by “covering” it with SM instances.\nIn particular\, the closer the SR instance is to an SM instance\, the more efficient is the solution.\n\nCheck here for more information!\n  \n  \n 
URL:https://uwm.edu/math/event/colloquium-dr-christine-cheng/
LOCATION:EMS Building\, E495\, 3200 N Cramer St\, Milwaukee\, WI\, United States
CATEGORIES:Colloquia
ORGANIZER;CN="The Department of Mathematical Sciences":MAILTO:math-staff@uwm.edu
X-TRIBE-STATUS:
END:VEVENT
END:VCALENDAR