• Advanced
  • About 16 min

Counting functions: involutions, idempotents and non-decreasing functions

Count functions on a finite set that satisfy f(f(x)) = x or f(f(x)) = f(x), count non-decreasing functions between two sets, and use cycle structure to organise the count.

If something looks wrong, please tell us.

This lesson is part of a premium course. It comes with Sikhora Learning membership. The course's free preview lessons are open to everyone.

Privacy · Terms · Refunds · Delivery