Tangential center problem in dimension zero

Mathematics – Dynamical Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

24 pages, 4 figures

Scientific paper

This paper is dedicated to the solution of the tangential center problem on 0-cycles: Given a polynomial $f\in\C[z]$ of degree $m$, denote $z_1(t),...,z_m(t)$ all algebraic functions defined by $f(z_k(t))=t$. Given integers $n_1,...,n_m$ such that $n_1+...+n_m=0$, find all polynomials $g\in\C[z]$ such that $n_1g(z_1(t))+...+n_mg(z_m(t))\equiv 0$. The classical Center-Focus Problem, or rather its tangential version in important non-trivial planar systems lead to the above problem. We prove the uniqueness of decompositions $f=f_1\circ...\circ f_d$, such that every $f_k$ is 2-transitive, monomial or a Chebyshev polynomial under the assumptions that in the above composition there is no merging of critical values. Under these assumptions, we give a complete (recursive) solution of the tangential center problem on 0-cycles. The recursive solution is obtained through three mechanisms: composition, primality and vanishing of the Newton-Girard component on projected cycles. The first mechanism was studied by Pakovich and Muzychuk and the authors among others in previous publications. The two later mechanisms are new.

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

Tangential center problem in dimension zero 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 Tangential center problem in dimension zero, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tangential center problem in dimension zero will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-263341

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