Displaying 61 – 80 of 114

Showing per page

On the Anderson-Badawi ω R [ X ] ( I [ X ] ) = ω R ( I ) conjecture

Peyman Nasehpour (2016)

Archivum Mathematicum

Let R be a commutative ring with an identity different from zero and n be a positive integer. Anderson and Badawi, in their paper on n -absorbing ideals, define a proper ideal I of a commutative ring R to be an n -absorbing ideal of R , if whenever x 1 x n + 1 I for x 1 , ... , x n + 1 R , then there are n of the x i ’s whose product is in I and conjecture that ω R [ X ] ( I [ X ] ) = ω R ( I ) for any ideal I of an arbitrary ring R , where ω R ( I ) = min { n : I is an n -absorbing ideal of R } . In the present paper, we use content formula techniques to prove that their conjecture is true, if one of the following conditions...

On the approximate roots of polynomials

Janusz Gwoździewicz, Arkadiusz Płoski (1995)

Annales Polonici Mathematici

We give a simplified approach to the Abhyankar-Moh theory of approximate roots. Our considerations are based on properties of the intersection multiplicity of local curves.

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...

Currently displaying 61 – 80 of 114