ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a symmetric polynomial in nn variables. Write each symmetrized monomial as a multiset [l1,…,ln][l_1,\ldots,l_n], and order symmetrized monomials by squeezing: s>ts>t when tt can be obtained from ss by repeated squeezing. For pp, let B(p)B(p) be the set of symmetrized monomials with nonzero coefficient, viewed as a poset under this order; call pp Haldane when B(p)B(p) has a maximum. Haldane's conjecture. Every homogeneous translation invariant symmetric polynomial is Haldane. The paper gives a counterexample, so the conjecture is disproved.

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.