Close Menu

Events

Upcoming Events

Stephan Sturm - Department of Mathematical Sciences, Worcester Polytechnic Institute
Mar 27, 2017 - 1:50pm to 2:55pm
Department of Applied Mathematics - Colloquia - Rettaliata Engineering, Room 104
TBA
Mon.
Mar 27
Aaron Luttman - Nevada National Security Site, US Department of Defense
Mar 29, 2017 - 1:50pm to 2:55pm
Department of Applied Mathematics - Colloquia - Rettaliata Engineering, Room 104
TBA
Wed.
Mar 29
Jean-Christophe Nave - Department of Mathematics and Statistics, McGill University
Apr 17, 2017 - 1:50pm to 2:55pm
Department of Applied Mathematics - Colloquia - Rettaliata Engineering, Room 104
TBA
Mon.
Apr 17

Event Archive

Benjamin Reiniger - Department of Applied Mathematics, Illinois Institute of Technology
Feb 15, 2017 - 12:45pm to 1:45pm
Department of Applied Mathematics - Seminar - Rettaliata Engineering, Room 106
The game of Cops and Robbers involves a team of cops trying to catch a single robber on a graph \(G\). The players alternate turns moving along edges of \(G\). The speaker will first survey some of the major theorems and conjectures concerning the cop number of graphs, i.e., the... read more
Wed.
2/15/17
Marcin Pitera - Institute of Mathematics, Jagiellonian University
Feb 13, 2017 - 1:50pm to 2:55pm
Department of Applied Mathematics - Colloquia - Rettaliata Engineering, Room 104
The estimation of risk measures recently gained a lot of attention, partly because of the backtesting issues of Expected Shortfall related to elicitability. In this talk, the speaker will discuss the optimal estimation procedures in terms of bias and relate them to backtesting. The... read more
Mon.
2/13/17
Ruth Luo - Department of Mathematics, University of Illinois at Urbana-Champaign
Feb 10, 2017 - 12:45pm to 1:45pm
Department of Applied Mathematics - Seminar - Rettaliata Engineering, Room 119
The Erdős-Gallai Theorem states that for \(k\geq 3\) every graph on \(n\) vertices with more than \((k-1)(n-1)/2\) edges contains a cycle of length at least \(k\). Kopylov proved a strengthening of this result for 2-connected graphs with extremal examples \(H_{n,k,t}\) and \(H_{n,k,2}\). ... read more
Fri.
2/10/17

Pages