Two-summand criterion for Laurent series over semidomains
Two-summand criterion for Laurent series over semidomains
Let be an additively reduced and additively atomic semidomain, and let denote the set of additive atoms of and its multiplicative unit group. For a Laurent series , write for its support. Two-summand criterion. The following statements are equivalent:
- .
- Every with can be expressed as the sum of at most two multiplicative irreducibles.
- There exists such that every with can be expressed as the sum of at most multiplicative irreducibles.
This proposed refinement characterizes exactly when a uniform finite bound on the number of multiplicative irreducible summands improves to the bound two. The source presents it as a conjectural refinement motivated by the established upper bound of three summands; no resolution is supplied.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Nathan Kaplan and Harold Polo, “A Goldbach theorem for Laurent series semidomains”, arXiv:2312.14888 (2025).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.