Proposal of a generating function of partition sequences
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913794762997760 |
|---|---|
| author | Ando, Masanori |
| author_facet | Ando, Masanori |
| contents | In this paper, we introduce the generating functions of partition sequences. Partition sequences have a one-to-one correspondence with partitions. Therefore, the generating function has no multiplicity and appears meaningless initially. However, we show that using a matrix can give meaning to the coefficients and preserve valuable information about partitions. We also introduce some restrictions on partitions suitable for these generating functions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_10791 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Proposal of a generating function of partition sequences Ando, Masanori Combinatorics In this paper, we introduce the generating functions of partition sequences. Partition sequences have a one-to-one correspondence with partitions. Therefore, the generating function has no multiplicity and appears meaningless initially. However, we show that using a matrix can give meaning to the coefficients and preserve valuable information about partitions. We also introduce some restrictions on partitions suitable for these generating functions. |
| title | Proposal of a generating function of partition sequences |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2504.10791 |