ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G2G_2 be the signed peak-count generating function for the quarter-planar paths under consideration. Define B={1}∪{Bin⁡j(2j)/2:j∈N}={1}∪{Bin⁡j(2j−1):j∈N}B=\{1\}\cup\{\operatorname{Bin}^{j}(2j)/2:j\in\mathbb{N}\}=\{1\}\cup\{\operatorname{Bin}^{j}(2j-1):j\in\mathbb{N}\}, and call a polynomial toggle-buildable if it is a linear combination of elements of BB with non-negative coefficients. A polynomial is (x+1)(x+1)-positive when it belongs to N0[x+1]\mathbb{N}_0[x+1]. The toggle-buildability conjecture. The generating function G2G_2 is toggle-buildable exactly when it is (x+1)(x+1)-positive. The conjecture was tested for r,l,u,d≤5r,l,u,d\leq 5 and concerns whether two positivity descriptions of the signed peak-count polynomial coincide.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.