ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=SLn+1G=SL_{n+1}, let w0‾\underline{w_0} be a reduced decomposition of the longest word of the Weyl group, and let Λ+\Lambda^+ denote the set of dominant weights.

Alexeev–Brion conjecture. For every reduced decomposition w0‾\underline{w_0} and every λ∈Λ+\lambda\in\Lambda^+, the string polytope Qw0‾(λ)\mathcal{Q}_{\underline{w_0}}(\lambda) is a lattice polytope.

The paper states that this conjecture is false, so its asserted universal integrality fails for non-standard reduced decompositions. Alexeev and Brion are the attributed authors of the formulation; the candidate is therefore refuted.

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.