Math 503101 Page, Fall 2010This page concerns Math 503, Section 101, Winter 201011, term I (i.e., Fall 2010). This page has the most uptodate information on the course and supersedes any other document. This course will give an introduction to discrete mathematics. We will mostly follow the book by Laszlo Lovasz entitled Combinatorial Problems and Exercises. We are aiming to give a broad, general introduction to discrete mathematics (e.g., generating functions, inclusionexclusion and related sieves, graphs and connectivity, spectral graph theory); time permitting we shall cover a topic or two in more detail than covered in Lovasz. More details can be found in the following course outline. The course should be suitable to students in math and a number of mathematical disciplines (e.g., computer science, electrical engineering, physics, statistics). The grade will be based on homework and/or a project/essay and/or presentation, with the following rough meaning. The class will meet MW, 9:3010:50 in Auditorium Annex room 157. If you are interested in the course but cannot attend, please email me (jf at math dot ...).
