ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn and cc be odd integers satisfying

n=2c+1.n=2c+1.

Consider the even and odd hit-huggers beginning with 11 in SnS_n. 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 11 in SnS_n equals the number of ways of choosing at most (c−3)/2(c-3)/2 elements from a set of size cc. 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 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.