AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (294.9 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Generating functions for circular sums of binomial products

Marta Na Chen1Wenchang Chu2( )
School of Mathematics and Statistics, Zhoukou Normal University, Zhoukou, China; chennamarta@zknu.edu.cn
Via Dalmazio Birago 9/E, Lecce 73100, Italy
Show Author Information

Abstract

By means of the recursive construction method, we examine a class of multiple sums (with a free variable " x") for circular products of binomial coefficients. They are first expressed as coefficients of bivariate rational functions. Then the rational generating functions are determined by deftly employing Knuth's bracket calculus, resultants of polynomials, and Hadamard products of rational functions.

CLC number: Primary 11B39, Secondary 05A15, 11B65

References

【1】
【1】
 
 
AIMS Mathematics
Pages 28182-28206

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Chen MN, Chu W. Generating functions for circular sums of binomial products. AIMS Mathematics, 2025, 10(12): 28182-28206. https://doi.org/10.3934/math.20251239

515

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 17 August 2025
Revised: 20 November 2025
Accepted: 25 November 2025
Published: 01 December 2025
©2025 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)