CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt182",{id:"formSmash:upper:j_idt182",widgetVar:"widget_formSmash_upper_j_idt182",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt189_j_idt195",{id:"formSmash:upper:j_idt189:j_idt195",widgetVar:"widget_formSmash_upper_j_idt189_j_idt195",target:"formSmash:upper:j_idt189:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

On rational approximation of algebraic functionsPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
2006 (English)In: Advances in Mathematics, ISSN 0001-8708, E-ISSN 1090-2082, Vol. 204, no 2, p. 448-480Article in journal (Refereed) Published
##### Abstract [en]

##### Place, publisher, year, edition, pages

2006. Vol. 204, no 2, p. 448-480
##### Keywords [en]

finite recursions; asymptotic ratio distribution; Pade approximation
##### National Category

Mathematics
##### Identifiers

URN: urn:nbn:se:su:diva-20604DOI: 10.1016/j.aim.2005.06.002OAI: oai:DiVA.org:su-20604DiVA, id: diva2:187130
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt657",{id:"formSmash:j_idt657",widgetVar:"widget_formSmash_j_idt657",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt674",{id:"formSmash:j_idt674",widgetVar:"widget_formSmash_j_idt674",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt689",{id:"formSmash:j_idt689",widgetVar:"widget_formSmash_j_idt689",multiple:true}); Available from: 2010-12-31 Created: 2007-11-28 Last updated: 2017-12-13Bibliographically approved

We construct a new scheme of approximation of any multivalued algebraic function f (z) by a sequence {r(n)(z)}(n is an element of N) of rational functions. The latter sequence is generated by a recurrence relation which is completely determined by the algebraic equation satisfied by f(z). Compared to the usual Pade approximation our scheme has a number of advantages, such as simple computational procedures that allow us to prove natural analogs of the Pade Conjecture and Nuttall's Conjecture for the sequence {r(n)(z)}(n is an element of N) in the complement CP1\D-f, where D-f is the union of a finite number of segments of real algebraic curves and finitely many isolated points. In particular, our construction makes it possible to control the behavior of spurious poles and to describe the asymptotic ratio distribution of the family {r(n)(z)}(n is an element of N). As an application we settle the so-called 3-conjecture of Egecioglu et al. dealing with a 4-term recursion related to a polynomial Riemann Hypothesis

doi
urn-nbn$(function(){PrimeFaces.cw("Tooltip","widget_formSmash_j_idt1991",{id:"formSmash:j_idt1991",widgetVar:"widget_formSmash_j_idt1991",showEffect:"fade",hideEffect:"fade",showDelay:500,hideDelay:300,target:"formSmash:altmetricDiv"});});

CiteExport$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt2044",{id:"formSmash:lower:j_idt2044",widgetVar:"widget_formSmash_lower_j_idt2044",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:exportLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt2045_j_idt2047",{id:"formSmash:lower:j_idt2045:j_idt2047",widgetVar:"widget_formSmash_lower_j_idt2045_j_idt2047",target:"formSmash:lower:j_idt2045:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});