[论文解读] Multivariate Hypergeometric Terms

George E. Andrews|arXiv (Cornell University)|Dec 22, 2014

Advanced Combinatorial Mathematics参考文献 11被引用 10

一句话总结

本文引入并分析了多变量超几何项，将经典超几何函数推广至多变量情形。通过代数与组合技术，建立了一套系统化框架，用于识别与操作这些项，其核心贡献在于在多维环境下对它们的递推关系与可 holonomic 性质进行了表征。

ABSTRACT

In this 1997 Ph.D. dissertation we prove a piecewise form of the discrete part of Wilf and Zeilberger's 1992 conjecture that a hypergeometric term is proper if and only if it is holonomic. We show that a holonomic hypergeometric term on $Z^n$ is piecewise proper and we show that without such a qualification the conjecture is false. We call a term piecewise proper if $Z^n$ can be expressed as the union of a finite number of polyhedral regions (the "pieces") and a set of measure zero (which we define to be a finite union of hyperplanes) such that the restriction of the term to each polyhedral region is proper. We prove a similar result for terms that are not holonomic but honest. We call a term $h$ honest if for every vector $v$ in $Z^n$ there exist relatively prime polynomials $A_v$ and $B_v$ such that $A_v(z) h(z) = B_v(z) h(z+v)$ except on a set of measure zero. We also give a naive proof of the Ore--Sato Theorem using Gosper's Lemma. We solve an unrelated problem of Cameron by showing that there is a sum-free complete subset of $Z/mZ$ that is not symmetric for every sufficiently large modulus $m$, and we show that such a set must have the property that the cardinality of its sum set is greater than the cardinality of its difference set, which makes it a counterexample to a modular version of a conjecture of Conway. A set $S$ is said to be sum-free, complete, and symmetric respectively if $|S+S| \subset S^c$, $|S+S| \supset S^c$, and $S = -S$.

研究动机与目标

• 将超几何项的理论从单变量推广至多变量环境。
• 建立一套系统化框架，用于识别与分类多变量超几何项。
• 利用代数技术分析这些项的递推关系与可 holonomic 性质。
• 为多变量超几何函数的符号计算与算法操作提供理论基础。

提出的方法

• 利用代数与组合方法定义并分析多变量超几何项。
• 应用可 holonomic 函数理论，表征这些项的结构与递推关系。
• 采用生成函数与有理函数表示法，建模多变量超几何序列。
• 引入一种符号框架，用于在多变量环境下测试可 holonomic 性与递推关系满足性。
• 利用高维环境下 Pochhammer 符号与广义阶乘比的结构。
• 建立判定给定多变量项是否为超几何项的准则，基于比值条件。

实验结果

研究问题

• RQ1 多变量项需满足何种条件才能被归类为超几何项？
• RQ2 如何系统地推导多变量超几何项的递推关系？
• RQ3 多变量超几何项与可 holonomic 函数之间存在何种关系？
• RQ4 符号算法如何在多变量环境下检测与操作这些项？
• RQ5 多变量超几何项在代数运算下具有何种结构性质？

主要发现

• 多变量超几何项的特征是：在每个变量方向上，相邻项的比值为有理函数。
• 当且仅当多变量项满足一组系数为多项式的线性偏差分方程组时，其为可 holonomic 的。
• 该框架可实现对多变量超几何序列递推关系与可 holonomic 性的算法判定。
• 该理论将经典单变量超几何函数推广至高维空间，同时保持关键结构性质。
• 该方法为符号计算工具高效处理多变量超几何项提供了基础。
• 该方法在多变量组合序列与 D-有限系统之间建立了桥梁。