next up previous contents index
Next: Exponent Lists Up: Data Types in GRÖBNER Previous: Rational Functions


Finite Fields

Type Name:
The implementation of finite fields is not ``complete'' in the sense that it does not comprise the general case of finite fields of order tex2html_wrap_inline6506 but only the case of finite fields of order p, namely tex2html_wrap_inline6510 (p prime). We choose tex2html_wrap_inline6514 as representation for tex2html_wrap_inline6510 . Thus, elements of a finite field are represented as positive integers and arithmetic is done modulo a prime number, which is stored in the global variable modulus_ . Modular arithmetic is used from SACLIB.

windsteiger wolfgang
Thu Sep 3 14:50:07 MDT 1998