mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Blogorrhea > carpetpool

Reply
 
Thread Tools
Old 2017-10-19, 00:32   #23
carpetpool
 
carpetpool's Avatar
 
"Sam"
Nov 2016

30910 Posts
Post

Quote:
Originally Posted by Dr Sardonicus View Post
Oops, slight oopsadaisy

I shouldn't have excluded the value n = 2. If n is even, you need an n-th root of -p rather than of p. This also assumes x^n + p or x^n - p is irreducible over the field of n-th roots of unity. Alas, that isn't always true (e.g. p = 2, n = 8).

If n is even, any extension defined by polynomial with constant term p which is irreducible in K[x] will fill the bill. if n is odd, an irreducible polynomial with constant term -p instead of p will do the job.
Let Kn be the the nth cyclotomic field (field of the nth roots of unity). For some Kn the class number h = 1. Most times, h > 1. In the case that h > 1, primes p = 1 (mod n) can be classified into two important categories:

polcyclo(n) is the nth cyclotomic polynomial

p is a norm of a principal ideal in Kn

there is no principal ideal with norm p in Kn

In the first case, we have elements w with norm p in Kn, we can write p as the norm of w (mod polcyclo(n)).

The second case this is false. Looking at the second case, we have a prime p where there is NO principal ideal with norm p in Kn. There is (should be) a field extension Kn/Q where there are elements in Kn/Q with norm p.

Like in the first case, we can (should be able to) write p as the norm of w (mod z). Here, z is a polynomial with similar properties to polcyclo(n).

What I am not sure is how to generate such polynomials z, which define a specific field extension of Kn, and how to embed them in polynomial sequences for other cyclotomic field extensions.

(The cyclotomic polynomials, form a sequences: 1, x+1, x^2+x+1, x^2+1, x^4+x^3+x^2+x+1, x^2-x-1, x^6+x^5+x^4+x^3+x^2+x+1, x^4+1, x^6+x^3+1, x^4-x^3+x^2-x+1,...)

What about sequences like the one above, except they are sequences of polynomials z1, z2, z3,... which define a field extension.

Please ask for more information, or further thoughts.

Thanks.
carpetpool is offline   Reply With Quote
Old 2017-10-19, 14:00   #24
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

345510 Posts
Default

Quote:
Originally Posted by carpetpool View Post
The second case this is false. Looking at the second case, we have a prime p where there is NO principal ideal with norm p in Kn. There is (should be) a field extension Kn/Q where there are elements in Kn/Q with norm p.
I refer you to the example I gave in post #4 to this thread.
Dr Sardonicus is offline   Reply With Quote
Old 2017-10-29, 23:47   #25
carpetpool
 
carpetpool's Avatar
 
"Sam"
Nov 2016

3·103 Posts
Post

In the field of the nth roots of unity (Kn), if q = p^k = 1 (mod n), q is the norm of a principal if k > 1. That is, in the field Kn, for a prime q = 1 (mod n), q^k (where k > 1) is the norm of a principal ideal. (If q^k = 1 (mod n) with k > 1, then q is not necessarily 1 (mod n) for this case to be true although in most cases it is.) For any base b > 0, b^(phi(n)) is the norm of a principal ideal.

For these two cases, let w be any element (polynomial).

If the norm of w mod polcyclo(n) = m is divisible by b^(phi(n)) for all n, is m/(b^(phi(n)) the norm of a principal ideal (in the field Kn), or can it be in the non-principal class (in the field Kn)?

If the norm of w mod polcyclo(n) = m is a perfect kth power (k > 1) for all n, is kth root of m the norm of a principal ideal (in the field Kn), or can it be in the non-principal class (in the field Kn)?

Any help, comments, suggestions please?

Thank you.
carpetpool is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Search for prime Gaussian-Mersenne norms (and G-M-cofactors) Cruelty Proth Prime Search 158 2020-07-31 22:23
Polynomials defining the same field as cyclotomic polynomial order 5 carpetpool Abstract Algebra & Algebraic Number Theory 0 2017-04-19 20:33
On polynomials without roots modulo small p fivemack Computer Science & Computational Number Theory 2 2015-09-18 12:54
Factorial modulo a prime axn Computer Science & Computational Number Theory 66 2011-09-01 21:55
modulo operation for polynomials? smslca Math 3 2011-04-18 17:18

All times are UTC. The time now is 14:39.

Fri Sep 18 14:39:00 UTC 2020 up 8 days, 11:49, 1 user, load averages: 1.67, 1.55, 1.48

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.