Intrinsic factorization of ideals in Dedekind domains
classification
🧮 math.AC
keywords
dedekindfactorizationidealsintrinsicalgorithmdependdomaindomains
read the original abstract
We present a generalization of a polynomial factorization algorithm that works with ideals in maximal orders of global function fields. The method presented in this paper is intrinsic in the sense that it does not depend on the embedding of the ring of polynomials into the Dedekind domain in question.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.