dc.contributor.author |
Mouze, A |
en |
dc.contributor.author |
Nestoridis, V |
en |
dc.contributor.author |
Papadoperakis, I |
en |
dc.contributor.author |
Tsirivas, N |
en |
dc.date.accessioned |
2014-06-06T06:51:42Z |
|
dc.date.available |
2014-06-06T06:51:42Z |
|
dc.date.issued |
2012 |
en |
dc.identifier.issn |
16179447 |
en |
dc.identifier.uri |
http://62.217.125.90/xmlui/handle/123456789/5647 |
|
dc.relation.uri |
http://www.scopus.com/inward/record.url?eid=2-s2.0-84863224402&partnerID=40&md5=9a462b89fdd774346710f36208d9fd87 |
en |
dc.subject |
Infinite denumerable procedure |
en |
dc.subject |
Runge Theorem |
en |
dc.subject |
Taylor series |
en |
dc.subject |
Universal series |
en |
dc.title |
Determination of a universal series |
en |
heal.type |
journalArticle |
en |
heal.publicationDate |
2012 |
en |
heal.abstract |
The known proofs for universal Taylor series do not determine a specipfic universal Taylor series. In the present paper, we isolate a specific universal Taylor series by modifying the proof in [30]. Thus we determine all Taylor coeffcients of a specific universal Taylor series on the disc or on a polygonal domain. Furthermore in non simply connected domains, when universal Taylor series exist, we can construct a sequence of specific rational functions converging to a universal function, provided the boundary is good enough. The solution uses an infinite denumerable procedure and a finite number of steps is not suffcient. However we solve a Runge's type problem in a finite number of steps. © 2012 Heldermann Verlag. |
en |
heal.journalName |
Computational Methods and Function Theory |
en |
dc.identifier.issue |
1 |
en |
dc.identifier.volume |
12 |
en |
dc.identifier.spage |
173 |
en |
dc.identifier.epage |
199 |
en |