8 problems
- 0 votes0 replies0 views
k-multi-layered maximizer conjecture at a root-of-unity specialization
Fix , let be a -th root of unity, and let denote the principal specialization at . Define … and…
- 0 votes0 replies0 views
Doubly layered maximizer conjecture at the principal specialization q = -1
Doubly layered maximizer conjecture. For every , all permutations reaching the maximum are doubly layered permutations. Thus, there is a limit
- 0 votes0 replies0 views
Albert et al.'s bounded-layer conjecture for layered permutation density maximizers
A layered permutation is a permutation containing neither nor as a pattern. Let be a layered permutation with layers of sizes , and let a sequen…
- 0 votes0 replies0 views
Packing-complexity conjecture for layered permutations with an initial decreasing block
Packing-complexity conjecture. Under these hypotheses, there exists such that
- 0 votes0 replies0 views
Fixed-block approximation conjecture for layered permutations
Fixed-block approximation conjecture. If , then there exists a sequence of layered permutations with blocks such that…
- 0 votes0 replies2 views
Generalized Myers conjecture on packing densities of monotone permutations
Generalized Myers conjecture. For every ,
- 0 votes0 replies0 views
The eventual layered-pattern dominance conjecture
Let denote the number of permutations of length avoiding a pattern . Let and be patterns of the same length, with layered…
- 0 votes0 replies0 views
The layered-pattern conjecture for the most easily avoided pattern
A pattern is layered if it is a direct sum of decreasing permutations. For each positive integer , consider all patterns of length and, for sufficiently large , the numbe…