Enumerated sets and combinatorial objects¶
Todo
Proofread / point to the main classes rather than the modules
Categories¶
Basic enumerated sets¶
Subsets
,Combinations
Arrangements
,Tuples
FiniteEnumeratedSet
DisjointUnionEnumeratedSets
Integer lists¶
- Integer partitions (see also: Enumerated sets of partitions, tableaux, …)
- Integer compositions
SignedCompositions
IntegerListsLex
- Super Partitions
IntegerVectors
WeightedIntegerVectors()
IntegerVectorsModPermutationGroup
- Parking Functions
- Non-Decreasing Parking Functions
- Sidon sets and their generalizations, Sidon -sets
Words¶
Permutations, …¶
- Permutations
- Permutations (Cython file)
- Affine Permutations
Arrangements
- Derangements
- Baxter permutations
See also
SymmetricGroup
,PermutationGroup()
, sage.groups.perm_gps.permutation_groups_catalogFiniteSetMaps
- Integer vectors modulo the action of a permutation group
- Robinson-Schensted-Knuth correspondence
Partitions, tableaux, …¶
Integer matrices, …¶
- Counting, generating, and manipulating non-negative integer matrices
- Hadamard matrices
- Latin Squares
- Alternating Sign Matrices
- Six Vertex Model
- Similarity class types of matrices with entries in a finite field
- Restricted growth arrays
- Vector Partitions
See also
MatrixSpace
- sage.groups.matrix_gps.catalog
Subsets and set partitions¶
Backtracking solvers and generic enumerated sets¶
Todo
Do we want a separate section, possibly more proeminent, for backtracking solvers?
RecursivelyEnumeratedSet()
GenericBacktracker
sage.parallel.map_reduce
- Tiling Solver
- Exact Cover Problem via Dancing Links
- Dancing links C++ wrapper
- Combinatorial Species
IntegerListsLex
IntegerVectorsModPermutationGroup