Displaying 121 – 140 of 226

Showing per page

On the arithmetic of arithmetical congruence monoids

M. Banister, J. Chaika, S. T. Chapman, W. Meyerson (2007)

Colloquium Mathematicae

Let ℕ represent the positive integers and ℕ₀ the non-negative integers. If b ∈ ℕ and Γ is a multiplicatively closed subset of b = / b , then the set H Γ = x | x + b Γ 1 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 H Γ 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...

On the Delta set of a singular arithmetical congruence monoid

Paul Baginski, Scott T. Chapman, George J. Schaeffer (2008)

Journal de Théorie des Nombres de Bordeaux

If a and b are positive integers with a b and a 2 a mod b , then the set M a , b = { x : x a mod b or x = 1 } is a multiplicative monoid known as an arithmetical congruence monoid (or ACM). For any monoid M with units M × and any x M M × we say that t is a factorization length of x if and only if there exist irreducible elements y 1 , ... , y t of M and x = y 1 y t . Let ( x ) = { t 1 , ... , t j } be the set of all such lengths (where t i < t i + 1 whenever i < j ). The Delta-set of the element x is defined as the set of gaps in ( x ) : Δ ( x ) = { t i + 1 - t i : 1 i < k } and the Delta-set of the monoid M is given by x M M × Δ ( x ) . We consider the Δ ( M ) when M = M a , b is an ACM with...

On the Frobenius number of a modular Diophantine inequality

José Carlos Rosales, P. Vasco (2008)

Mathematica Bohemica

We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality a x mod b x , with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.

On the graph labellings arising from phylogenetics

Weronika Buczyńska, Jarosław Buczyński, Kaie Kubjas, Mateusz Michałek (2013)

Open Mathematics

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.

On the Jacobson radical of graded rings

Andrei V. Kelarev (1992)

Commentationes Mathematicae Universitatis Carolinae

All commutative semigroups S are described such that the Jacobson radical is homogeneous in each ring graded by S .

On the saturated numerical semigroups

Sedat Ilhan, Meral Süer (2016)

Open Mathematics

In this study, we characterize all families of saturated numerical semigroups with multiplicity four. We also present some results about invariants of these semigroups.

Currently displaying 121 – 140 of 226