subset, a Python code which enumerates, generates, randomizes, ranks and unranks combinatorial objects including combinations, compositions, Gray codes, index sets, partitions, permutations, polynomials, subsets, and Young tables. Backtracking routines are included to solve some combinatorial problems. Other routines handle continued fractions, Diophantine equations, and Pythagorean triples.
Combinatorial operations include the enumeration, generation, random selection, ranking and unranking of
Other objects considered include
The information on this web page is distributed under the MIT license.
subset is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.
combo, a Python code which includes routines for ranking, unranking, enumerating and randomly selecting balanced sequences, cycles, graphs, gray codes, subsets, partitions, permutations, restricted growth functions, pruefer codes and trees.
monomial, a Python code which enumerates, lists, ranks, unranks and randomizes multivariate monomials in a space of m dimensions, with total degree less than n, equal to n, or lying within a given range.
polynomial, a Python code which adds, multiplies, differentiates, evaluates and prints multivariate polynomials in a space of m dimensions.
python_combinatorics, a Python code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.
toms515, a Python code which can select subsets of size k from a set of size n. this is a version of acm toms algorithm 515, by bill buckles, matthew lybanon.
ubvec, a Python code which demonstrates how unsigned binary vectors, strings of 0's and 1's, can represent nonnegative integers or subsets or other mathematical objects, for which various arithmetic and logical operations can be defined.
unicycle, a Python code which considers permutations containing a single cycle, sometimes called cyclic permutations.