Reversion of power series and the extended Raney coefficients
نویسندگان
چکیده
منابع مشابه
Power Series with Integral Coefficients
Let f(z) be a function, meromorphic in \z\ < 1 , whose power series around the origin has integral coefficients. In [5], Salem shows that if there exists a nonzero polynomial p(z) such that p(z)f(z) is in H, or else if there exists a complex number a, such that l/(f(z)—a) is bounded, when |JS| is close to 1, then f(z) is rational. In [2], Chamfy extends Salem's results by showing that if there ...
متن کاملanalysis of power in the network society
اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...
15 صفحه اولA fast algorithm for reversion of power series
We give an algorithm for reversion of formal power series, based on an efficient way to evaluate the Lagrange inversion formula. Our algorithm requires O(n1/2(M(n)+MM(n1/2))) operations where M(n) and MM(n) are the costs of polynomial and matrix multiplication respectively. This matches an algorithm of Brent and Kung, but we achieve a constant factor speedup whose magnitude depends on the polyn...
متن کاملOn Nilpotent Power Series with Nilpotent Coefficients
Antoine studied conditions which are connected to the question of Amitsur of whether or not a polynomial ring over a nil ring is nil, introducing the notion of nil-Armendariz rings. Hizem extended the nil-Armendariz property for polynomial rings onto powerseries rings, say nil power-serieswise rings. In this paper, we introduce the notion of power-serieswise CN rings that is a generalization of...
متن کاملOn the Coefficients of a Fibonacci Power Series
We give an explicit description of the coefficients of the formal power series (1− x)(1− x)(1 − x)(1− x)(1 − x)(1− x) · · ·. In particular, we show that all the coefficients are equal to −1, 0 or 1. The Fibonacci numbers are defined by the recurrence relation Fn+2 = Fn+1+ Fn for n ≥ 0, and the initial conditions F0 = 0, F1 = 1. Consider the infinite product A(x) = ∏ k≥2(1− x k) = (1− x)(1 − x)(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1997
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-97-01781-9