Menu

back to the home page

Maple Packages, Projects, Etc.

• pattern avoidance web book
  
  
• Supplementary Materials for Dan Daly and Lara Pudwell, Pattern avoidance in the rook monoid, Journal of Combinatorics 5.4 (2014), 471-497.
  • ROOKSCHEMES -- a Maple program for computing enumeration schemes for rook placements avoiding sets of one-dimensional rook patterns
  • scheme output -- results of the enumeration scheme program for various inputs.
  
  
  
• Supplementary Materials for Anant Godbole, Adam Goyt, Jennifer Herdan, and Lara Pudwell, Pattern avoidance in ordered set partitions, Annals of Combinatorics 18.3 (2014), 429-445.
  • 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), 1699-1712.
  • 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 Nathan Gabriel, Katie Peske, Lara Pudwell, and Sam Tay, 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 Lara Pudwell, Enumeration schemes for permutations avoiding barred patterns, Electronic Journal of Combinatorics 17 (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 Lara Pudwell, 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. 193-211.
  • 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 pattern-avoiding words in [k]^n
  • new_words -- For any set of patterns Q, finds the univariate generating function for all Q-avoiding words in [k]^n
  • mwords -- For any set of patterns Q, finds the multivariate generating function for all Q-avoiding words in [k]^n
  
  
  
• Supplementary Materials for Lara Pudwell, Digit reversal without apology, Mathematics Magazine 80 (2007), 129-132.
  • 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