Go Back > Math Stuff > Abstract Algebra & Algebraic Number Theory

Thread Tools
Old 2020-04-18, 06:06   #1
carpetpool's Avatar
Nov 2016

22·79 Posts
Post Field mapping to fractional elements

Suppose we have a number field K = Q(ℽ) where ℽ is a root of the polynomial f of degree d.

Define C(f)n to be the n-th coefficient of f. Suppose we have integers a and q where f(a) = 0 mod q (i.e. a is a root of f mod q, or factorization over finite field of order q if q is prime).

Then define the following two polynomials:

 M(f,x)_l = \sum_{i=1}^{l} { C(f)_i x^{l-i} }

 R(f,x)_(a,q) = \sum_{i=1}^{d} Mod[({ M(f,x)_i x^{d-i}}, q)]

Let N(e) be the norm of any element e ∈ OK, the ring of integers in the field K.

Suppose that S = R(f,ℽ)(a,q) + e ∈ OK,

Let T be the minimal polynomial of S.

Prove that T*q is a polynomial with integer coefficients (the leading coefficient is q).

Suppose that N(S) = q'/q. Show that there is an element j ∈ OK with N(j) = q*q'.

Furthermore, is there a field mapping from S to j. That is, if we know and element j with norm N(j), can we easily find an element S (using the summation formulas above) such that N(S) = q'/q? Or if we are given S and N(S) = q'/q, find j such that N(j) = q*q'.

Last fiddled with by carpetpool on 2020-04-18 at 06:12
carpetpool is offline   Reply With Quote

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Orders of consecutive elements does not exceed floor(sqrt(p)) carpetpool carpetpool 0 2020-03-12 02:50
how is it, primes in the security elements? hal1se Miscellaneous Math 2 2018-08-30 02:06
Small search of cycles with odd and even elements Drdmitry Aliquot Sequences 0 2011-12-14 13:50
The Elements science_man_88 Science & Technology 24 2010-07-26 12:29
Fractional Calculus nibble4bits Math 2 2008-01-11 21:46

All times are UTC. The time now is 21:34.

Tue Oct 27 21:34:09 UTC 2020 up 47 days, 18:45, 2 users, load averages: 2.59, 2.07, 1.95

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.