Page 1

Displaying 1 – 4 of 4

Showing per page

Polynomial cycles in certain local domains

T. Pezda (1994)

Acta Arithmetica

1. Let R be a domain and f ∈ R[X] a polynomial. A k-tuple x , x , . . . , x k - 1 of distinct elements of R is called a cycle of f if f ( x i ) = x i + 1 for i=0,1,...,k-2 and f ( x k - 1 ) = x . The number k is called the length of the cycle. A tuple is a cycle in R if it is a cycle for some f ∈ R[X]. It has been shown in [1] that if R is the ring of all algebraic integers in a finite extension K of the rationals, then the possible lengths of cycles of R-polynomials are bounded by the number 7 7 · 2 N , depending only on the degree N of K. In this note we consider...

Prime ideal factorization in a number field via Newton polygons

Lhoussain El Fadil (2021)

Czechoslovak Mathematical Journal

Let K be a number field defined by an irreducible polynomial F ( X ) [ X ] and K its ring of integers. For every prime integer p , we give sufficient and necessary conditions on F ( X ) that guarantee the existence of exactly r prime ideals of K lying above p , where F ¯ ( X ) factors into powers of r monic irreducible polynomials in 𝔽 p [ X ] . The given result presents a weaker condition than that given by S. K. Khanduja and M. Kumar (2010), which guarantees the existence of exactly r prime ideals of K lying above p . We further specify...

Currently displaying 1 – 4 of 4

Page 1