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:20230312T080000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:20231105T070000
END:STANDARD
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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20240301T123000
DTEND;TZID=America/Chicago:20240301T133000
DTSTAMP:20260422T200628
CREATED:20240226T151035Z
LAST-MODIFIED:20240226T151307Z
UID:10016146-1709296200-1709299800@uwm.edu
SUMMARY:Graduate Student Colloquium: Mr. John Museus
DESCRIPTION:Games\, Winning\, and Nimbers\nMr. John Museus\nPhD Student\nUniversity of Wisconsin – Milwaukee \nThe Nimbers are a particularly peculiar Field which arises naturally when studying the winning strategies of Impartial Games. In this talk\, we will give a brief overview of the constructions leading up to the Nimbers by studying three games: Nim\, Subtraction\, and Turning Corners. Along the way we will see what Tweedledee and Tweedledum have to do with winning games and give an airtight proof that 2 tims 2 is actually 3.
URL:/math/event/graduate-student-colloquium-mr-john-museus/
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:20240301T140000
DTEND;TZID=America/Chicago:20240301T150000
DTSTAMP:20260422T200628
CREATED:20240213T184338Z
LAST-MODIFIED:20240219T143038Z
UID:10016137-1709301600-1709305200@uwm.edu
SUMMARY:Colloquium : Dr. Selvi Kara
DESCRIPTION:Combinatorial Resolutions of Monomial Ideals\nDr. Selvi Kara\nAssistant Professor of Mathematics\nBryn Mawr College \nOne of the central problems in commutative algebra concerns understanding the structure of an ideal in a polynomial ring. Abstractly\, an ideal’s structure can be expressed through an object called its minimal resolution\, but there is no explicit method to obtain a minimal resolution in general\, even for the simpler and fundamental class known as monomial ideals. \nIn this talk\, we will focus on resolutions of monomial ideals. In particular\, I will introduce a new combinatorial method that provides a resolution of any monomial ideal using tools from discrete Morse theory.
URL:/math/event/colloquium-dr-selvi-kara/
LOCATION:EMS Building\, EMS E495\, 3200 Cramer St\, Milwaukee\, WI\, 53211\, 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:20240308T123000
DTEND;TZID=America/Chicago:20240308T133000
DTSTAMP:20260422T200628
CREATED:20240304T180710Z
LAST-MODIFIED:20240304T180849Z
UID:10016147-1709901000-1709904600@uwm.edu
SUMMARY:Graduate Student Colloquium: Dorian Smith
DESCRIPTION:Sandpile Group For Cones Over Trees\nDorian Smith\nPhD Student\nUniversity of Minnesota Twin Cities \nThe sandpile group $K(G)$ of a graph $G$ is a finite abelian group\, isomorphic to the cokernel of the reduced graph Laplacian of $G.$ We study $K(G)$ when $G = Cone(T)$. The graph $Cone(T)$ is obtained from a tree $T$ on $n$ vertices by attaching a new cone vertex attached to all other vertices. For two such families of graphs\, we will describe $K(G)$ exactly: the fan graphs $Cone(P_n)$ where $P_n$ is a path\, and the thagomizer graph $Cone(S_n)$ where $S_n$ is the star-shaped tree. The motivation is that these two families turn out to be extreme cases among $Cone(T)$ for all trees $T$ on $n$ vertices.
URL:/math/event/graduate-student-colloquium-dorian-smith/
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:20240308T140000
DTEND;TZID=America/Chicago:20240308T150000
DTSTAMP:20260422T200628
CREATED:20240213T184556Z
LAST-MODIFIED:20240229T211321Z
UID:10016138-1709906400-1709910000@uwm.edu
SUMMARY:Colloquium: Dr. Emmanuel Asante-Asamani
DESCRIPTION:A Mechanochemical Model of Cell Migration in Confined Environments\nDr. Emmanuel Asante-Asamani\nAssistant Professor of Mathematics\nClarkson University \nEukaryotic cells can move in confined environments by using pressure driven protrusions of their cell membrane\, a motility mechanism known as blebbing. Blebbing has been observed to facilitate the movement of tumor cells and some cancer cells during metastasis. Many questions remain unanswered about how cells translate mechanical cues from their environment into coordinated movement during blebbing. Of particular interest is how proteins that link the cell membrane to the cortex regulate the size and frequency of blebs under different levels of environmental confinement. In this talk\, I will present a multiscale model of bleb expansion that treats the cell as a viscous fluid encased by a viscoelastic boundary\, whose mechanical properties are regulated by dynamic structural and motor proteins. Numerical simulation of this model supports experimental data suggesting\, contrary to intuition\, that weakening the adhesion of the cell membrane to the cortex produces smaller and less frequent blebs.
URL:/math/event/colloquium-dr-emmanuel-asante-asamani/
LOCATION:EMS Building\, EMS E495\, 3200 Cramer St\, Milwaukee\, WI\, 53211\, 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:20240315T123000
DTEND;TZID=America/Chicago:20240315T133000
DTSTAMP:20260422T200628
CREATED:20240311T171530Z
LAST-MODIFIED:20240311T172157Z
UID:10016148-1710505800-1710509400@uwm.edu
SUMMARY:Graduate Student Colloquium: Dorian Smith
DESCRIPTION:On the Lucky and Displacement Statistics of Stirling Permutations\nDorian Smith\nPhD Student\nUniversity of Minnesota Twin Cities \nStirling permutations are parking functions. We investigate two parking function statistics in the context of these objects: lucky cars and displacement. Among our results\, we consider two extreme cases: extremely lucky Stirling permutations (those with maximally many lucky cars) and extremely unlucky Stirling permutations (those with exactly one lucky car). We show that the number of extremely lucky Stirling permutations of order n is the Catalan number\, and the number of extremely unlucky Stirling permutations is (n−1)!. \nThis is a joint work with Laura Colmenarejo\, Aleyah Dawkins\, Jennifer Elder\, Pamela E. Harris\, Kimberly J.Harry\, Selvi Kara\, and Bridget Eileen Tenner.
URL:/math/event/graduate-student-colloquium-dorian-smith-2/
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:20240315T140000
DTEND;TZID=America/Chicago:20240315T150000
DTSTAMP:20260422T200628
CREATED:20240213T184840Z
LAST-MODIFIED:20240311T132445Z
UID:10016141-1710511200-1710514800@uwm.edu
SUMMARY:Colloquium: Dr. Jean-Pierre Mutunguha
DESCRIPTION:The Dynamical view of Free-by-Cyclic Groups\nDr. Jean Pierre Mutanguha\nInstructor\nPrinceton \nFree-by-cyclic groups can be defined as mapping tori of free group automorphisms. I will discuss various dynamical properties of automorphisms that turn out to be group invariants of the corresponding free-by-cyclic groups (e.g. growth type). In particular\, certain dynamical hierarchical decompositions of an automorphism determine canonical hierarchical decompositions of its mapping torus.
URL:/math/event/colloquium-jean-pierre-mutunguha/
LOCATION:EMS Building\, EMS E495\, 3200 Cramer St\, Milwaukee\, WI\, 53211\, United States
CATEGORIES:Colloquia
ORGANIZER;CN="The Department of Mathematical Sciences":MAILTO:math-staff@uwm.edu
X-TRIBE-STATUS:
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20240317
DTEND;VALUE=DATE:20240324
DTSTAMP:20260422T200628
CREATED:20240213T184658Z
LAST-MODIFIED:20240213T184658Z
UID:10016139-1710633600-1711238399@uwm.edu
SUMMARY:Spring Break
DESCRIPTION:
URL:/math/event/spring-break/
X-TRIBE-STATUS:
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Chicago:20240329T123000
DTEND;TZID=America/Chicago:20240329T133000
DTSTAMP:20260422T200628
CREATED:20240325T150400Z
LAST-MODIFIED:20240325T150711Z
UID:10016151-1711715400-1711719000@uwm.edu
SUMMARY:Graduate Student Colloquium: Daniel Quigley
DESCRIPTION:A Primer on the Mathematics of Artificial Neural Networks\nDaniel Quigley\nPhD Student\nUniversity of Wisconsin-Milwaukee \nArtificial neural networks (ANNs\, or\, simply\, neural networks) are ubiquitous\, not least of all in the context of modern machine learning. This presentation is a primer on the mathematics that underlie the mechanics of relatively simple feedforward ANNs. A sketch of the proof for the universal approximation theorem is given\, which states that a (fully connected) ANN with at least one hidden layer (of a sufficient number of neurons)\, together with a non-linear activation function\, can approximate any continuous function on a compact set to arbitrary accuracy. This presentation contributes to the movement for providing mathematical explanations and descriptions of ANNs\, favoring a functional analytical and well-founded framework at the expense of algorithmic aspects of deep learning otherwise concerned with identifying the most suitable deep ANNs for specific applications.
URL:/math/event/graduate-student-colloquium-daniel-quigley/
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:20240329T140000
DTEND;TZID=America/Chicago:20240329T150000
DTSTAMP:20260422T200628
CREATED:20240319T161218Z
LAST-MODIFIED:20240319T161218Z
UID:10016149-1711720800-1711724400@uwm.edu
SUMMARY:Colloquium: Dr. Jay Pantone
DESCRIPTION:Experimental Methods in Combinatorics\nDr. Jay Pantone\nAssistant Professor of Mathematics\nMarquette University \nWhat number comes next in the sequence\n1\, 2\, 4\, 8\, 16\, 32\, … ? \nHow about\n1\, 2\, 3\, 5\, 8\, 13\, … ? \nOr maybe\n1\, 3\, 14\, 84\, 592\, 4659\, … ? \nMany questions in combinatorics have the form “How many objects are there that have size n and that satisfy certain properties?” For example\, there are n! permutations (rearrangements) of n distinct objects\, there are 2^n binary strings of length n\, and the number of sequences of n coin flips that never have two tails in a row is the nth Fibonacci number. The “counting sequence” of a set of objects is the sequence a_0\, a_1\, a_2\, …\, where a_n is the number of objects of size n. \nAs a result of theoretical advances and more powerful computers\, it is becoming common to be able to compute a large number of initial terms of the counting sequence of a set of objects that you’d like to study. From these initial terms\, can you guess future terms? Can you guess a formula for the nth term in the sequence? Can you guess the asymptotic behavior as n tends to infinity? \nRigorously\, you can prove basically nothing from just some known initial terms. But\, perhaps surprisingly\, there are several empirical techniques that can use these initial terms to shed some light on the nature of a sequence. \nAs we talk about two such techniques — automated conjecturing of generating functions\, and the method of differential approximation — we’ll exhibit their usefulness through a variety of combinatorial topics\, including chord diagrams\, permutation classes\, and inversion sequences.
URL:/math/event/colloquium-dr-jay-pantone/
LOCATION:EMS Building\, EMS E495\, 3200 Cramer St\, Milwaukee\, WI\, 53211\, United States
CATEGORIES:Colloquia
ORGANIZER;CN="The Department of Mathematical Sciences":MAILTO:math-staff@uwm.edu
X-TRIBE-STATUS:
END:VEVENT
END:VCALENDAR