Image conjecture for catabolizable tableaux
Image conjecture for catabolizable tableaux
Let be a sequence of rectangles. Let be the restriction of the inverse rigged-configuration bijection to the indicated subset, and let denote its image. Let be the set of -catabolizable tableaux. Image conjecture. If is dominant, then
and is a bijection sending to . This would connect rigged configurations, Littlewood–Richardson tableaux, and catabolizable tableaux through a common statistic-preserving map.
Sources & referencesView supporting material
Primary source
Anatol N. Kirillov and Mark Shimozono, “A generalization of the Kostka-Foulkes polynomials”, arXiv:math/9803062 (1998).
Progress summary
The original work proves only special cases of the conjecture, and no later public proof or counterexample was found.
Shimozono and Weyman’s 1998 work connects generalized Kostka polynomials with catabolizable tableaux and charge. The full identification , together with the asserted statistic-preserving bijection, is not established there.
Known results
- Shimozono and Weyman, 1998: a general proof strategy leaves open the required sign-reversing involution preserving catabolizability; the conjecture is proved in special cases, including the Kostka–Foulkes case.
- Shimozono, 1998: for rectangle sequences linearly ordered by containment, the related conjecture is proved and is obtained as the charge-generating function of -catabolizable tableaux.
- The retrieved rigged-configuration literature records related polynomial identities as conjectural, not as a proof of the stated image equality.
August 2026 scan
No retrieved source reports a later proof, counterexample, verification, withdrawal, or AI/model claim concerning this exact image conjecture.
Current status (as of August 2026): Special cases and related ordered-rectangle results are known, but the full image equality and the resulting bijection remain open.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.