Finite State Machines and Bounded Permutations Eric Redmon Graduate Student Marquette University We define a k-bounded permutation π of length n to be a permutation such that for each pair of adjacent entries $\pi$ and $\pi(i + 1)$ for $i …
A q-analog of Kostant's Weight Multiplicity Formula and a Product of Fibonacci Numbers Kim Harry PhD Graduate Student University of Wisconsin-Milwaukee Using Kostant’s weight multiplicity formula, we describe and enumerate the terms contributing a nonzero value to the multiplicity of …
Blowup of the Nonlinear Klein-Gordon Equation in FLRW Spacetimes Gregory Mwamba Graduate Student University of California - Merced The nonlinear Klein-Gordon equations are a class of important evolution equations that describe the movement of spinless relativistic particles, which can lend …
Combinatorial Models for Some Generalized McMullen Maps in the Case of Two Bounded Critical Orbits Kelsey Brouwer PhD Student University of Wisconsin - Milwaukee The family of generalized McMullen maps R(z)= z^n + b + a/z^n has two independent critical …
(t,r) Broadcast Domination of the Truncated Square Tiling Graph Jillian Cervantes Graduate Student University of Wisconsin - Milwaukee This talk will introduce graph domination theory and a generalization called (t,r) broadcast domination. We study a family of graphs that arise …
Kohnert Properties of Northeast Diagrams Alexander Moon Graduate Student University of Wisconsin - Milwaukee Kohnert polynomials and posets are combinatorial objects with deep representation theoretic meaning, generalizing both Schubert polynomials and Demazure characters, i.e., key polynomials. In this talk I …
Introduction to (Partial) Z-Boundaries Joe Paulson PhD Graduate Student University of Wisconsin - Milwaukee In this talk, I'll share an abridged story of Z-boundaries and their utility in group theory. Throughout, we'll revisit some main characters (compactifications, homotopy groups, group …
On the Lucky Sets of Fubini Rankings Melissa Beerbower Loyola University Chicago Recall that Fubini rankings of length n are rankings of n competitors allowing for ties. We can say that the number of rankings, k, with k less than …
Counting Orbits of Defective Parking Functions Alex Moon PhD Student University of Wisconsin-Milwaukee Parking functions are well-studied objects in combinatorics and representation theory which constitute tuples of preferred parking spots for cars under a linear parking scheme. This talk will …
Harmonize your Fractals Matt McClinton Graduate Student University of Wisconsin-Milwaukee The Sierpinski Gasket (SG) is a known fractal object. A simple observation shows that SG is path connected. Unfortunately, the infinitely jagged structure of the Gasket prevents these paths from …