Counting: Permutations and Combinations

Related lectures (26)

Page 1 of 3

Covers permutation, combination, and the pigeonhole principle in counting problems.

Covers the concept of enumeration and counting subsets of a finite set with examples and factorial notation.

Explores the Steinitz Lemma and the concept of cycles in linear algebra.

Covers the concepts of combinations and permutations in counting scenarios.

Explores the Symmetric group, cycle decomposition, Orbit-Stabilizer theorem, and properties of cycles and transpositions.

Covers the Symmetric group, cycle decomposition, transpositions, even and odd permutations, and group actions.

Explores sets and subsets in linear algebra, emphasizing counting elements and subsets.

Explores the Symmetric group, cycle notation, multiplication, the sign of a permutation, and the Alternating group.

Explores the reasons behind the abundance of saddle points in deep learning optimization, emphasizing statistical and geometric arguments.