The course has been scheduled for M,W, 2-3:15 pm. Room MS 2.02.48 (1604 campus). Brief descriptionCombinatorics is the backbone of finite mathematics and one of the most important tools for analytical problem-solving. Collegiate curriculum recommendations from the Mathematical Association of America have included combinatorial problem solving as an important component of training in the mathematical sciences since 1980. The course is strongly recommended for computer science, electrical engineering, mathematics, and statistics majors. Combinatorics underlies the analysis of all computer systems, and it plays a fundamental role in probability, game theory, and discrete optimization. We will follow Alan Tucker's book Applied Combinatorics (see detailed bibliographic information below). This is a very established textbook. It has a wealth of examples and applications, and for about two decades, it has been used by many mathematics, engineering, computer science, and statistics departments around the world. The author emphasizes general reasoning skills over formalism. PrerequisitesEssential prerequisite: love for mathematics and analytic problem solving. Formal prerequisite: at least one the following courses,
TextbookAlan Tucker, Applied Combinatorics, Fourth Edition, John Wiley & Sons, 2002.(Check the Amazon.com customer reviews for this book; the average customer rating is 5/5). ContentScheduleFor an outline of the material covered each day of the academic semester, click here.EvaluationThere will be four problem sets. The students will have two weeks to work on each set. Each problem set will be worth 25% of the grade.How to contact the instructorOffice: SB 4.01.34 (Directions: Go to the fourth floor of the Science Building and as you get off the elevator follow the arrows to the Mathematics Department office. I am right across the hall from the Department Chair's office.) Telephone: (210) 458-5531 Email: iovino@math.utsa.edu Office hours (Fall 2002): M,W 10:11:30 am, or by appointment. |