Computer Science – Symbolic Computation
Scientific paper
2008-03-27
Finite Fields Appl. 12 (2006), no. 3, 403--412. MR2229324 (2007a:13024)
Computer Science
Symbolic Computation
13 pages. v2: added comment from reader and additional references
Scientific paper
10.1016/j.ffa.2005.08.004
A classical theorem by Ritt states that all the complete decomposition chains
of a univariate polynomial satisfying a certain tameness condition have the
same length. In this paper we present our conclusions about the generalization
of these theorem in the case of finite coefficient fields when the tameness
condition is dropped.
Gutierrez Jaime
Sevilla David
No associations
LandOfFree
On Ritt's decomposition Theorem in the case of finite fields 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 On Ritt's decomposition Theorem in the case of finite fields, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Ritt's decomposition Theorem in the case of finite fields will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-354382