Applying computer algebra systems to study Chaundy-Bullard identities for the vector partition function with weight
Authors:
- 15 April 2024
- journal article
- Published by The Russian Academy of Sciences in Программирование
- No. 2,p. 79-83
Abstract
An algorithm for obtaining the Chaundy-Bullard identity for a vector partition function with weight that uses computer algebra methods is proposed. To automate this process in Maple, an algorithm was developed and implemented that calculates the values of the vector partition function with weight by finding non-negative solutions of systems of linear Diophantine equations that are used to form the identities involved. The algorithm’s input data is represented by the set of integer vectors that form a pointed lattice cone and by some point from this cone, and the Chaundy-Bullard identity for the vector partition function with weight is its output. The code involved is stored in the depository and is ready-to-use. An example demonstrating the algorithm’s operation is given.Keywords
This publication has 28 references indexed in Scilit:
- A Chaundy–Bullard type identity involving the Pochhammer symbolIndagationes Mathematicae, 2022
- Weighted Lattice Point Sums in Lattice Polytopes, Unifying Dehn–Sommerville and Ehrhart–MacdonaldDiscrete & Computational Geometry, 2020
- New Proofs of Chaundy–Bullard Identity in “The Problem of Points”The Mathematical Intelligencer, 2016
- Hypergeometric Solutions of First-Order Linear Difference Systems with Rational-Function Coefficients2015
- On a combinatorial sumIndagationes Mathematicae, 2015
- On an identity by Chaundy and Bullard. II. More historyIndagationes Mathematicae, 2013
- Vector partition functions and generalized dahmen and micchelli spacesTransformation Groups, 2010
- On vector partition functionsJournal of Combinatorial Theory, Series A, 1995
- Multidimensional Hadamard composition and sums with linear constraints on the summation indicesSiberian Mathematical Journal, 1989
- What Is Enumerative Combinatorics?1986