INSENC: This package accompanies ”Finding regular insertion encodings for permutation classes”. In that paper you will find a description of the algorithm the package uses. It has been tested with Maple 11. What INSENC can do: If the class of permutations avoiding a particular set B of permutations has a regular insertion encoding (which INSENC will determine as soon as you type in B), then INSENC can compute the (necessarily rational) generating function for the class.

References in zbMATH (referenced in 21 articles , 1 standard article )

Showing results 1 to 20 of 21.
Sorted by year (citations)

1 2 next

  1. Mansour, Toufik: Enumeration and Wilf-classification of permutations avoiding four patterns of length 4 (2020)
  2. Pantone, Jay; Vatter, Vincent: Growth rates of permutation classes: categorization up to the uncountability threshold (2020)
  3. Bean, Christian; Gudmundsson, Bjarki; Ulfarsson, Henning: Automatic discovery of structural rules of permutation classes (2019)
  4. Do, Phan Thuan; Tran, Thi Thu Huong; Vajnovszki, Vincent: Exhaustive generation for permutations avoiding (colored) regular sets of patterns (2019)
  5. Mansour, Toufik; Schork, Matthias: Permutation patterns and cell decompositions (2019)
  6. Troyka, Justin M.: On the centrosymmetric permutations in a class (2019)
  7. Homberger, Cheyne; Vatter, Vincent: On the effective and automatic enumeration of polynomial permutation classes (2016)
  8. Mansour, Toufik; Schork, Matthias: Wilf classification of subsets of four letter patterns (2016)
  9. Tenner, Bridget Eileen: Repetition in reduced decompositions (2012)
  10. Vatter, Vincent: Finding regular insertion encodings for permutation classes (2012)
  11. Vatter, Vincent: Small permutation classes (2011)
  12. Bassino, Frédérique; Bouvel, Mathilde; Pierrot, Adeline; Rossin, Dominique: Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial (2010)
  13. Baxter, Andrew M.: Refining enumeration schemes to count according to the inversion number (2010)
  14. Bouvel, Mathilde; Pergola, Elisa: Posets and permutations in the duplication-loss model: minimal permutations with (d) descents (2010)
  15. Pudwell, Lara: Enumeration schemes for permutations avoiding barred patterns (2010)
  16. Pudwell, Lara: Enumeration schemes for words avoiding permutations (2010)
  17. Bernini, Antonio; Ferrari, Luca; Pinzani, Renzo: Enumeration of some classes of words avoiding two generalized patterns of length three (2009)
  18. Pudwell, Lara: Enumeration schemes for words avoiding patterns with repeated letters (2008)
  19. Billey, Sara C.; Jones, Brant C.: Embedded factor patterns for Deodhar elements in Kazhdan-Lusztig theory. (2007)
  20. Losonczy, Jozsef: Maximally clustered elements and Schubert varieties. (2007)

1 2 next