Loehr–Warrington Square Paths Conjecture

At least 9 years old · documented by

Let Prefn{\cal P}ref_n be the set of all preference functions on nn cars. For a preference function PrPr, let area⁡(Pr)\operatorname{area}(Pr) be its area, dinv⁡(Pr)\operatorname{dinv}(Pr) its diagonal-inversion number, and ides⁡(σ(Pr))\operatorname{ides}(\sigma(Pr)) the inverse descent set of its word. Let Fides⁡(σ(Pr))F_{\operatorname{ides}(\sigma(Pr))} denote the corresponding fundamental quasisymmetric function, and let ∇\nabla and pnp_n denote the nabla operator and the nnth power-sum symmetric function.

Loehr–Warrington's Square Paths Conjecture.

(−1)n−1∇pn=∑Pr∈Prefntarea⁡(Pr)qdinv⁡(Pr)Fides⁡(σ(Pr)).(-1)^{n-1} \nabla p_n = \sum_{Pr \in {\cal P}ref_n} t^{\operatorname{area}(Pr)} q^{\operatorname{dinv}(Pr)} F_{\operatorname{ides}(\sigma(Pr))}.

The paper states that its main result proves this conjecture, using enumerations of preference functions and their relation to parking functions. Thus the conjecture is solved by the paper.

References

Primary source

Emily Sergel Leven, “A proof of the Square Paths Conjecture”, arXiv:1601.06249 (2016).

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.