{"paper":{"title":"A new proof for the partition algorithm of the annihilator varieties of highest weight modules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.RT","authors_text":"Jing Jiang, Yongzhi Luan, Zhanqiang Bai","submitted_at":"2026-06-10T08:23:06Z","abstract_excerpt":"Let $L(\\lambda)$ be a simple highest weight module of a classical Lie algebra $\\mathfrak{g}$ with highest weight $\\lambda-\\rho$, where $\\rho$ is half the sum of positive roots. Joseph proved that the associated variety of the annihilator ideal of $L(\\lambda)$ (also called the annihilator variety) is the Zariski closure of a nilpotent orbit in $\\mathfrak{g}^*$. Recently, Bai--Ma--Wang introduced a partition algorithm to describe this corresponding nilpotent orbit for a given highest weight module $L(\\lambda)$. In this paper, we present a new direct proof of Bai--Ma--Wang's partition algorithm u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11790","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.11790/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}