Fast Lagrange inversion, with an application to factorial numbers
نویسنده
چکیده
Niederhausen, H., Fast Lagrange inversion, with an application to factorial numbers, Discrete Mathematics 104 (1992) 99-110. Suppose /3(t) and y(t) are a pair of compositional inverse formal powerseries. Lagrange inversion expresses the coefficient oft” in y(t)” in terms of the coefficient of tC” in /c?(t)-“. ‘Fast Lagrange inversion’ calculate the latter for invertible power series with nonzero quadratic term, using only positive powers of /?. The result is given for multivariate series, and illustrated by a bivariate generalization of Stirling numbers.
منابع مشابه
q-Catalan Numbers
q-analogs of the Catalan numbers c', = (I/(n + I))($) are studied from the viewpoint of Lagrange inversion. The first, due to Carhtz, corresponds to the Andrews-Gessel-Garsia q-Lagrange inversion theory, satisfies a nice recurrence relation and counts inversions of Catalan words. The second, tracing back to Mac Mahon, arise from Krattenthaler's and Gessel and Stanton's q-Lagrange inversion form...
متن کاملThe effect of inversion times on the minimum signal intensity of the contrast agent concentration using inversion recovery t1-weighted fast imaging sequence
Background :Inversion recovery (IR) pulse sequences can generate T1-weighted images with a different range of inversion time (TI) to suppress or null the signal intensity (SI) for a specified tissue. In this study, we aimed to investigate the effect of TI values on the concentration of the contrast agent, which leads to a minimum signal intensity, using an inversion recovery T1-weighted 3-dim...
متن کاملClosed form solution of the maximum entropy equations with application to fast radio astronomical image formation
In this paper we analyze the maximum entropy image deconvolution. We show that given the Lagrange multiplier a closed form can be obtained for the image parameters. Using this solution we are able to provide better understanding of some of the known behavior of the maximum entropy algorithm. The solution also yields a very efficient implementation of the maximum entropy deconvolution technique ...
متن کاملMatrix Decomposition of the Unified Generalized Stirling Numbers and Inversion of the Generalized Factorial Matrices
In this paper, we give a matrix decomposition method used to calculate unified generalized Stirling numbers in an explicit, non-recursive mode, and some of its applications. Then, we define generalized factorial matrices which may be regarded as a generalization in the form of the Vandermonde matrices, and presents some of their properties — in particular, triangular matrix factors of the inver...
متن کاملFast multidimensional Bernstein-Lagrange algorithms
In this paper we present two fast algorithms for the Bézier curves and surfaces of an arbitrary dimension. The first algorithm evaluates the Bernstein-Bézier curves and surfaces at a set of specific points by using the fast Bernstein-Lagrange transformation. The second algorithm is an inversion of the first one. Both algorithms reduce the initial problem to computation of some discrete Fourier ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 104 شماره
صفحات -
تاریخ انتشار 1992