Lewis's odd-length alternating-pattern enumeration conjecture for 2134, 4312, 3214 and 4123
Let be the set of permutations of that avoid the pattern and are alternating. Lewis's conjecture. For and , we have
This predicts equal enumerations for odd-length alternating permutations avoiding each of the four specified patterns and avoiding . The statement was posed by Lewis, and the supplied text does not specify whether it has been resolved.
References
Primary source
Joanna N. Chen, William Y. C. Chen and Robin D. P. Zhou, “On Pattern Avoiding Alternating Permutations”, arXiv:1212.2697 (2012).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.