The sharpness conjecture for strongly increasing-pattern-avoiding permutations
Statement
Let be a positive integer and set . Write for the set of permutations of length whose square strongly avoids the increasing pattern .
Sharpness conjecture.
The conjecture asserts that the upper bound from the monotone-pattern theorem is always attained. Constructions are given for small values of , including , but the general case remains open.
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.