ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be an nn-element poset, and let ∂\partial denote promotion on labelings of PP. Write deg⁡(∂)\deg(\partial) for its degree of noninvertibility.

Maximum noninvertibility conjecture. For any poset PP,

deg⁡(∂)≤(n+2)(n+1)6.\deg(\partial)\leq\frac{(n+2)(n+1)}{6}.

In other words, the degree of noninvertibility of promotion should be largest when PP is a chain. The stated value is attained for an nn-element chain, while the general inequality 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.