Organizational meeting/ a graph-theoretic approach to designing hash functions
(abstract)
This will primarily be an organizational meeting of the discrete math seminar for the year, and also give us the opportunity to meet the new graduate students interested in discrete math. Following this, we will introduce cyptographic hash functions and a graph-theoretic design strategy for these functions.
Aug 26: Organization; Stephen Hartke, Two short beautiful proofs: the number of degree sequences of forests on n vertices and extending perfect matchings in the hypercube to hamiltonian cycles.
Sept 2: Christine Kelley, the Hirsch conjecture and 0/1 polytopes (abstract)
Sept 9: Stephen Hartke, the second short beautiful proof: extending perfect matchings in the hypercube to hamiltonian cycles.
Sept 16: Brian Kell, partial cubes
Sept 23: Brian Kell, partial cubes, continued.
Sept 30: Nate Axvig, Some Aspects of Cycle Codes. (abstract)
Fri Oct 3: Mike Ferrara will be speaking in the colloquium about Some Problems on Graph Subdivisions. (abstract)
Oct 7: Nate Axvig, cycle codes, continued.
Oct 14: Katie Morrison, an introduction to network coding. (abstract)
Oct 21: Fall break, no seminar.
Oct 28: Katie Morrison, network coding, continued.
Nov 4: Jamie Radcliffe, Entropy methods for estimating the number of perfect matchings in graphs. (abstract)
Nov 11: Stephen Hartke, counting perfect matchings in planar graphs.
Nov 18: Derek Boeckner, higher correlation inequalities. (abstract)
Nov 25: Abby Brackins, derivation of the uncertainty function. (abstract)
Dec 2: Katie Haymaker, On optimal instantaneous codes: A look at Huffman coding. (abstract)
Fri Dec 5: Christine Kelley will be speaking in the colloquium about algebraic constructions of codes using voltage graphs. (abstract)
Dec 9: Cancelled.