Rainbow-partition conjecture for meandric partners

From papers

Let nn be a positive integer. A meandric partner of a partition πNC(n)\pi\in\mathrm{NC}(n) is a partition ρNC(n)\rho\in\mathrm{NC}(n) such that the associated meandric system M(π,ρ)M(\pi,\rho) is a meander, equivalently such that dH(π,ρ)=n1d_H(\pi,\rho)=n-1. Let rnr_n be the rainbow partition of {1,,n}\{1,\ldots,n\}, whose blocks are {1,n},{2,n1},\{1,n\},\{2,n-1\},\ldots, together with a possible singleton block at (n+1)/2(n+1)/2 when nn is odd. Let KK denote the Kreweras complementation map, and consider the orbit {Kj(rn):0j<n}\{K^j(r_n):0\leq j<n\}. Rainbow-partition conjecture. The orbit of rnr_n under Kreweras complementation is exactly the set of partitions in NC(n)\mathrm{NC}(n) 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 nn 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

No solutions have been posted yet.