{"paper":{"title":"Edge Ideals of Prime Ideal Graphs over Finite Rings: Ordinary Powers, Fiber Cones, and Linear Powers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Prime ideal graphs of finite rings are complete split graphs whose edge ideal powers have explicit generators and are polymatroidal.","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Tabinda Rasheed, Wang Yao","submitted_at":"2026-04-21T12:35:40Z","abstract_excerpt":"Let $R$ be a finite commutative ring with identity and let $P$ be a proper prime ideal of $R$. The prime ideal graph $\\Gamma_P(R)$ has vertex set $R\\setminus\\{0\\}$, where two distinct vertices $x$ and $y$ are adjacent if and only if $xy\\in P$. We prove that prime ideal graphs form a ring-realizable subfamily of complete split graphs. More precisely, if $m=|P|$, $q=|R/P|$, then $q$ is a prime power and $\\Gamma_P(R)\\cong K_{m-1}\\vee \\overline{K}_{m(q-1)}$. We also prove a realization theorem showing that every complete split graph of this form arises from a prime ideal of a finite commutative ri"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that Γ_P(R) ≅ K_{|P|-1} ∨ K-bar_{|R|-|P|}, and a monomial x^α y^β belongs to the minimal generators of I(Γ_P(R))^n if and only if |α| + |β| = 2n, |β| ≤ n, and 0 ≤ α_i ≤ n for all i.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"R is a finite commutative ring with identity and P is a proper prime ideal; this finiteness and the prime property are used to obtain the explicit isomorphism and the counting formulas.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Prime ideal graphs are complete split graphs whose edge ideal powers have explicit minimal monomial generators satisfying exponent conditions, are polymatroidal with linear resolutions, and have computable analytic spread.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Prime ideal graphs of finite rings are complete split graphs whose edge ideal powers have explicit generators and are polymatroidal.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b23fee55ffd435a6cdfc28ef95459968db64efed4caef555970eede29f72c120"},"source":{"id":"2604.19408","kind":"arxiv","version":3},"verdict":{"id":"d1313ddd-4dff-418a-9836-333f16bdeb8f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T21:37:31.042953Z","strongest_claim":"We prove that Γ_P(R) ≅ K_{|P|-1} ∨ K-bar_{|R|-|P|}, and a monomial x^α y^β belongs to the minimal generators of I(Γ_P(R))^n if and only if |α| + |β| = 2n, |β| ≤ n, and 0 ≤ α_i ≤ n for all i.","one_line_summary":"Prime ideal graphs are complete split graphs whose edge ideal powers have explicit minimal monomial generators satisfying exponent conditions, are polymatroidal with linear resolutions, and have computable analytic spread.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"R is a finite commutative ring with identity and P is a proper prime ideal; this finiteness and the prime property are used to obtain the explicit isomorphism and the counting formulas.","pith_extraction_headline":"Prime ideal graphs of finite rings are complete split graphs whose edge ideal powers have explicit generators and are polymatroidal."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.19408/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-20T03:01:35.866263Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"729270eeb0145b918b5c11a20be73e2869561530f3e4a98db60f2ff991f19fa6"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"41f98122f9e7d5a9ad31ee148f446a9162a3cf5d54a54b0a4e2cbea066cb8c7a"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}