Existence of GCD's and Factorization in Rings of Non-Archimedean Entire Functions
classification
🧮 math.CV
math.RA
keywords
entirefunctionsringsnon-archimedeanalmostcommoncountabledetailed
read the original abstract
A detailed proof is given of the well-known facts that greatest common divisors exist in rings of non-Archimedean entire functions of several variables and that these rings of entire functions are almost factorial, in the sense that an entire function can be uniquely written as a countable product of irreducible entire functions.
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.