Back to Forum | View unanswered posts | View active topics



Post new topic Reply to topic  Page 1 of 1
  [ 2 posts ] 
  Print view | E-mail friend Previous topic | Next topic 
Author Message
jack
 Post subject: question about finite fields
PostPosted: Mon Apr 14, 2014 1:36 pm 
Hello,


when defining a ring over a finite field, e.g.
Code:
ring rng = (49,a),x,dp;
basering;
//   # ground field : 49
//   primitive element : a
//   minpoly        : 1*a^3+6*a^2+4*a^0
//   number of vars : 1
//        block   1 : ordering dp
//                  : names    x
//        block   2 : ordering C


howto
- check, that the coefficient ring is a (finite) field
- get a generator of the finite coefficient field
- get the cardinality of the finite coefficient field
(without parsing the string output above)

?


Report this post
Top
  
Reply with quote  
malex
 Post subject: Re: question about finite fields
PostPosted: Wed Apr 16, 2014 5:51 am 

Joined: Tue Jun 23, 2009 10:33 pm
Posts: 51
Location: Kaiserslautern
i would try something along the following lines :

Code:
if ( !( (char(basering) == 0) || (npars(basering) > 1) || ( (npars(basering) == 1)&&(string(minpoly) == "0") ) ) )
{
  "field is finite..."; 
}


ps: here i don't consider the case of integer coeff. rings

for the cardinality one will need the degree of minpoly: just watch the powers: par(1)^i until reduction happen.

O.


Report this post
Top
 Profile  
Reply with quote  
Display posts from previous:  Sort by  
Post new topic Reply to topic  Page 1 of 1
  [ 2 posts ] 

You can post new topics in this forum
You can reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum

It is currently Fri May 13, 2022 11:02 am
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group