Positivity conjecture for Newton-polytope support coefficients
Statement
For , write
where is the number of supports of and counts occurrences of the permutation pattern in . The coefficients are computed recursively by
with the same stability property when the final entry of is . Support-coefficient positivity conjecture. For any permutation , . This is presented as an analogue of Gao's conjecture; no general resolution is given.
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.