Department of

# Mathematics

Seminar Calendar
for events the day of Friday, October 4, 2019.

.
events for the
events containing

Questions regarding events or the calendar should be directed to Tori Corkery.
    September 2019          October 2019          November 2019
Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa
1  2  3  4  5  6  7          1  2  3  4  5                   1  2
8  9 10 11 12 13 14    6  7  8  9 10 11 12    3  4  5  6  7  8  9
15 16 17 18 19 20 21   13 14 15 16 17 18 19   10 11 12 13 14 15 16
22 23 24 25 26 27 28   20 21 22 23 24 25 26   17 18 19 20 21 22 23
29 30                  27 28 29 30 31         24 25 26 27 28 29 30



Friday, October 4, 2019

2:00 pm in 347 Altgeld Hall,Friday, October 4, 2019

###### See seminar site

Abstract: See seminar site.

3:00 pm in 341 Altgeld Hall,Friday, October 4, 2019

#### A sharp eigenvalue inequality for signed graph Laplacians

###### Derek Kielty (UIUC Math)

Abstract: Abstract: The collection of eigenvalues of a graph Laplacian matrix carries information about the topology the graph. Graph Laplacians are also closely related to discretizations of the Laplacian differential operator. Signed graph Laplacians are a generalization that encode attractions or repulsions between the vertices of a graph by assigning weights to the edges of the graph. In this talk I give an introduction to graph Laplacians and will discuss a sharp inequality on the eigenvalues of signed graph Laplacians (based on joint work with Ikemefuna Agbanusi and Jared Bronski).

4:00 pm in 347 Altgeld Hall,Friday, October 4, 2019

#### Error Correcting Codes

###### Aubrey Laskowski   [email] (UIUC Math)

Abstract: Error correcting codes (ECCs) are some of the core connecting components between coding theory and information theory, and much of modern communication involves some aspect of an ECC - from CDs to Amazon Web Services and even to space missions. ECCs provide the ability to decode information from noise channels by providing a small amount of redundant data. I will discuss the history of ECCs, as well as specific codes such as Hamming codes and Reed Solomon codes. Important parameters of ECCs as a historical perspective will be discussed and, time permitting, I will introduce how ECCs connect to machine learning. For the history, no specific background is assumed, but linear and abstract algebra will likely be usful for other aspects of the talk.

4:00 pm in 345 Altgeld Hall,Friday, October 4, 2019

#### O-minimal complex analysis according to Peterzil–Starchenko (Part 2)

###### Lou van den Dries (UIUC)

Abstract: This is the first of two survey talks on the subject of the title. Neer (and others?) will follow up with a more detailed treatment in later talks. O-minimal complex analysis is one way that ideas from o-minimality have been used in recent work in arithmetic algebraic geometry (Pila, Zannier, Tsimerman, Klingler,…), the other one being the Pila–Wilkie theorem. The two topics relate because important objects like the family of Weierstrass p-functions turn out to be "o-minimal".

4:00 pm in TBD,Friday, October 4, 2019

#### Graduate Research Opportunities for Women

Abstract: The GROW 2019 conference is aimed at female-identified undergraduate students who may be interested in pursuing a graduate degree in mathematics. The conference is open to undergraduates from all around the U.S.