Conjectured chain decomposition of Dyck partitions
Statement
Fix . A Dyck partition is a partition equipped with the Dyck-partition structure used in the paper; is the Dyck partition associated with . For a Dyck partition , is its associated chain, and and are the paper's statistics.
Conjectured chain decomposition. There exists a sequence of Dyck partitions with strictly increasing sizes satisfying all five stated conditions: it contains ; its values are weakly decreasing and then weakly increasing; all its elements have constant deficit statistic equal to
for every , exactly one element of the union of their chains has size ; and the corresponding unions for and are -opposite in every size .
This conjecture is presented as a stronger structural generalization of the hook and almost-hook results. Its general validity is not established in the supplied text.
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.