Full-dimensionality conjecture for feasible regions of consecutive permutation patterns
Full-dimensionality conjecture for feasible regions of consecutive permutation patterns
Let denote the feasible region of density vectors of consecutive permutation patterns of size at most , and let be the set of Lyndon permutations of size at most . The preceding results place inside an algebraic variety of dimension . Full-dimensionality conjecture. The feasible region is full-dimensional inside a manifold of dimension . This conjecture asserts that the upper bound supplied by the Lyndon permutations is sharp; computations indicate that this holds for small values of , while the general case remains open.
Sources & referencesView supporting material
Primary source
Jacopo Borga and Raul Penaguiao, “The feasible region for consecutive patterns of permutations is a cycle polytope”, arXiv:1910.02233 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.