BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Mathematical Sciences - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Mathematical Sciences
X-ORIGINAL-URL:/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:20240310T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20241103T070000
END:STANDARD
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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20250425T123000
DTEND;TZID=America/Chicago:20250425T133000
DTSTAMP:20260418T222201
CREATED:20250423T131241Z
LAST-MODIFIED:20250423T131241Z
UID:10016223-1745584200-1745587800@uwm.edu
SUMMARY:Graduate Student Colloquium: Levi Montee
DESCRIPTION:Partitioning the Natural Numbers with Fibonacci-like Sequences\nLevi Montee\nGraduate Student\nUniversity of Wisconsin-Milwaukee \nFamously seen in the displacement of seeds in a sunflower\, the branching of tree limbs or enumerating results in a variety of combinatorics problems\, the Fibonacci sequence has become one of the most recognizable sequences in mathematics. Beginning f0 = 0\, f1 = 1\, and continuing fn+1 = fn + fn-1\, this simple recurrence relation has been well studied for centuries. In this talk\, we will investigate sequences determined by the same recurrence relation given alternative starting points. We attempt to classify these sequences\, see which familiar Fibonacci properties are kept intact\, and examine when two such sequences share terms. Ultimately\, we aim to find a set of disjoint Fibonacci-like sequences that partition the natural numbers\, and see how these might be useful in solving particular logic games/puzzles.
URL:/math/event/graduate-student-colloquium-levi-montee/
LOCATION:EMS Building\, Room E495\, E495; 3200 N Cramer St.\, Milwaukee\, WI\, 53211\, United States
CATEGORIES:Graduate Student Colloquia
ORGANIZER;CN="The Department of Mathematical Sciences":MAILTO:math-staff@uwm.edu
X-TRIBE-STATUS:
GEO:43.0758771;-87.8858312
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=EMS Building Room E495 E495; 3200 N Cramer St. Milwaukee WI 53211 United States;X-APPLE-RADIUS=500;X-TITLE=E495; 3200 N Cramer St.:geo:-87.8858312,43.0758771
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20250425T133000
DTEND;TZID=America/Chicago:20250425T143000
DTSTAMP:20260418T222201
CREATED:20250413T191318Z
LAST-MODIFIED:20250421T130410Z
UID:10016219-1745587800-1745591400@uwm.edu
SUMMARY:MS Thesis Defense: Mr. Jackson Thurmond
DESCRIPTION:Generalized Linear Model approach to the Prediction of the outcome of Mixed Martial Arts Fights\nMr. Jackson Thurmond\nGraduate Student\nUniversity of Wisconsin-Milwaukee \nMixed martial arts is a complex combat sport that encompasses striking\, grappling and submissions. In a sport where fights can be won by finishing a fight or go to decision there is a multitude of factors that can influence the outcome of a fight. In an effort to determine which factors are statistically significant to a fight a generalized linear model approach was selected. Since mixed martial arts is a sport in which two competitors fight\, and one is declared a winner\, the result of a fight can be thought of a binary classification problem. \nAdvisor:\nDavid Spade \nCommittee Members:\nDavid Spade\, Chao Zhu\, and Lijing Sun
URL:/math/event/ms-thesis-defense-mr-thurmund-jackson/
LOCATION:EMS Building\, Room E408\, E408; 3200 N Cramer St.\, Milwaukee\, WI\, 53211\, United States
CATEGORIES:Graduate Student Defenses
ORGANIZER;CN="The Department of Mathematical Sciences":MAILTO:math-staff@uwm.edu
X-TRIBE-STATUS:
GEO:43.0758771;-87.8858312
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=EMS Building Room E408 E408; 3200 N Cramer St. Milwaukee WI 53211 United States;X-APPLE-RADIUS=500;X-TITLE=E408; 3200 N Cramer St.:geo:-87.8858312,43.0758771
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20250425T140000
DTEND;TZID=America/Chicago:20250425T150000
DTSTAMP:20260418T222201
CREATED:20250113T161237Z
LAST-MODIFIED:20250421T135206Z
UID:10016200-1745589600-1745593200@uwm.edu
SUMMARY:Colloquium: Prof. Caroline Terry
DESCRIPTION:Measuring Combinatorial Complexity via Regularity Lemmas\nProf. Caroline Terry\nAssociate Professor\nUniversity of Illinois-Chicago \nMany tools have been developed in combinatorics to study global structure in finite graphs. One such tool is called Szemerédi’s regularity lemma\, which gives a structural decomposition for any large finite graph. Beginning with work of Alon-Fischer-Newman\, Lovász-Szegedy\, and Malliaris-Shelah\, it has been shown over the last 15 years that regularity lemmas can be used to detect structural dichotomies in graphs\, and that these dichotomies have deep connections to model theory. One striking example is a dichotomy in the size of regular partitions\, first observed by Alon-Fox-Zhao. Specifically\, if a hereditary graph property H has finite VC-dimension\, then results of Alon-Fischer-Newman and Lovász-Szegedy imply all graphs in H have regular partitions of size polynomial is 1/ε. On the other hand\, if H has infinite VC-dimension\, then results of Gowers and Fox-Lovász show there are graphs in H whose smallest 1/ε-regular partition has size at least an exponential tower of height polynomial in 1/ε. In this talk\, I present several analogous dichotomies in the setting of hereditary properties of 3-uniform hypergraphs.
URL:/math/event/colloquium-caroline-terry/
LOCATION:EMS Building\, E495\, 3200 N Cramer St\, Milwaukee\, WI\, United States
CATEGORIES:Colloquia
X-TRIBE-STATUS:canceled
END:VEVENT
END:VCALENDAR