The Lyndon-permutation dimension conjecture for feasible regions
Statement
Let be the set of permutons, and let denote the feasible region of pattern densities for permutations of size at most . Let be the set of Lyndon permutations of size at most .
Lyndon-permutation dimension conjecture. The feasible region contains an open ball of dimension .
The previously known lower bound came from the set of -indecomposable permutations, while an algebraic-variety argument gives the upper bound . The conjecture asserts that this upper bound is attained; the source notes that computations confirm it for small .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.