Upcoming Seminars

There are currently no events to display.

Past Seminars

GAUSS Seminar: Puzzles, Ice, & Grothendieck Polynomials [hybrid] promotional image

GAUSS Seminar: Puzzles, Ice, & Grothendieck Polynomials [hybrid]

Tuesday, October 5, 2021 3:30pm to 4:20pm
Schaeffer Hall
Abstract

We introduce quivers, path algebras and their representations. Then, in the case when our ground field is algebraically closed, we discuss a particular Morita invariant of path algebras arising from finite quivers, the Ext quiver of the category. Through examples we see how to compute the Ext quiver using quiver representations and techniques from linear algebra. We aim to keep the talk accessible to undergraduate and graduate students alike.

Speaker

Ryan Bianconi UI Mathematics PhD...

GAUSS Seminar: Puzzles, Ice, & Grothendieck Polynomials promotional image

GAUSS Seminar: Puzzles, Ice, & Grothendieck Polynomials

Tuesday, September 21, 2021 3:30pm to 4:20pm
Schaeffer Hall
Abstract

From a summer REU at the University of Minnesota, we constructed a solvable lattice model for the dual weak symmetric Grothendieck polynomials in hopes of using such a model to prove related properties of these polynomials, including Cauchy identities and branching rules. We also considered a similar lattice model construction for the weak symmetric Grothendieck polynomials in hopes of proving a Cauchy identity, concluding with a negative result. Moreover, we expand on previous work by...

GAUSS Seminar: Rotation Symmetric Boolean Functions and its Matrix promotional image

GAUSS Seminar: Rotation Symmetric Boolean Functions and its Matrix

Tuesday, September 14, 2021 3:30pm to 4:20pm
Schaeffer Hall
Abstract

Digital signatures are an important feature in any encryption/decryption scheme, as it provides a message with integrity, authenticity, and nonrepudiation. The problem occurs when long messages are being exchanged and signatures that are just as long need to be verified. By using hash functions, a ”fingerprint” of the message can be used instead of the message itself for verification, making the process computationally inexpensive. If we consider a single iteration of a general hashing...

Colloquium - Diderot: A Parallel Domain-Specific Language for Image Analysis and Visualization promotional image

Colloquium - Diderot: A Parallel Domain-Specific Language for Image Analysis and Visualization

Friday, September 10, 2021 4:00pm to 5:00pm
MacLean Hall
Speaker

John Reppy

Abstract

The analysis of structure in three-dimensional images is increasingly valuable for biomedical research and computational science.  At the same time, the computational burden of processing images is increasing as devices produce images of higher resolution (e.g., typical CT scans have gone from 128^3 to roughly 512^3 resolutions).  With the latest scanning technologies, it is also more common for the values measured at each sample to be multi-dimensional rather than...

GAUSS Seminar: Mathematics and Redistricting promotional image

GAUSS Seminar: Mathematics and Redistricting

Tuesday, September 7, 2021 3:30pm to 4:20pm
Schaeffer Hall
What we know, what we don't, and where we're going

Every ten years, the Census Bureau conducts the Census, a nation-wide tallying of every single individual living in the United States. In addition to helping governments and researchers manage land, understand population trends, and distribute resources, the Census is essential to a key democratic function: drawing electoral districts. The process of drawing electoral districts, called “redistricting,” divides every state in the United States...