Discrete Mathematics Group at URI
The faculty of our group is interested in a wide range of areas in discrete mathematics
both pure and applied: graph theory, network theory, extremal and probabilistic methods,
analytic methods, finite model theory, combinatorial games, combinatorial optimization,
bioinformatics applications.
Seminar
Our seminar is held Fridays 1-2pm in Lippitt 204.
Seminar archive.
Speaker | Noah M. Daniels, URI |
Title | From biology to astronomy: the shape of big data |
Time | Friday December 8, 2017, 1-2pm, Lippitt 204 |
News
Faculty and their research
Michael Barrus, graph theory
Nancy Eaton,
Associate Dean at the College of Arts and Sciences, graph theory
Barbara Kaskosz, analysis
and its applications to discrete mathematics
William Kinnersley,
graph theory and combinatorial games
Alexandr Kodess, algebraic combinatorics
Lubos Thoma, extremal and probabilistic combinatorics
Doctoral students
Jean Guillaume
John Jones
Eric Peterson
Graduate courses
MTH547 Combinatorics,
MTH548 Graph Theory,
MTH515/516 Algebra,
MTH550 Probability and Stochastic Processes,
MTH656 Probability on Discrete Structures,
CSC541 Advanced Topics in Algorithms,
CSC542 Mathematical Analysis of Algorithms,
CSC544 Theory of Computation,
Special topics courses in Extremal Graph Theory, Ramsey Theory, Algebraic Combinatorics.
Discrete mathematics nearby