The equivalence conjecture for ordinary and signed peak-count positivity

From papers

Let V\mathcal{V} be a positive vertical path with uu up-steps and dd down-steps, let QQ be the set of quarter-planar paths with rr right-steps, ll left-steps, and vertical projection V\mathcal{V}, and let G1G_1 and G2G_2 be respectively the peak-count and signed peak-count generating functions over QQ. A polynomial is (x+1)(x+1)-positive when it belongs to N0[x+1]\mathbb{N}_0[x+1]. The equivalence conjecture. The polynomial G1G_1 is (x+1)(x+1)-positive if and only if G2G_2 is (x+1)(x+1)-positive. The conjecture was tested for u,d,r,l5u,d,r,l\leq 5 and is proposed because the signed generating function has an explicit parameter dependence; proving it would imply the preceding positivity conjecture.

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

William Kuszmaul, “Signed Enumeration of Upper-Right Corners in Path Shuffles”, arXiv:1510.00777 (2016).

Solutions 0

No solutions have been posted yet.