Finite Generation in Polynomial Semirings

Abstract

We study the semiring N0[α] as an additive monoid where α is a positive real algebraic number. In the atomic case, the atoms of N0[α] are precisely the powers αn up to a certain nonnegative integer n, and finite generation is governed by divisibility of the minimal polynomial by a negative-tail polynomial. Our first main result gives a complete characterization when the minimal polynomial has the form mα(X)=pα(X)-c with c∈N. Our second main result shows that finite generation forces α to be a weak Perron number. As an application, we analyze cubic minimal polynomials and obtain a partial classification of rank-3 monoids N0[α] by generation and factorization type, including coefficient constraints, non--length-factoriality results for a large family, and examples with prescribed numbers of atoms.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…