Department of

Mathematics


Seminar Calendar
for events the day of Tuesday, February 11, 2020.

     .
events for the
events containing  

(Requires a password.)
More information on this calendar program is available.
Questions regarding events or the calendar should be directed to Tori Corkery. 
     January 2020          February 2020            March 2020     
 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                      1    1  2  3  4  5  6  7
  5  6  7  8  9 10 11    2  3  4  5  6  7  8    8  9 10 11 12 13 14
 12 13 14 15 16 17 18    9 10 11 12 13 14 15   15 16 17 18 19 20 21
 19 20 21 22 23 24 25   16 17 18 19 20 21 22   22 23 24 25 26 27 28
 26 27 28 29 30 31      23 24 25 26 27 28 29   29 30 31

Tuesday, February 11, 2020

11:00 am in 243 Altgeld Hall,Tuesday, February 11, 2020
Topology Seminar

Vanishing and Realizability

Shane Clark (University of Kentucky)

Abstract: The Reidemeister trace of an endomorphism of a CW complex is a lower bound for the number of fixed points (up to homotopy) of that endomorphism. For an endomorphism $f$, the Reidemeister trace of $f^n$ is a lower bound for the number of fixed points of $f^n$, however it can be a far from an optimal lower bound. One method of addressing this discrepancy constructs an equivariant map, the n^{th} Fuller trace $f$, which carries information about the periodic points of a map $f$. However, we must ask how much information is retained by this equivariant construction? In this talk we show that the n^{th} Fuller trace of $f$ is a complete invariant for describing a minimum set of periodic points for maps of tori.

Submitted by dculver
1:00 pm in 241 Altgeld Hall,Tuesday, February 11, 2020
Logic Seminar

The Borel complexity of quotient groups

Joshua Frisch (Caltech Math)

Abstract: The theory of Borel equivalence relations gives us rigorous methods to says when one classification problem/equivalence relation is more "complicated" than another. Given a countable group it's outer-automorphism group naturally has the structure of a borel equivalence relation. Motivated by this example, in this talk I will give a brief introduction to the theory of countable borel equivalence relations, describe some previously known connections with the theory of groups and, finally, describe a new new result explaining exactly how complicated the Borel complexity of quotient groups (which generalize outer-automorphism groups) can be. This is joint work with Forte Shinko.

Submitted by anush
2:00 pm in 243 Altgeld Hall,Tuesday, February 11, 2020
Graph Theory and Combinatorics Seminar

Large triangle packings and Tuza's conjecture in random graphs

Patrick Bennett (Western Michigan University)

Abstract: The triangle packing number $\nu(G)$ of a graph $G$ is the maximum size of a set of edge-disjoint triangles in $G$. Tuza conjectured that in any graph $G$ there exists a set of at most $2\nu(G)$ edges intersecting every triangle in $G$. We show that Tuza's conjecture holds in the random graph $G=G(n,m)$, when $m \le 0.2403n^{3/2}$ or $m\ge 2.1243n^{3/2}$. This is done by analyzing a greedy algorithm for finding large triangle packings in random graphs.

Submitted by SEnglish