Rational generating function conjecture for the class of permutations corresponding to pin words
Rational generating function conjecture for the class of permutations corresponding to pin words
A pin word is a word encoding a permutation through the pin sequence construction; the set of permutations corresponding to pin words forms a permutation class. Rational generating function conjecture. The class of permutations corresponding to pin words has a rational generating function. This conjecture concerns the enumerative structure of the permutation class arising from pin words and reflects the regular-language origin of the class. The supplied text gives no evidence of resolution.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Robert Brignall, Nik Ruskuc and Vince Vatter, “Simple permutations: decidability and unavoidable substructures”, arXiv:math/0609211 (2006).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.