What Every Programmer Should Know About Enumerative Combinatorics

Quick intro LeetArxiv is Leetcode for implementing Arxiv and other research papers. This is Chapter 1 in our upcoming book, What Every Programmer Needs to Know about Enumerative Combinatorics. Past Chapters (Early access for paying subscribers) Chapter 1 (we are here) : Introduction to Integer Partitions and Integer Compositions. Chapter 2 : The Factorial Number System as an Alternative to Base-2 Binary Computer Architectures. Chapter 3 : The Combinatorial Number System as another Alternative to Base-2 Binary Computer Architectures. Chapter 4 : Burrows-Wheeler and Bijective Burrows-Wheeler Sorting Algorithms. Chapter 5 : Sinkhorn Propagation as a Backpropagation Substitute. 1.0 Quick Introduction to Enumerative Combinatorics Enumerative combinatorics is a branch of mathematics focused on counting the elements of a set. For example, determining the number of unique user IDs in a database is a problem in enumerative combinatorics. This article showcases how programmers withou ... Read full article.