2016 Discrete Mathematics

Font size  SML

Register update notification mail Add to favorite lecture list
Academic unit or major
Undergraduate major in Mathematical and Computing Science
Instructor(s)
Kojima Sadayoshi  Umehara Masaaki  Terashima Yuji 
Course component(s)
Lecture
Mode of instruction
 
Day/Period(Room No.)
Mon3-4(W834)  Thr3-4(W834)  
Group
-
Course number
MCS.T331
Credits
2
Academic year
2016
Offered quarter
4Q
Syllabus updated
2017/1/11
Lecture notes updated
-
Language used
Japanese
Access Index

Course description and aims

Discrete mathematics plays an important role in mathematical and computing sciences. The objective of this course is to provide the fundamentals of the complex analysis. Topics include generating function, graph, and partition number.

Student learning outcomes

The students are expected to understand the fundamentals of discrete mathematics appeared in mathematical and computing sciences and also to be able to apply them to practical problems.

Keywords

generating function, graph, partition number

Competencies that will be developed

Specialist skills Intercultural skills Communication skills Critical thinking skills Practical and/or problem-solving skills

Class flow

The lectures provide the fundamentals of discrete mathematics.

Course schedule/Required learning

  Course schedule Required learning
Class 1 generating function Understand the contents covered by the lecture.
Class 2 Catalan number Understand the contents covered by the lecture.
Class 3 tree Understand the contents covered by the lecture.
Class 4 graph Understand the contents covered by the lecture.
Class 5 path Understand the contents covered by the lecture.
Class 6 characteristic number Understand the contents covered by the lecture.
Class 7 graph polynomial Understand the contents covered by the lecture.
Class 8 polyhedron Understand the contents covered by the lecture.
Class 9 regular polyhedron Understand the contents covered by the lecture.
Class 10 symmetric polynomial Understand the contents covered by the lecture.
Class 11 partition number Understand the contents covered by the lecture.
Class 12 Young diagram Understand the contents covered by the lecture.
Class 13 standard tableau Understand the contents covered by the lecture.
Class 14 braid group Understand the contents covered by the lecture.
Class 15 knot Understand the contents covered by the lecture.

Textbook(s)

Not specified.

Reference books, course materials, etc.

Sadayoshi Kojima, Risan Kouzou, Asakura Shoten
Graham/Knuth/Patashnik, Concrete Mathematics, Addison-Wesley

Assessment criteria and methods

By scores of examinations.

Related courses

  • MCS.T231 : Algebra
  • MCS.T201 : Set and Topology I
  • MCS.T202 : Exercises in Set and Topology I

Prerequisites (i.e., required knowledge, skills, courses, etc.)

None.

Page Top