Lattice of Ideals of the Polynomial Ring over a Commutative Chain Ring
Xiang-dong Hou

TL;DR
This paper investigates the structure of ideals in polynomial rings over commutative chain rings, focusing on conditions for the quotient to be Frobenius and local, using modified Gr"obner bases and algorithms.
Contribution
It introduces algorithms based on a variation of Gr"obner bases to determine when polynomial ring quotients over chain rings are Frobenius and local.
Findings
Algorithms for identifying Frobenius quotients
Explicit criteria when the nilpotency is small
Enhanced understanding of ideal lattice structure
Abstract
Let be a commutative chain ring. We use a variation of Gr\"obner bases to study the lattice of ideals of . Let be a proper ideal of . We are interested in the following two questions: When is Frobenius? When is Frobenius and local? We develop algorithms for answering both questions. When the nilpotency of is small, the algorithms provide explicit answers to the questions.
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
TopicsCoding theory and cryptography · Commutative Algebra and Its Applications · Polynomial and algebraic computation
