Experimenting with the Garsia-Milne Involution Principle
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916644075339776 |
|---|---|
| author | Ekhad, Shalosh B. Zeilberger, Doron |
| author_facet | Ekhad, Shalosh B. Zeilberger, Doron |
| contents | In 1981, Adriano Garsia and Steve Milne found the first bijective proof of the celebrated Rogers-Ramanujan identities. To achieve this feat, they invented a versatile tool that they called the Involution Principle. In this note we revisit this useful principle from a very general perspective, independent of its application to specific combinatorial identities, and will explore its complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_18061 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Experimenting with the Garsia-Milne Involution Principle Ekhad, Shalosh B. Zeilberger, Doron Combinatorics In 1981, Adriano Garsia and Steve Milne found the first bijective proof of the celebrated Rogers-Ramanujan identities. To achieve this feat, they invented a versatile tool that they called the Involution Principle. In this note we revisit this useful principle from a very general perspective, independent of its application to specific combinatorial identities, and will explore its complexity. |
| title | Experimenting with the Garsia-Milne Involution Principle |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2501.18061 |