A Sage package for computing congruence schemes
This package accompanies the paper On congruence schemes for constant terms and their applications [S22].
The basic usage of this package is indicated in Section 4 of that paper.
- Armin Straub (2021/10): Initial implementation
- The underlying ideas and algorithms for computing congruence schemes were first described by Eric Rowland and Reem Yassawi [RY15] and extended by Eric Rowland and Doron Zeilberger [RZ14].
- As part of his 2019 master's thesis, Joel Henningsen (under the guidance of Armin Straub) implemented a subset of these algorithms in Sage. The performance and design lessons learned from Joel's work have benefitted the present code.
- 2023/09: Adjusted code to work with SageMath 10.1 (the implementation of PolyDict changed considerably), breaking compatibility with earlier versions of SageMath.
[RZ14] Eric Rowland and Doron Zeilberger (2014). A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences. Journal of Difference Equations and Applications, 20(7), 973-988. DOI
|congruenceschemes.py||60.57 KB||Sage package||415|
This package is also available at https://github.com/arminstraub/congruenceschemes.
Note that the package is somewhat preliminary and likely has rough edges—please report any issues to firstname.lastname@example.org.