{"id":7198,"date":"2022-04-28T20:51:24","date_gmt":"2022-04-28T20:51:24","guid":{"rendered":"https:\/\/www.tun.com\/courses\/2019\/12\/23\/introduction-to-enumerative-combinatorics\/"},"modified":"2022-04-28T20:51:24","modified_gmt":"2022-04-28T20:51:24","slug":"introduction-to-enumerative-combinatorics","status":"publish","type":"post","link":"https:\/\/www.tun.com\/courses\/introduction-to-enumerative-combinatorics\/national-research-university-higher-school-of-economics\/","title":{"rendered":"Introduction to Enumerative Combinatorics"},"content":{"rendered":"<div class=\"single_post\" style=\"margin-top:16px;\";>\n<div class=\"post-single-content box mark-links entry-content\">\n<div class=\"thecontent\">\n<h2>Description<\/h2>\n<p>Enumerative combinatorics deals with finite sets and their cardinalities. In other words, a typical problem of enumerative combinatorics is to find the number of ways a certain pattern can be formed. <\/p>\n<p>In the first part of our course we will be dealing with elementary combinatorial objects and notions: permutations, combinations, compositions, Fibonacci and Catalan numbers etc. In the second part of the course we introduce the notion of generating functions and use it to study recurrence relations and partition numbers. <\/p>\n<p>The course is mostly self-contained. However, some acquaintance with basic linear algebra and analysis (including Taylor series expansion) may be very helpful.<\/p>\n<p>Do you have technical problems? Write to us: coursera@hse.ru<\/p>\n<div style=\"height:45px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n<h2 class=\"has-text-align-center\">Price: Enroll For Free!<\/h2>\n<div style=\"height:45px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n<div class=\"wp-block-button aligncenter\"><a class=\"wp-block-button__link has-text-color has-very-light-gray-color has-background has-vivid-red-background-color\" href=\"https:\/\/www.coursera.org\/learn\/enumerative-combinatorics\">View Class<\/a><\/div>\n<div style=\"height:55px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n<div class=\"wp-block-columns\">\n<div class=\"wp-block-column\">\n<p class=\"has-text-align-center\"><em><strong>Language:<\/strong> <\/em>English<\/p>\n<\/div>\n<div class=\"wp-block-column\">\n<p class=\"has-text-align-center\"><em><strong>Subtitles<\/strong>: <\/em>English, Arabic<\/p>\n<\/div>\n<\/div>\n<p style=\"background-color:#496d89\" class=\"has-text-color has-background has-text-align-center has-very-light-gray-color\"><a href=\"https:\/\/www.coursera.org\/learn\/enumerative-combinatorics\">Introduction to Enumerative Combinatorics<strong> &#8211; National Research University Higher School of Economics<\/strong><\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Description Enumerative combinatorics deals with finite sets and their cardinalities. In other words, a typical problem of enumerative combinatorics is to find the number of ways a certain pattern can be formed. In the first part of our course we will be dealing with elementary combinatorial objects and notions: permutations, combinations, compositions, Fibonacci and Catalan [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":19319,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_uag_custom_page_level_css":"","_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_uf_show_specific_survey":0,"_uf_disable_surveys":false,"footnotes":""},"categories":[187],"tags":[],"class_list":["post-7198","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-national-research-university-higher-school-of-economics"],"aioseo_notices":[],"uagb_featured_image_src":{"full":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/National-Research-University-Higher-School-of-Economicsonline-education.png",375,224,false],"thumbnail":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/National-Research-University-Higher-School-of-Economicsonline-education-150x150.png",150,150,true],"medium":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/National-Research-University-Higher-School-of-Economicsonline-education-300x179.png",300,179,true],"medium_large":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/National-Research-University-Higher-School-of-Economicsonline-education.png",375,224,false],"large":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/National-Research-University-Higher-School-of-Economicsonline-education.png",375,224,false],"1536x1536":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/National-Research-University-Higher-School-of-Economicsonline-education.png",375,224,false],"2048x2048":["https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/National-Research-University-Higher-School-of-Economicsonline-education.png",375,224,false]},"uagb_author_info":{"display_name":"Axiom Pegasus","author_link":"https:\/\/www.tun.com\/courses\/author\/magic\/"},"uagb_comment_info":0,"uagb_excerpt":"Description Enumerative combinatorics deals with finite sets and their cardinalities. In other words, a typical problem of enumerative combinatorics is to find the number of ways a certain pattern can be formed. In the first part of our course we will be dealing with elementary combinatorial objects and notions: permutations, combinations, compositions, Fibonacci and Catalan&hellip;","featured_media_src_url":"https:\/\/www.tun.com\/courses\/wp-content\/uploads\/2019\/12\/National-Research-University-Higher-School-of-Economicsonline-education.png","_links":{"self":[{"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/posts\/7198","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/comments?post=7198"}],"version-history":[{"count":0,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/posts\/7198\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/media\/19319"}],"wp:attachment":[{"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/media?parent=7198"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/categories?post=7198"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.tun.com\/courses\/wp-json\/wp\/v2\/tags?post=7198"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}