The toggle-buildability conjecture for signed peak-count generating functions
Statement
Let be the signed peak-count generating function for the quarter-planar paths under consideration. Define , and call a polynomial toggle-buildable if it is a linear combination of elements of with non-negative coefficients. A polynomial is -positive when it belongs to . The toggle-buildability conjecture. The generating function is toggle-buildable exactly when it is -positive. The conjecture was tested for 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.