Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2501.03189 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
Sommario:
- We develop a search algorithm for systems of $q$-difference equations satisfied by Andrews-Gordon type double series. We then couple the search algorithm with Euler's algorithm for finding infinite products to narrow the search space. We exemplify some findings of the algorithm, along with their proofs. We also explain some of the double series in a base partition and moves framework.