Computer Science – Logic in Computer Science
Scientific paper
2009-03-06
Computer Science
Logic in Computer Science
12 pages
Scientific paper
A meadow is a commutative ring with a total inverse operator satisfying
0^{-1}=0. We show that the class of finite meadows is the closure of the class
of Galois fields under finite products. As a corollary, we obtain a unique
representation of minimal finite meadows in terms of finite prime fields.
Bethke Inge
Rodenburg Piet
Sevenster Arjen
No associations
LandOfFree
The structure of finite meadows does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The structure of finite meadows, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The structure of finite meadows will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-135853