Discrete Math Seminar Fall 2009

Department of Mathematics
University of Nebraska-Lincoln

Meeting Time: Tuesdays 2:00-2:50pm in 351 Avery Hall

Seminar Coordinator: Christine Kelley

We have a mailing list for posting and archiving announcements.
List of other math dept seminars. Talks from 2008-2009.

Talks

Aug 25: Christine Kelley, Organizational meeting/ a graph-theoretic approach to designing hash functions (abstract)
Sept 1: Tyler Seacrest, A packing problem and a potential packing problem (abstract)
Sept 8: Stephen Hartke, Packings of degree sequences (abstract)
Sept 15: Katie Johnson, Counting Lower Hessenberg Matrices (abstract)
Sept 22: Andrew Ray, Festoon Trees (abstract)
Sept 29: Katie Morrison, Error-correction coding for an operator channel: Combinatorial bounds on the trade-off between the size of these codes and their minimum distance (abstract)
Oct 6: Katie Morrison, Error-correction coding for an operator channel (Part II): Combinatorial bounds on the trade-off between the size of these codes and their minimum distance (abstract)
Oct 13: Jamie Radcliffe, Extremal graphs for the number of k-colourings (abstract)
Oct 20: Fall break, no seminar.
Oct 27: No seminar.
Nov 3: Carina Curto, Geometry of stable cliques in neural networks (abstract)
Nov 10: Stephen Hartke, The Gallai-Edmonds theorem (abstract)
Nov 17: Judy Walker, Codes on Graphs: Shannon's Challenge and Beyond (abstract).
Nov 24: No seminar.
Dec 1: Jamie Radcliffe
Dec 8: Pascal Vontobel, Hewlett-Packard , Connections between the edge zeta function of a graph, counting in graph covers, and message-passing iterative decoding (abstract).

This page last modified December 2, 2009.