|
|
|
|
|
|
 |
 |
|
Implementing Special Numbers: Advanced List Manipulations
|
|
|
|
|
|
| Organization: | Pusan National University |
| Department: | Department of Mathematics Education, College of Education |
|
|
|
|
|
|
0210-373
|
|
|
|
|
|
2002-05-20
|
|
|
|
|
|
This is a Mathematica Notebook which defines routines for list manipulation that complement those of the Mathematica kernel and the DiscreteMath standard add-on package.
These routines can be valuable in a variety of applications. For example, generating all equivalence relations can be done easily from the Bell partition of the given set, and the triangulations of a convex polygon can be obtained easily from the function CatalanOrder with minor changes. For combinatorial probability problems, these routines are also effective in problem solving. The implementation algorithms are identical to the counting mechanism of the "special numbers." The first two functions, Stirling2nd and Bell are concerned with the partitions of a set while other functions introduced deal with permutations.
|
|
|
|
|
|
|
|
|
|
|
|
Bell, Catalan, Derangement, Euler, Recontre, Stirling, Partition, List, Binary tree, cycle
|
|
|
 |
|
|
| SpecialNumbers.nb (97.4 KB) - Mathematica notebook |
|
|
|
|
|
|
|
| | | | | |
|
For the newest resources, visit Wolfram Repositories and Archives »
