A bijection between strongly stable and totally symmetric partitions
Seth Ireland

TL;DR
This paper establishes a bijection between strongly stable partitions and totally symmetric partitions, revealing a structural correspondence that preserves key geometric properties, and connecting combinatorial partitions with algebraic ideals.
Contribution
It introduces the concept of strongly stable partitions and proves a bijection with totally symmetric partitions, linking combinatorial and algebraic structures.
Findings
Bijection preserves minimal bounding box side length
Strongly stable partitions correspond to strongly stable ideals
Connects combinatorial partitions with algebraic ideals
Abstract
Artinian monomial ideals in variables correspond to -dimensional partitions. We define -dimensional strongly stable partitions and show that they correspond to strongly stable ideals in variables. We show a bijection between strongly stable partitions and totally symmetric partitions which preserves the side length of the minimal bounding box.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Commutative Algebra and Its Applications · Algebraic structures and combinatorial models
