On principal ideals of triply-generated telescopic semigroups.
Let ℕ represent the positive integers and ℕ₀ the non-negative integers. If b ∈ ℕ and Γ is a multiplicatively closed subset of , then the set is a multiplicative submonoid of ℕ known as a congruence monoid. An arithmetical congruence monoid (or ACM) is a congruence monoid where Γ = ā consists of a single element. If is an ACM, then we represent it with the notation M(a,b) = (a + bℕ₀) ∪ 1, where a, b ∈ ℕ and a² ≡ a (mod b). A classical 1954 result of James and Niven implies that the only ACM...
If and are positive integers with and , then the setis a multiplicative monoid known as an arithmetical congruence monoid (or ACM). For any monoid with units and any we say that is a factorization length of if and only if there exist irreducible elements of and . Let be the set of all such lengths (where whenever ). The Delta-set of the element is defined as the set of gaps in : and the Delta-set of the monoid is given by . We consider the when is an ACM with...
We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality , with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.
We study semigroups of labellings associated to a graph. These generalise the Jukes-Cantor model and phylogenetic toric varieties defined in [Buczynska W., Phylogenetic toric varieties on graphs, J. Algebraic Combin., 2012, 35(3), 421–460]. Our main theorem bounds the degree of the generators of the semigroup by g + 1 when the graph has first Betti number g. Also, we provide a series of examples where the bound is sharp.
All commutative semigroups are described such that the Jacobson radical is homogeneous in each ring graded by .
In this study, we characterize all families of saturated numerical semigroups with multiplicity four. We also present some results about invariants of these semigroups.