14:26

Abstract Algebra 29: How do you write a permutation in disjoint cycle notation?

06:36

Abstract Algebra 30: How do you write a product of permutations in disjoint cycle notation?

11:33

Abstract Algebra 28: What are of the elements of the symmetric group S_4?

08:44

Abstract Algebra 27: The size of the symmetric group S_n is n!

05:50

Abstract Algebra 26: Identity and inverses in permutation groups

10:00

Abstract Algebra 25: Permutations and permutation groups

06:17

Abstract Algebra 24: Cyclic groups and subgroups are abelian

06:14

Abstract Algebra 23: Not every group is a cyclic group!

07:58

Abstract Algebra 22: What are the generators of Z/10Z?

11:22

Abstract Algebra 21: What are the generators of Z/nZ?

07:27

Abstract Algebra 20: Cyclic groups and subgroups

10:57

Abstract Algebra 19: Two examples of groups that are not abelian

04:54

Abstract Algebra 18: Abelian groups

08:15

Abstract Algebra 17: Subgroups

11:26

Abstract Algebra 16: The cancellation law

05:41

Abstract Algebra 15: The inverse of ab is b^{-1}a^{-1} (socks shoes property)

07:41

Abstract Algebra 14: The inverse of any element in a group is unique

11:46

Abstract Algebra 13: The identity in a group is unique

11:05

Abstract Algebra 12: The integers modulo 5 form a group under addition

05:57

Abstract Algebra 11: The group of nonzero real numbers under multiplication

11:33

Abstract Algebra 10: The definition of a group

08:26

Abstract Algebra 9: Function composition is associative

08:18

Abstract Algebra 8: Why is the composition of two one-to-one functions one-to-one?

04:07

Abstract Algebra 7: Composition of functions

08:27

Abstract Algebra 6: How does the output space affect whether a function is onto or not?

14:34

Abstract Algebra 5: Introduction to functions

07:19

Abstract Algebra 4: Subsets

09:49

Abstract Algebra 3: An introduction to sets

08:39

Abstract Algebra 2: When are two groups considered to be the same?

07:19

Abstract Algebra 1: Introduction to group theory

18:46

Linear Programming 52: Branch and bound

18:55

Linear Programming 52: Cutting planes

14:54

Linear Programming 51: The sparsity-promoting L1 norm and neighborly polytopes

17:54

Linear Programming 50: The sparsity-promoting L1 norm

23:02

Linear Programming 49: Optimal transport and Kantarovich-Rubenstein duality

16:44

Linear Programming 48: Optimal transport and linear programming

17:29

Linear Programming 47: Optimal transport

13:43

Linear Programming 46: Minimum cut and total unimodularity

20:55

Linear Programming 45: Minimum cut

16:46

Linear Programming 44: Maximum flow

21:27

Linear Programming 43: Total unimodularity and Kőnig's theorem

17:49

Linear Programming 42: Totally unimodular matrices

18:29

Linear Programming 41: Vertex covers and Kőnig's theorem

13:33

Linear Programming 40: Matchings and Hall's theorem

19:49

Linear Programming 39: Interior point methods - The primal-dual central path

11:51

Linear Programming 38: Interior point methods - The central path

07:48

Linear Programming 37: Interior point methods

16:22

Linear Programming 36: Ellipsoid Method II

19:10

Linear Programming 35: Ellipsoid Method I

16:49

Linear Programming 34: Polynomial and strongly polynomial algorithms

11:31

Linear Programming 33: Other algorithms besides the simplex method

17:15

Linear Programming 32: Proof of strong duality from the Farkas lemma

07:20

Linear Programming 31: A variant of the Farkas lemma

13:40

Linear Programming 30: Farkas lemma

15:13

Linear Programming 29: A physical interpretation of strong duality

11:27

Linear Programming 28: Dualization recipe

12:09

Linear Programming 27: Optimality is no harder than feasibility

04:32

Linear Programming 26: Proof of weak duality

24:16

Linear Programming 25: Duality of linear programming

17:55

Linear Programming 24: The simplex method - Efficiency