The study of integer partitions has a long and storied history, notably beginning with the pioneering work of Hardy and Ramanujan, and continues to be enriched by modern asymptotic techniques. Recent ...

Compositions are conceptualized as non alternating sequences of blocks of non-decreasing and strictly decreasing partitions. We find the generating function F(x, y, q) where x marks the size of the ...

The words in the title are characterized by the fact that a smaller number must (first) appear earlier than a larger number, and that all numbers 1,..., k are present (for some k). Under the ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...