▶Japanese
Post to SNS
- Home
- > School of Computing
- > Undergraduate major in Mathematical and Computing Science
- > Discrete Mathematics
- School of Science
-
School of Engineering
- Undergraduate major in Mechanical Engineering
- Undergraduate major in Systems and Control Engineering
- Undergraduate major in Electrical and Electronic Engineering
- Undergraduate major in Information and Communications Engineering
- Undergraduate major in Industrial Engineering and Economics
- Common courses
- School of Materials and Chemical Technology
- School of Computing
- School of Life Science and Technology
- School of Environment and Society
- 工学院，物質理工学院，環境・社会理工学院共通科目
- Liberal arts and basic science courses
- First-Year Courses
- School of Science
- School of Engineering
- School of Materials and Chemical Technology
- School of Computing
- School of Life Science and Technology
-
School of Environment and Society
- Department of Architecture and Building Engineering
- Department of Civil and Environmental Engineering
- Department of Transdisciplinary Science and Engineering
- Department of Social and Human Sciences
- Department of Innovation Science
- Graduate major in Technology and Innovation Management
- Common courses
- Liberal arts and basic science courses
- Academic unit or major
- Undergraduate major in Mathematical and Computing Science
- Instructor(s)
- Umehara Masaaki Murofushi Toshiaki Nishibata Shinya Miura Hideyuki Suzuki Sakie Tsuchioka Shunsuke
- Class Format
- Lecture (Livestream)
- Media-enhanced courses
- Day/Period(Room No.)
- Mon7-8(W932) Thr7-8(W932)
- Group
- -
- Course number
- MCS.T331
- Credits
- 2
- Academic year
- 2022
- Offered quarter
- 2Q
- Syllabus updated
- 2022/5/12
- 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 disctere mathematics.
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
Euler characteristic, Four color problem, Euclidean Geometry to Modern Geometry, Partially ordered sets，Lattices, Formal Concept Analysis, Generating function, Integer partitions, Representation theory, Hyperbolic summation, Groebner basis, Experimental mathematics
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 | The last half of volume 1 of Elements (Parallelogram, area, the Pythagorean theorem) | Understand the contents covered by the lecture. |
| Class 2 | The last half of volume 1 of Elements (Parallelogram, area, the Pythagorean theorem) | Understand the contents covered by the lecture. |
| Class 3 | Hyperbolic geomtry as non-Euclidean geometry (Negation of parallel postulate, hyperbolic geometry） | Understand the contents covered by the lecture. |
| Class 4 | Projective geometry (Properties of figures preserving under the projections, Desargues's theorem, Pascal's theorem) | Understand the contents covered by the lecture. |
| Class 5 | Geometry of Moebius strips (orientability of surfaces, Moebius strips as flat surfaces) | Understand the contents covered by the lecture. |
| Class 6 | Preliminaries from logic, sets, and relations | Understand the contents covered by the lecture. |
| Class 7 | Partially ordered sets | Understand the contents covered by the lecture. |
| Class 8 | Lattices | Understand the contents covered by the lecture. |
| Class 9 | Formal Concept Analysis | Understand the contents covered by the lecture. |
| Class 10 | Integer partitions and Young diagrams | Understand the contents covered by the lecture. |
| Class 11 | Generating functions and enumerative/analytic combinatorics | Understand the contents covered by the lecture. |
| Class 12 | Hypergeometric summation | Understand the contents covered by the lecture. |
| Class 13 | Groebner basis | Understand the contents covered by the lecture. |
| Class 14 | Experimental mathematics | Understand the contents covered by the lecture. |
Out-of-Class Study Time (Preparation and Review)
To enhance effective learning, students are encouraged to spend approximately 100 minutes preparing for class and another 100 minutes reviewing class content afterwards (including assignments) for each class.
They should do so by referring to textbooks and other course material.
Textbook(s)
Not specified.
Reference books, course materials, etc.
B. A. Davey & H. A. Priestley, “Introduction to Lattices and Order”, 2nd ed., Cambridge Univ. Press, 2002,
B. Ganter & R. Wille, “Formal Concept Analysis — Mathematical Foundations”, Springer, 1999
O. SUZUKI, T. Murofushi, Formal Concept Analysis : Introduction, Support Softwares, and Applications,
Journal of Japan Society for Fuzzy Theory and Intelligent Informatics, vol. 19, no. 2 (2007) pp. 103-142.
Assessment criteria and methods
By scores of reports.
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.
