Bibliographic Details
| Title: |
Signed counting of partition matrices. |
| Authors: |
Chern, Shane1 (AUTHOR) chenxiaohang92@gmail.com, Fu, Shishuo1,2,3 (AUTHOR) fsshuo@cqu.edu.cn |
| Source: |
Journal of Combinatorial Theory - Series A. Oct2026, Vol. 223, pN.PAG-N.PAG. 1p. |
| Subjects: |
Matrices (Mathematics), Combinatorial enumeration problems |
| Abstract: |
We prove that the signed counting (with respect to the parity of the "inv" statistic) of partition matrices equals the cardinality of a subclass of inversion sequences. In the course of establishing this result, we introduce an interesting class of partition matrices called improper partition matrices. We further show that a subset of improper partition matrices is counted by the Motzkin numbers. Such an enumeration is established both analytically and bijectively, building upon a combinatorial mechanism involving weighted Motzkin paths. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Combinatorial Theory - Series A is the property of Academic Press Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
