@hackage combinat0.2.10.1
Generate and manipulate various combinatorial objects.
Categories
License
BSD-3-Clause
Maintainer
bkomuves (plus) hackage (at) gmail (dot) com
Links
Versions
Installation
Tested Compilers
Dependencies (6)
- array >=0.5 && <0.7
- base >=4 && <5
- compact-word-vectors >=0.2.0.2 && <0.4
- containers >=0.6 && <0.9
- random >=1.1 && <1.4
- transformers >=0.4.2 && <0.8 Show all…
Dependents (10)
@hackage/sigma-ij, @hackage/acme-everything, @hackage/fast-arithmetic, @hackage/gencheck, @hackage/coincident-root-loci, @hackage/qhull, Show all…
combinat - a Haskell combinatorics library
For the API docs, check out Hackage.
This is a combinatorics library for Haskell. It contains functions enumerating, counting, visualizing, manipulating, and sometimes randomly sampling from many standard combinatorial objects, including:
- subsets
- compositions
- trees
- numbers:
- natural numbers
- prime numbers
- formal power series
- permutations
- partitions:
- integer partitions
- set partitions, multiset partitions, non-crossing partitions
- plane partitions
- vector partitions
- skew partitions, ribbons
- Young tableaux, Littlewood-Richardson coefficients
- lattice paths, Dyck paths
- groups:
- permutation groups
- braid groups
- free groups, free products of cyclic groups
- Thompson's group F