如何生成所有可能的有理 Wilf-Zeilberger 形式?

Shaoshi Chen, Christoph Koutschan, Yisen Wang
{"title":"如何生成所有可能的有理 Wilf-Zeilberger 形式?","authors":"Shaoshi Chen, Christoph Koutschan, Yisen Wang","doi":"arxiv-2405.02430","DOIUrl":null,"url":null,"abstract":"Wilf-Zeilberger pairs are fundamental in the algorithmic theory of Wilf and\nZeilberger for computer-generated proofs of combinatorial identities.\nWilf-Zeilberger forms are their high-dimensional generalizations, which can be\nused for proving and discovering convergence acceleration formulas. This paper\npresents a structural description of all possible rational such forms, which\ncan be viewed as an additive analog of the classical Ore-Sato theorem. Based on\nthis analog, we show a structural decomposition of so-called multivariate\nhyperarithmetic terms, which extend multivariate hypergeometric terms to the\nadditive setting.","PeriodicalId":501033,"journal":{"name":"arXiv - CS - Symbolic Computation","volume":"117 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"How to generate all possible rational Wilf-Zeilberger forms?\",\"authors\":\"Shaoshi Chen, Christoph Koutschan, Yisen Wang\",\"doi\":\"arxiv-2405.02430\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wilf-Zeilberger pairs are fundamental in the algorithmic theory of Wilf and\\nZeilberger for computer-generated proofs of combinatorial identities.\\nWilf-Zeilberger forms are their high-dimensional generalizations, which can be\\nused for proving and discovering convergence acceleration formulas. This paper\\npresents a structural description of all possible rational such forms, which\\ncan be viewed as an additive analog of the classical Ore-Sato theorem. Based on\\nthis analog, we show a structural decomposition of so-called multivariate\\nhyperarithmetic terms, which extend multivariate hypergeometric terms to the\\nadditive setting.\",\"PeriodicalId\":501033,\"journal\":{\"name\":\"arXiv - CS - Symbolic Computation\",\"volume\":\"117 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-05-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Symbolic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2405.02430\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Symbolic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2405.02430","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

Wilf-Zeilberger 对是 Wilf 和 Zeilberger 算法理论中用于计算机生成组合同一性证明的基础。Wilf-Zeilberger 形式是它们的高维概括,可用于证明和发现收敛加速公式。本文介绍了所有可能的有理形式的结构描述,可以将其视为经典奥雷-萨托定理的加法类比。在此基础上,我们展示了所谓多元超算术项的结构分解,它将多元超几何项扩展到了加法环境中。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
How to generate all possible rational Wilf-Zeilberger forms?
Wilf-Zeilberger pairs are fundamental in the algorithmic theory of Wilf and Zeilberger for computer-generated proofs of combinatorial identities. Wilf-Zeilberger forms are their high-dimensional generalizations, which can be used for proving and discovering convergence acceleration formulas. This paper presents a structural description of all possible rational such forms, which can be viewed as an additive analog of the classical Ore-Sato theorem. Based on this analog, we show a structural decomposition of so-called multivariate hyperarithmetic terms, which extend multivariate hypergeometric terms to the additive setting.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Synthesizing Evolving Symbolic Representations for Autonomous Systems Introducing Quantification into a Hierarchical Graph Rewriting Language Towards Verified Polynomial Factorisation Symbolic Regression with a Learned Concept Library Active Symbolic Discovery of Ordinary Differential Equations via Phase Portrait Sketching
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1