Exponential Puiseux semirings are additive submonoids of [Formula: see text] generated by almost all of the nonnegative powers of a positive rational number, and they are natural generalizations of rational cyclic semirings. In this paper, we investigate some of the factorization invariants of exponential Puiseux semirings and briefly explore the connections of these properties with semigroup-theoretical invariants. Specifically, we provide exact formulas to compute the catenary degrees of these monoids and show that minima and maxima of their sets of distances are always attained at Betti elements. Additionally, we prove that sets of lengths of atomic exponential Puiseux semirings are almost arithmetic progressions with a common bound, while unions of sets of lengths are arithmetic progressions. We conclude by providing various characterizations of the atomic exponential Puiseux semirings with finite omega functions; in particular, we completely describe them in terms of their presentations.
A semidomain is an additive submonoid of an integral domain that is closed under multiplication and contains the identity element. Although atomicity and divisibility in integral domains have been systematically investigated for more than thirty years, the same aspects in the more general context of semidomains have been considered just recently. Here we study subatomicity in the context of semidomains, focusing on whether certain subatomic properties ascend from a semidomain to its polynomial extension and its Laurent polynomial extension. We investigate factorization and divisibility notions generalizing that of atomicity. First, we consider the Furstenberg property, which is due to P. Clark and motivated by the work of H. Furstenberg on the infinitude of primes. Then we consider the almost atomic and quasi-atomic properties, both introduced by J. G. Boynton and J. Coykendall in their study of divisibility in integral domains.
A numerical monoid is a cofinite additive submonoid of the nonnegative integers, while a Puiseux monoid is an additive submonoid of the nonnegative cone of the rational numbers. Using that a Puiseux monoid is an increasing union of copies of numerical monoids, we prove that some of the factorization invariants of these two classes of monoids are related through a limiting process. This allows us to extend results from numerical to Puiseux monoids. We illustrate the versatility of this technique by recovering various known results about Puiseux monoids.
A subset S of an integral domain R is called a semidomain if the pairs (S, +) and (S, •) are semigroups with identities; additionally, we say that S is additively reduced provided that S contains no additive inverses. Given an additively reduced semidomain S and a torsion-free monoid M , we denote by S[M ] the semidomain consisting of polynomial expressions with coefficients in S and exponents in M ; we refer to these objects as additively reduced monoid semidomains. We study the factorization properties of additively reduced monoid semidomains. Specifically, we determine necessary and sufficient conditions for an additively reduced monoid semidomain to be a bounded factorization semidomain, a finite factorization semidomain, and a unique factorization semidomain. We also provide large classes of semidomains with full and infinity elasticity. Throughout the paper we provide examples aiming to shed some light upon the arithmetic of additively reduced semidomains.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.