Papers › Standard pairs for monomial ideals in semigroup rings
Standard pairs for monomial ideals in semigroup rings
Laura Felicia Matusevich, Byeongsu Yu
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We extend the notion of standard pairs to the context of monomial ideals in semigroup rings. Standard pairs can be used as a data structure to encode such monomial ideals, providing an alternative to generating sets that is well suited to computing intersections, decompositions, and multiplicities. We give algorithms to compute standard pairs from generating sets and vice versa and make all of our results effective. We assume that the underlying semigroup ring is positively graded, but not necessarily normal. The lack of normality is at the root of most challenges, subtleties, and innovations in this work.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections