Maximum Möbius value conjecture for rank-3 intervals in the matching pattern poset

From papers

Let UU and DD denote up and down steps, respectively, and let [P,Q][P,Q] be an interval in the matching pattern poset of Dyck paths. An interval has rank 33 when its endpoints differ in semilength by 33, and μ\mu denotes the Möbius function of this poset.

Rank-3 maximum conjecture. The maximum absolute value of the Möbius function on intervals of rank 33 is

(2n+1)n2,(2n+1)\cdot n^2,

attained by the interval

[U(UD)n1D,U(UD)n+2D].[U(UD)^{n-1}D,U(UD)^{n+2}D].

This conjecture is supported by computations; it predicts the extremal Möbius value among rank-3 intervals but does not assert uniqueness of the attaining interval.

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

Matteo Cervetti and Luca Ferrari, “Pattern avoidance in the matching pattern poset”, arXiv:2009.01024 (2020).

Solutions 0

No solutions have been posted yet.