Menu
back to the home page
teaching
about me
pictures
my work experience
my education
my mathematical genealogy
my publications
my erdös number
my talks
maple packages, projects, etc.
in the news...
my professional memberships
mathematical quotations
lots of links



Maple Packages, Projects, Etc.
 pattern avoidance web book
 Supplementary Materials for Dan Daly and Lara Pudwell, "Pattern avoidance in the rook monoid", (in preparation)
 ROOKSCHEMES  a Maple program for computing enumeration schemes for rook placements avoiding sets of onedimensional rook patterns
 scheme output  results of the enumeration scheme program for various inputs.
 Supplementary Materials for Timothy Goodrich, Drew Groth, Lauren Knop, Will Olson, Lara Pudwell, and Julia Yuan, "Sorting Permutations with Finite Depth Stacks", (submitted)
 Supplementary Materials for Anant Godbole, Adam Goyt, Jennifer Herdan, and Lara Pudwell, " Pattern avoidance in ordered set partitions", (submitted)
 123_scheme  a Maple program for computing the number of ordered set partitions avoiding the pattern 123. Try Akblocks(n,k) for the number of such partitions of {1,...n} into k blocks, or try A([a1,a2,...,ak]) for the number of such partitions with ai entries in block i from 1<=i<=k.
 Supplementary Materials for Andrew Baxter and Lara Pudwell, "Enumeration schemes for vincular patterns", Discrete Mathematics 312 (2012), 16991712.
 gVATTER  a Maple program for computing enumeration schemes for permutations avoiding sets of dashed (aka vincular) patterns
 scheme output  results of the enumeration scheme program for various inputs.
 Supplementary material for "Pattern Avoidance in Ternary Trees", Journal of Integer Sequences 15 (2012), 12.1.5.
 ternary_trees  Finds a functional equation satisfied by the avoidance generating function for any contiguous ternary tree pattern
 Supplementary Materials for "Enumeration Schemes for Permutations Avoiding Barred Patterns", Electronic Journal of Combinatorics 17 (1) (2010), R29.
 bVATTER  a Maple program for computing enumeration schemes for permutations avoiding barred patterns
 scheme output  results of the enumeration scheme program for various inputs.
 Supplementary Materials for "Enumeration schemes for words avoiding permutations", In Permutation Patterns (2010), S. Linton, N. Ruskuc, and V. Vatter, Eds., vol. 376 of London Mathematical Society Lecture Note Series, Cambridge University Press, pp. 193211. Cambridge: Cambridge University Press.
 mVATTER  a Maple program for computing enumeration schemes for words avoiding permutations (allows user to input maximum gap vector weight)
 mVATTER2  a Maple program for computing enumeration schemes for words avoiding permutations (maximmum gap vector weight is automatically computed)
 scheme output  results of the enumeration scheme program for various inputs.
 Two Maple packages for counting patternavoiding words in [k]^n
 new_words  For any set of patterns Q, finds the univariate generating function for all Qavoiding words in [k]^n
 mwords  For any set of patterns Q, finds the multivariate generating function for all Qavoiding words in [k]^n
 Supplementary Materials for "Digit Reversal Without Apology" (Mathematics Magazine 80(2007), 129132.)
 KACZYNSKI  a Maple package for exploring integers whose reversals are integer multiples of themselves
 data  a large amount of output from the KACZYNSKI Maple package, organized by base and number of digits
