A Recursive Relation for Bipartition Numbers
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909228795428864 |
|---|---|
| author | Lin, Yen-Chi Roger Pan, Shu-Yen |
| author_facet | Lin, Yen-Chi Roger Pan, Shu-Yen |
| contents | We establish a recursive relation for the bipartition number $p_2(n)$ which might be regarded as an analogue of Euler's recursive relation for the partition number $p(n)$. Two proofs of the main result are proved in this article. The first one is using the generating function, and the second one is using combinatoric objects (called ``symbols'') created by Lusztig for studying representation theory of finite classical groups. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_14851 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Recursive Relation for Bipartition Numbers Lin, Yen-Chi Roger Pan, Shu-Yen Combinatorics Representation Theory 05A17, 11P87, 20C33 We establish a recursive relation for the bipartition number $p_2(n)$ which might be regarded as an analogue of Euler's recursive relation for the partition number $p(n)$. Two proofs of the main result are proved in this article. The first one is using the generating function, and the second one is using combinatoric objects (called ``symbols'') created by Lusztig for studying representation theory of finite classical groups. |
| title | A Recursive Relation for Bipartition Numbers |
| topic | Combinatorics Representation Theory 05A17, 11P87, 20C33 |
| url | https://arxiv.org/abs/2406.14851 |