The pattern-avoidance inequalities conjecture for restricted-cycle permutations
Statement
For each , let count length- permutations avoiding the pattern whose cycle lengths belong to , and let count length- permutations avoiding whose cycle lengths belong to . Pattern-avoidance inequalities conjecture. For , one has
and
These inequalities are conjectured from numerical evidence in the cited tables; the supplied text does not establish them or report a resolution.
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.