Students are able to think abstractly and acquire a basic knowledge in the field of classical and modern
\ncombinatorics. Students have the knowledge of counting, they know the elements of combinatorial constructions,
\ncombinatorial algorithms and elements of discrete optimisation. The acquired knowledge is used for
\nfurther education and scientific research.<\/p>\n
The basic combinatorial objects. Permutations, combinations, partitions, compositions. Advanced
\ncombinatorial structures. Finite geometries, block constructions. Latin squares. Codes. Hadamard matrix.
\nAlgorithms for generating combinatorial objects. Combinatorics of enumerating objects. Recurrence
\nrelations. Generating functions. Polya theorem. Combinatorics on words, combinatorial algorithms. Ways
\nof sorting and searching. Discrete optimisation. Linear and integer programming. Dynamic programming.
\nPackaging and coverage. Network optimisation. Theory of matroids and greedy algorithms. Coloring and
\nlayout. Advanced heuristics. Random data structures and randomised algorithms.<\/p>\n
Part of the course is conducted through independent research work that includes the application of
\ncombinatorics to computer science, computer engineering, physics, chemistry, biology, as well as
\navailable software tools for combinatorics.<\/p>\n","protected":false},"excerpt":{"rendered":"
Objectives and Outcomes Students are able to think abstractly and acquire a basic knowledge in the field of classical and modern combinatorics. Students have the knowledge of counting, they know the elements of combinatorial constructions, … Read more<\/a><\/p>\n Read more<\/a>","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[199],"tags":[],"class_list":["post-13946","post","type-post","status-publish","format-standard","hentry","category-subjects"],"acf":[],"yoast_head":"\n