Previous Page 2

Displaying 21 – 28 of 28

Showing per page

Practical Aurifeuillian factorization

Bill Allombert, Karim Belabas (2008)

Journal de Théorie des Nombres de Bordeaux

We describe a simple procedure to find Aurifeuillian factors of values of cyclotomic polynomials Φ d ( a ) for integers a and d > 0 . Assuming a suitable Riemann Hypothesis, the algorithm runs in deterministic time O ˜ ( d 2 L ) , using O ( d L ) space, where L log ( a + 1 ) .

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 21 – 28 of 28

Previous Page 2