The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Let M be a commutative cancellative monoid. The set Δ(M), which consists of all positive integers which are distances between consecutive factorization lengths of elements in M, is a widely studied object in the theory of nonunique factorizations. If M is a Krull monoid with cyclic class group of order n ≥ 3, then it is well-known that Δ(M) ⊆ {1,..., n-2}. Moreover, equality holds for this containment when each class contains a prime divisor from M. In this note, we consider the question of determining...
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 set
is 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 ...
Download Results (CSV)