The Dumont permutation enumeration conjecture for pattern 4132

About 22 years old · traced to

Let D2n2(4132)\frak D^2_{2n}(4132) denote the set of restricted Dumont permutations of the second kind of length 2n2n avoiding the pattern 41324132, and let CnC_n be the nnth Catalan number. The conjecture concerns the cardinality of this set.

Enumeration conjecture.

∣D2n2(4132)∣=Cn|\frak D^2_{2n}(4132)|=C_n

for n≥0n\ge 0.

The authors note that this would agree with the corresponding enumeration for 321321-avoiding restricted Dumont permutations. The statement was presented as unproved in the paper, although the supplied context reports that it was subsequently proved by Bóna and associated work.

References

Primary source

Alexander Burstein, “Restricted Dumont permutations”, arXiv:math/0402378 (2004).

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.