חיפוש חדש  חזור
מידע אישי לתלמיד

שנה"ל תשע"ט

  קומבינטוריקה בסיסית
  Basic Combinatorics  
0366-3036-01
מדעים מדויקים | מתמטיקה
סמ'  ב'1500-1800 שיעור פרופ שפירא אסף
דרישות קדם   רשימת התפוצה  
ש"ס:  3.0

סילבוס מקוצר

Combinatorics - Spring '12

Instructor: Dr. Asaf Shapira

 

Prerequisites to Combinatorics.First year courses in mathematics, most notably Discrete Mathematics or Introduction

Course Overview:

Mathematics or Computer Science. We will cover more advanced topics compared to the course

Introduction to Combinatorics and Graph Theory (0366.1123). The level of difficulty will be comparable

to that of Introduction to Graph Theory (0366.3267).

We will cover and touch upon a variety of topics in Combinatorics, like Ramsey Theory, Extremal

Graph Theory, Extremal Set Theory, the Partition Function and Enumerative Problems.

We will also encounter a variety of tools and techniques, like Generating Functions, the Probabilistic

Method and tools from Linear Algebra.

The course is intended for second and third year undergraduate students in

Suggested Reading

:



Combinatorics: Topics, Techniques, Algorithms, by P. Cameron, 1994.



Invitation to Discrete Mathematics, by J. Matouˇsek and J. Neˇsetˇril (Second Edition), 2008.



(Second Edition), 2011.

How to Count: An Introduction to Combinatorics, by R.B.J.T. Allenby and A. Slomson




A Course in Combinatorics, by J.H. van Lint and R.M. Wilson (2nd


edition), 2001.

אוניברסיטת ת