← All problems

Weak-excedance mid-points and cycle descents

2 years old · traced to

Let SnS_n be the set of permutations of [n][n]. Consider the statistic counting weak excedances that are also mid-points of a decreasing subsequence of length 33 (Statistic 373373), and let the cycle descent number be Statistic 317317.

Weak-excedance mid-point conjecture. The number of weak excedances that are also mid-points of a decreasing subsequence of length 33 (Statistic 373373) is equidistributed with the cycle descent number (Statistic 317317) and thus exhibits the cyclic sieving phenomenon under involutions with 2n−12^{n-1} fixed points.

This is stated among the paper's conjectured cyclic-sieving instances and was tested up to n=10n=10; the paper supplies no proof or resolution in the provided material.

References
  1. Ashleigh Adams, Jennifer Elder, Nadia Lafrenière, Erin McNicholas, Jessica Striker and Amanda Welch, “Cyclic sieving on permutations – an analysis of maps and statistics in the FindStat database”, arXiv:2402.16251 (2025).

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.