A Recursive Relation for Bipartition Numbers
Combinatorics
2024-06-24 v1 Representation Theory
Abstract
We establish a recursive relation for the bipartition number which might be regarded as an analogue of Euler's recursive relation for the partition number . 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.
Cite
@article{arxiv.2406.14851,
title = {A Recursive Relation for Bipartition Numbers},
author = {Yen-Chi Roger Lin and Shu-Yen Pan},
journal= {arXiv preprint arXiv:2406.14851},
year = {2024}
}