Search arXivSearch

arXiv · math/0608674

Generalized Ismail's argument and $(f,g)$-expansion formula

Abstract

As further development of earlier works on the $(f,g)$-inversion, the present paper is devoted to the $(f,g)$-difference operator and the representation problem or an expansion formula of analytic functions. A recursive formula and the Leibniz formula for the $(f,g)$-difference operator of the product of two functions are established. The resulting expansion formula not only unifies the $q$-analogue of the Lagrange inversion formula of Gessel and Stanton (thus, a $q$-expansion formula of Liu) for $q$-series but also systematizes the "Ismail's argument". In the meantime, a rigorous analytic proof of the $(1-xy,x-y)$-expansion formula with respect to geometric series, along with a proof of the previously unknown fact that it is equivalent to a $q$-analogue of the Lagrange inversion formula due to Gessel and Stanton, is presented. As applications, new proofs of several well-known summation and transformation formulas are investigated.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xinrong Ma. 2006-08-29. Generalized Ismail's argument and $(f,g)$-expansion formula. https://arxiv.org/abs/math/0608674

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO