@hackage / combinat

Generate and manipulate various combinatorial objects.

Latest0.2.10.1

About

Metadata

  • Last updated , by BalazsKomuves
  • License BSD-3-Clause
  • Categories Mathematics
  • Maintained by: bkomuves (plus) hackage (at) gmail (dot) com

  • Lottery factor: 0

Links

Installation

Tested Compilers

  1. 9.4.7
  2. 8.6.5

Readme

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