ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PkP_k be the set of permutons, and let clPkclP_k denote the feasible region of pattern densities for permutations of size at most kk. Let Lk\mathcal{L}_k be the set of Lyndon permutations of size at most kk.

Lyndon-permutation dimension conjecture. The feasible region clPkclP_k contains an open ball of dimension ∣Lk∣|\mathcal{L}_k|.

The previously known lower bound came from the set of ⊕\oplus-indecomposable permutations, while an algebraic-variety argument gives the upper bound ∣Lk∣|\mathcal{L}_k|. The conjecture asserts that this upper bound is attained; the source notes that computations confirm it for small kk.

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.