Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem

Mathematics – Commutative Algebra

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages

Scientific paper

The classical Ritt's Theorems state several properties of univariate polynomial decomposition. In this paper we present new counterexamples to Ritt's first theorem, which states the equality of length of decomposition chains of a polynomial, in the case of rational functions. Namely, we provide an explicit example of a rational function with coefficients in Q and two decompositions of different length. Another aspect is the use of some techniques that could allow for other counterexamples, namely, relating groups and decompositions and using the fact that the alternating group A_4 has two subgroup chains of different lengths; and we provide more information about the generalizations of another property of polynomial decomposition: the stability of the base field. We also present an algorithm for computing the fixing group of a rational function providing the complexity over Q.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem 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 Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Building counterexamples to generalizations for rational functions of Ritt's decomposition theorem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-355944

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.