The highlight of this repo is the LaTeX document, which outlines the most important concepts in combinatorics. It also includes Polish names for the discussed operations and attempts to make sense of such dissimilar terminology. The latest release can be downloaded here.
Another useful resource should be the table in the next section.
| Language | Permutations | Partial permutations | Permutations with replacement | Multiset permutations | Combinations | Combinations with replacement |
|---|---|---|---|---|---|---|
Python (itertools) |
permutations (S) |
permutations (S, k) |
product(S, repeat=k) |
inefficient: set(permutations(S)) efficient: ekg/multipermute |
combinations (S, k) |
combinations_with_replacement (S, k) |
All pull requests are very welcome.
The document is intentionally concise but if this has been at the cost of clarity, any improvements will be highly appreciated.
Please add more programming languages! R, MATLAB and Mathematica are highly desirable.