Binomial-count conjecture for parity differences of hit-huggers
Statement
Let and be odd integers satisfying
Consider the even and odd hit-huggers beginning with in . A hit-hugger is a permutation subject to the hit-hugging relation considered in the paper, and the even or odd designation refers to permutation parity. Binomial-count conjecture. The difference between the number of even and odd hit-huggers beginning with in equals the number of ways of choosing at most elements from a set of size . This gives an explicit combinatorial expression for the observed parity difference in the specified case; the supplied text gives no resolution, so the conjecture remains open.
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.