By Andrew Baxter, Brian Nakamura, and Doron Zeilberger
If you want to see a ranked list of single patterns of length 3
according to the number of permutations that they avoid, followed by the first
100 terms of the (called P31 in the file)
the input
gives the output.
If you want to see a ranked list of sets of two patterns each of length 3
according to the number of permutations that they avoid, followed by the first
50 terms of the (called P32 in the file)
the input
gives the output.
If you want to see a ranked list of sets of three patterns each of length 3
according to the number of permutations that they avoid, followed by the first
50 terms of the (called P33 in the file)
the input
gives the output.
If you want to see a ranked list of sets of four patterns each of length 3
according to the number of permutations that they avoid, followed by the first
50 terms of the (called P34 in the file)
the input
gives the output.
If you want to see a ranked list of sets of five patterns each of length 3
according to the number of permutations that they avoid, followed by the first
50 terms of the (called P35 in the file)
the input
gives the output.
If you want to see a ranked list of sets of six patterns each of length 3
(there is only one such set obviously!, and you don't need a computer for this one!)
according to the number of permutations that they avoid, followed by the first
50 terms of the (called P36 in the file)
the input
gives the output.
If you want to see a ranked list of single patterns of length 4
according to the number of permutations that they avoid, followed by the first
40 terms of the (called P41 in the file)
the input
gives the output.
If you want to see a ranked list of sets of two patterns each of length 4
according to the number of permutations that they avoid, followed by the first
40 terms of the (called P42 in the file)
the input
gives the output.
If you want to see a ranked list of sets of three patterns each of length 4
according to the number of permutations that they avoid, followed by the first
40 terms of the (called P43 in the file)
the input
gives the output.
If you want to see a ranked list of single patterns of length 5
according to the number of permutations that they avoid, followed by the first
30 terms of the (called P51 in the file)
the input
gives the output.
If you want to see a ranked list of sets of two patterns each of length 5
according to the number of permutations that they avoid, followed by the first
30 terms of the (called P52 in the file)
the input
gives the output
If you want to see the theorem that produces the system of functional equations
for the weight-enumeration according to pattern pf length 2,
the input
gives the output
If you want to see the theorem that produces the system of functional equations
for the weight-enumeration according to pattern pf length 3,
the input
gives the output
If you want to see the theorem that produces the system of functional equations
for the weight-enumeration according to pattern pf length 4,
the input
gives the output
If you want to see the theorem that produces the system of functional equations
for the weight-enumeration of permutations avoiding the consecutive pattern [1,2,3]
the input
gives the output
If you want to see the theorem that produces the system of functional equations
for the weight-enumeration of permutations avoiding the consecutive patterns [1,2,3] and [1,3,2],
the input
gives the output
If you want to see the theorem that produces the system of functional equations
for the weight-enumeration of permutations avoiding the consecutive patterns [1,2,3,4] and [1,3,2,4],
the input
gives the output