Rainbow-partition conjecture for meandric partners
Rainbow-partition conjecture for meandric partners
Let be a positive integer. A meandric partner of a partition is a partition such that the associated meandric system is a meander, equivalently such that . Let be the rainbow partition of , whose blocks are , together with a possible singleton block at when is odd. Let denote the Kreweras complementation map, and consider the orbit . Rainbow-partition conjecture. The orbit of under Kreweras complementation is exactly the set of partitions in having the largest number of meandric partners. Numerical experiments support this conjecture, which was also motivated by an idea raised in earlier work. By symmetry, the partitions in the orbit have the same number of meandric partners; determining whether there are any others with the same maximum remains open.
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
I. P. Goulden, Alexandru Nica and Doron Puder, “Asymptotics for a Class of Meandric Systems, via the Hasse Diagram of NC(n)”, arXiv:1708.05188 (2020).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.