The Pólya-Chebotarev problem and inverse polynomial images

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


Consider the problem, usually called the Pólya-Chebotarev problem, of finding a continuum in the complex plane including some given points such that the logarithmic capacity of this continuum is minimal. We prove that each connected inverse image T-1n([-1,1]) of a polynomial Tn is always the solution of a certain Pólya-Chebotarev problem. By solving a nonlinear system of equations for the zeros of T2n, we are able to construct polynomials Tn with a connected inverse image.

Original languageEnglish
Pages (from-to)80-94
Number of pages15
JournalActa Mathematica Hungarica
Issue number1
Publication statusPublished - Feb 2014


  • 30C10
  • 41A21
  • analytic Jordan arc
  • inverse polynomial image
  • logarithmic capacity
  • Pólya-Chebotarev problem


Dive into the research topics of 'The Pólya-Chebotarev problem and inverse polynomial images'. Together they form a unique fingerprint.

Cite this