Wolfram Language
Paclet Repository
Community-contributed installable additions to the Wolfram Language
Primary Navigation
Categories
Cloud & Deployment
Core Language & Structure
Data Manipulation & Analysis
Engineering Data & Computation
External Interfaces & Connections
Financial Data & Computation
Geographic Data & Computation
Geometry
Graphs & Networks
Higher Mathematical Computation
Images
Knowledge Representation & Natural Language
Machine Learning
Notebook Documents & Presentation
Scientific and Medical Data & Computation
Social, Cultural & Linguistic Data
Strings & Text
Symbolic & Numeric Computation
System Operation & Setup
Time-Related Computation
User Interface Construction
Visualization & Graphics
Random Paclet
Alphabetical List
Using Paclets
Create a Paclet
Get Started
Download Definition Notebook
Learn More about
Wolfram Language
Combinatorics
Tutorials
Combinatorics
Guides
Combinatorics
Functions I understand in combinatorics
Tech Notes
Combinatorics
Stirling permutation
Symbols
CanonicalMultiset
CentralBinomialCoefficient
ConjugatePartition
DescendingSublists
DivisorHasseDiagram
DominatingIntegerPartitionQ
DurfeeSquare
EnumerateMultisetPartialDerangements
EulerianCatalanNumber
EulerianNumber
EulerianNumberOfTheSecondKind
FerrersDiagram
Fibbinary
FibonacciEncode
FindAscentElements
FindAscentPositions
FindDescentElements
FindDescentPositions
FrobeniusSymbolFromPartition
FromInversionVector
FromPartitionPlusNotation
FromPartitionSuperscriptNotation
GaussFactorial
GrayCode
HasseDiagram
HookLengths
HuffmanCodeWords
HuffmanDecode
HuffmanEncode
IntegerPartitionQ
InverseFibonacci
InverseGrayCode
InversionCount
InversionVectorQ
LehmerCodeFromPermutation
LucasNumberU1
LucasNumberV2
ModifiedCentralBinomialCoefficient
Multichoose
MultisetAssociation
MultisetPartialDerangements
NarayanaNumber
NextPermutation
NumberOfTableaux
OrderedTupleFromIndex
OrderedTupleIndex
OrderlessCombinations
OrderlessCombinationsOfUnmarkedElements
PartialOrderGraphQ
PartitionCrank
PartitionFromFrobeniusSymbol
PartitionPlusNotation
PartitionRank
PartitionSuperscriptNotation
PermutationCountByInversions
PermutationFromIndex
PermutationGraph
PermutationIndex
PermutationMajorIndex
PermutationToTableaux
Phitorial
PosetQ
PosetToTableau
Primorial
QExponential
QMultinomial
RandomYoungTableau
RationalNumberRepeatingDecimalPeriod
ReflexiveGraphQ
SecantNumber
SelectPermutations
SelectSubsets
SelectTuples
SelfConjugatePartitionQ
SignedLahNumber
StandardYoungTableaux
StirlingPermutationGraph
StirlingPermutations
StrictIntegerPartitions
SubsetFromIndex
SubsetIndex
TableauQ
TableauToPoset
TableauxToPermutation
TangentNumber
ToInversionVector
TransitiveGraphQ
TransposeTableau
TupleFromIndex
TupleIndex
UnsignedLahNumber
YoungDiagram
ZeckendorfRepresentation
Functions I understand in combinatorics
These are functions I understand in the paclet.
Functions I understand
C
e
n
t
r
a
l
B
i
n
o
m
i
a
l
C
o
e
f
f
i
c
i
e
n
t
— compute the central binomial coefficient
E
n
u
m
e
r
a
t
e
M
u
l
t
i
s
e
t
P
a
r
t
i
a
l
D
e
r
a
n
g
e
m
e
n
t
s
— enumerate a multiset's partial derangements
M
u
l
t
i
c
h
o
o
s
e
— compute the multichoose operation
F
e
r
r
e
r
s
D
i
a
g
r
a
m
— Display the Ferrers diagram of a partition with dots
P
e
r
m
u
t
a
t
i
o
n
I
n
d
e
x
— Give the lexicographic index of a permutation
P
e
r
m
u
t
a
t
i
o
n
F
r
o
m
I
n
d
e
x
— Give the permutation corresponding to a given length and lexicographic index
M
u
l
t
i
s
e
t
P
a
r
t
i
a
l
D
e
r
a
n
g
e
m
e
n
t
s
— list the partial derangements of a multiset one by one
O
r
d
e
r
l
e
s
s
C
o
m
b
i
n
a
t
i
o
n
s
— Generate all possible orderless lists of a given length with a given set of elements
O
r
d
e
r
l
e
s
s
C
o
m
b
i
n
a
t
i
o
n
s
O
f
U
n
m
a
r
k
e
d
E
l
e
m
e
n
t
s
— Generate all possible orderless lists of a given length with a given set of unmarked indistinguishable plain unlabeled elements
S
e
l
e
c
t
P
e
r
m
u
t
a
t
i
o
n
s
— Get permutations that satisfy a certain criterion
S
e
l
e
c
t
S
u
b
s
e
t
s
— Generate subsets that satisfy a certain criterion
S
e
l
e
c
t
T
u
p
l
e
s
— Generate tuples that satisfy a certain criterion
C
e
n
t
r
a
l
B
i
n
o
m
i
a
l
C
o
e
f
f
i
c
i
e
n
t
— compute the central binomial coefficient
E
u
l
e
r
i
a
n
C
a
t
a
l
a
n
N
u
m
b
e
r
— compute the Eulerian Catalan number
E
u
l
e
r
i
a
n
N
u
m
b
e
r
— Get the number of permutations with a given number of ascents
E
u
l
e
r
i
a
n
N
u
m
b
e
r
O
f
T
h
e
S
e
c
o
n
d
K
i
n
d
— compute the Eulerian number of the second kind
N
a
r
a
y
a
n
a
N
u
m
b
e
r
— compute the Narayana number
S
i
g
n
e
d
L
a
h
N
u
m
b
e
r
— compute the signed Lah number
L
(
n
,
k
)
U
n
s
i
g
n
e
d
L
a
h
N
u
m
b
e
r
— compute the unsigned Lah number
L
(
n
,
k
)
I
n
v
e
r
s
e
F
i
b
o
n
a
c
c
i
— Compute the inverse Fibonacci function
N
e
x
t
P
e
r
m
u
t
a
t
i
o
n
— Get the next permutation in lexicographic order
P
e
r
m
u
t
a
t
i
o
n
A
s
c
e
n
t
s
— Give the indices of a permutation where there is an immediate ascent
G
a
u
s
s
F
a
c
t
o
r
i
a
l
— compute the Gauss factorial
P
h
i
t
o
r
i
a
l
— compute the phitorial
P
r
i
m
o
r
i
a
l
— compute the primorial
L
u
c
a
s
N
u
m
b
e
r
U
1
— compute the term of the Lucas sequence of the first kind
L
u
c
a
s
N
u
m
b
e
r
V
2
— compute the term of the Lucas sequence of the second kind
Q
E
x
p
o
n
e
n
t
i
a
l
— q-exponential
Q
M
u
l
t
i
n
o
m
i
a
l
— q-multinomial
R
a
t
i
o
n
a
l
N
u
m
b
e
r
R
e
p
e
a
t
i
n
g
D
e
c
i
m
a
l
P
e
r
i
o
d
— find the period of a repeating decimal of a rational number
T
e
c
h
N
o
t
e
s
▪
C
o
m
b
i
n
a
t
o
r
i
c
s
R
e
l
a
t
e
d
G
u
i
d
e
s
▪
C
o
m
b
i
n
a
t
o
r
i
c
s
"
"