Displaying 101 – 120 of 169

Showing per page

On some issues concerning polynomial cycles

Tadeusz Pezda (2013)

Communications in Mathematics

We consider two issues concerning polynomial cycles. Namely, for a discrete valuation domain R of positive characteristic (for N 1 ) or for any Dedekind domain R of positive characteristic (but only for N 2 ), we give a closed formula for a set 𝒞 Y C L ( R , N ) of all possible cycle-lengths for polynomial mappings in R N . Then we give a new property of sets 𝒞 Y C L ( R , 1 ) , which refutes a kind of conjecture posed by W. Narkiewicz.

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

Ordres de Gorenstein

Martine Picavet-L'hermitte (1987)

Annales scientifiques de l'Université de Clermont. Mathématiques

Prüfer rings with involution

Ismail M. Idris (2003)

Czechoslovak Mathematical Journal

The concept of a Prüfer ring is studied in the case of rings with involution such that it coincides with the corresponding notion in the case of commutative rings.

Currently displaying 101 – 120 of 169