{"id":522,"date":"2017-11-07T06:44:15","date_gmt":"2017-11-07T06:44:15","guid":{"rendered":"https:\/\/science.sjp.ac.lk\/mat\/?page_id=522"},"modified":"2024-12-19T04:37:15","modified_gmt":"2024-12-19T04:37:15","slug":"combinatorics","status":"publish","type":"page","link":"https:\/\/science.sjp.ac.lk\/mat\/combinatorics\/","title":{"rendered":"Combinatorics"},"content":{"rendered":"<section class=\"wpb-content-wrapper\"><p>[vc_row][vc_column][vc_column_text]<strong>Course: <\/strong>MAT 483 2.0 Combinatorics (Optional)<\/p>\n<p><strong>Course content:<\/strong><\/p>\n<p style=\"text-align: justify;\">Permutations &amp; Combinations, Pigeonhole Principle, Generalized Pigeonhole Principle-Ramsey Theory, Binomial coefficients, Pascal triangle, Binomial Theorem, Multinomial Theorem, Inclusion Exclusion Principle, Derangements, Permutations with Forbidden positions, Recurrence relation &amp; Generating functions, Fibonacci Lucas Sequences, Exponential generating functions, Counting numbers, Catalan, Sterling, Bell numbers , Partition numbers, Integer partition , Ferrer diagrams, pentagonal number theorem, Ramanujan Congruences\u00a0 , Combinatorics with graph theory, Eulerian trials, Hamiltonian Paths &amp; cycles, Bipartite Multi graphs, Trees, Chromatic number.<\/p>\n<p><strong>\u00a0<\/strong><strong>Recommended Readings:<\/strong><\/p>\n<ol>\n<li>Brualdi, introductory combinatoric. Prentice-Hall, 2004<\/li>\n<li>Bona. A walkthrough combinatorics-An introduction to Enumeration and Graph Theory, World Scientific Publication Company, 2002<\/li>\n<\/ol>\n<p>[\/vc_column_text][\/vc_column][\/vc_row]<\/p>\n<\/section>","protected":false},"excerpt":{"rendered":"<p>[vc_row][vc_column][vc_column_text]Course: MAT 483 2.0 Combinatorics (Optional) Course content: Permutations &amp; Combinations, Pigeonhole Principle, Generalized Pigeonhole Principle-Ramsey Theory, Binomial coefficients, Pascal triangle, Binomial Theorem, Multinomial Theorem, Inclusion Exclusion Principle, Derangements, Permutations with Forbidden positions, Recurrence relation &amp; Generating functions, Fibonacci Lucas Sequences, Exponential generating functions, Counting numbers, Catalan, Sterling, Bell numbers , Partition numbers, Integer partition &hellip; <a href=\"https:\/\/science.sjp.ac.lk\/mat\/combinatorics\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">Combinatorics<\/span><\/a><\/p>\n","protected":false},"author":4,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_ti_tpc_template_sync":false,"_ti_tpc_template_id":"","footnotes":""},"_links":{"self":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/522"}],"collection":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/users\/4"}],"replies":[{"embeddable":true,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/comments?post=522"}],"version-history":[{"count":2,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/522\/revisions"}],"predecessor-version":[{"id":4730,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/522\/revisions\/4730"}],"wp:attachment":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/media?parent=522"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}