2000 character limit reached
Algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank (1406.3523v4)
Published 13 Jun 2014 in math.RA and cs.SC
Abstract: We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime or prime power. The main algorithm is based on basis representation of finite rings which is computed via Hermite and Smith normal forms.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
