贝尔数及相关序列的微分超越性:一种伽罗瓦理论方法
Differential transcendence of Bell numbers and relatives: a Galois theoretic approach
AI总结:
本研究利用差分伽罗瓦理论证明了生成函数微分超越性的一般性结论,将其应用于多类生成函数(含贝尔数等Sheffer类示例),为Pak-Yeliussizov猜想提供了具体证据。
摘要:
2003年,Klazar证明了贝尔数序列的普通生成函数在0点亚纯函数域$\u2102(\{t\})$上是微分超越的。我们表明,Klazar的结果是一类普遍现象的实例,可利用差分伽罗瓦理论以简洁方式证明。我们阐述该理论的主要原理,以证明一个关于$\u2102(\{t\})$上微分超越性的一般性结论,并将其应用于许多其他(无限类)生成函数示例,其中Klazar所考虑的示例仅为非常特殊的情况。我们的大多数示例属于Sheffer类,该类在哑演算中得到了尤其深入的研究。所有这些示例都为Pak-Yeliussizov猜想提供了具体证据:若一个序列的普通生成函数和指数生成函数均满足带多项式系数的非线性微分方程,则该序列必然满足带多项式系数的线性递推关系。
英文摘要:
In 2003 Klazar proved that the ordinary generating function of the sequence of Bell numbers is differentially transcendental over the field $\mathbb{C}(\{t\})$ of meromorphic functions at $0$. We show that Klazar's result is an instance of a general phenomenon that can be proven in a compact way using difference Galois theory. We present the main principles of this theory in order to prove a general result about differential transcendence over $\mathbb{C}(\{t\})$, that we apply to many other (infinite classes of) examples of generating functions, including as very special cases the ones considered by Klazar. Most of our examples belong to Sheffer's class, well studied notably in umbral calculus. They all bring concrete evidence in support to the Pak-Yeliussizov conjecture, according to which a sequence whose both ordinary and exponential generating functions satisfy nonlinear differential equations with polynomial coefficients necessarily satisfies a linear recurrence with polynomial coefficients.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。