Host Applied Mathematics Description Graph Fall-Colouring is the problem of partitioning a graph into independent dominating sets. Unlike typical graph-theoretic problems, this partition may not...
Date Change Host Applied Mathematics Speaker Radoslav Fulek Columbia University https://sites.google.com/site/fulekrado/ Description Abstract: The Hanani–Tutte theorem is a classical result proved for...
Host Applied Mathematics Description Abstract: Matroids are a mathematical structure that generalize the linear independence in vector spaces and acyclic subgraphs in graphs, and have been applied in...
Host Applied Mathematics & Data Science Speaker Sheldon Jacobson University of Illinois at Urbana-Champaign http://shj.cs.illinois.edu Biography Sheldon H. Jacobson is a Professor and Director of the...
Host Applied Mathematics Speaker Bridget Tenner DePaul University http://math.depaul.edu/bridget Description Abstract: Suppose that mathematician M has just proved theorem T. How is M to know if her...
Speaker Laura McLay University of Wisconsin at Madison https://directory.engr.wisc.edu/ie/faculty/mclay_laura/ Description Abstract: Covering models are used in a broad spectrum of applications. This...
Description In group testing we have a (large) set of items -- called population -- and a small subset of 'special' elements -- branded as 'defective' items. Our job is to identify the whole set of...
Description Graph fall-colouring is an intersection of graph colouring and graph domination, whereby we attempt to partition a graph into independent dominating sets. In this talk, we will see various...
Host Rob Ellis Speaker Gyorgy Turan University of Illinois-Chicago http://www.math.uic.edu/people/profile?netid=gyt Description A Horn formula in propositional logic is a set of rules of the form a,b...
Host Department of Applied Math Speaker F.R. McMorris Professor Emeritus, IIT www.iit.edu/directory/people/fr-mcmorris Description The problem of aggregating the individual preferences of a group of...
