2000 character limit reached
Factoring formal power series over principal ideal domains
Published 25 Jul 2011 in math.AC and math.NT | (1107.4860v4)
Abstract: We provide an irreducibility test and factoring algorithm (with some qualifications) for formal power series in the unique factorization domain $R[[X]]$, where $R$ is any principal ideal domain. We also classify all integral domains arising as quotient rings of $R[[X]]$. Our main tool is a generalization of the $p$-adic Weierstrass preparation theorem to the context of complete filtered commutative rings.
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.