ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix k and let λ∈Par⁡(k)k\text{ and let }\lambda\in\operatorname{Par}(k). A Dyck partition is a partition equipped with the Dyck-partition structure used in the paper; dp⁡k(dyck⁡(λ))\operatorname{dp}_k(\operatorname{dyck}(\lambda)) is the Dyck partition associated with λ\lambda. For a Dyck partition γ\gamma, R(γ)={νm(γ):0≤m≤ρ(γ)}R(\gamma)=\{\nu^m(\gamma):0\leq m\leq\rho(\gamma)\} is its associated chain, and Δ\Delta and defc⁡\operatorname{defc} are the paper's statistics.

Conjectured chain decomposition. There exists a sequence of Dyck partitions {γλ,i:i∈Z>0}\{\gamma_{\lambda,i}:i\in\mathbb{Z}_{>0}\} with strictly increasing sizes satisfying all five stated conditions: it contains dp⁡k(dyck⁡(λ))\operatorname{dp}_k(\operatorname{dyck}(\lambda)); its Δ\Delta values are weakly decreasing and then weakly increasing; all its elements have constant deficit statistic equal to

∑r=1ℓ(λ)−1(−1+λr)∑s=r+1ℓ(λ)λs;\sum_{r=1}^{\ell(\lambda)-1}(-1+\lambda_r)\sum_{s=r+1}^{\ell(\lambda)}\lambda_s;

for every d≥∣γλ,1∣d\geq|\gamma_{\lambda,1}|, exactly one element of the union of their chains has size dd; and the corresponding unions for λ\lambda and λ′\lambda' are nn-opposite in every size nn.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.