Combinatorics

This chapter describes functions that deal with combinatorics. We mainly concentrate on two areas. One is about selections, that is the ways one can select elements from a set. The other is about partitions, that is the ways one can partition a set into the union of pairwise disjoint subsets.

Combinatorial Numbers
<#Include Label="Factorial"> <#Include Label="Binomial"> <#Include Label="Bell"> <#Include Label="Bernoulli"> <#Include Label="Stirling1"> <#Include Label="Stirling2">

Combinations, Arrangements and Tuples
<#Include Label="Combinations"> <#Include Label="IteratorOfCombinations"> <#Include Label="NrCombinations"> <#Include Label="Arrangements"> <#Include Label="NrArrangements"> <#Include Label="UnorderedTuples"> <#Include Label="NrUnorderedTuples"> <#Include Label="Tuples"> <#Include Label="EnumeratorOfTuples"> <#Include Label="IteratorOfTuples"> <#Include Label="NrTuples"> <#Include Label="PermutationsList"> <#Include Label="NrPermutationsList"> <#Include Label="Derangements"> <#Include Label="NrDerangements"> <#Include Label="PartitionsSet"> <#Include Label="NrPartitionsSet"> <#Include Label="Partitions"> <#Include Label="IteratorOfPartitions"> <#Include Label="NrPartitions"> <#Include Label="OrderedPartitions"> <#Include Label="NrOrderedPartitions"> <#Include Label="PartitionsGreatestLE"> <#Include Label="PartitionsGreatestEQ"> <#Include Label="RestrictedPartitions"> <#Include Label="NrRestrictedPartitions"> <#Include Label="SignPartition"> <#Include Label="AssociatedPartition"> <#Include Label="PowerPartition"> <#Include Label="PartitionTuples"> <#Include Label="NrPartitionTuples">

Fibonacci and Lucas Sequences
<#Include Label="Fibonacci"> <#Include Label="Lucas">

Permanent of a Matrix
<#Include Label="Permanent">