Abstract
A matrix is lonesum if it can be uniquely reconstructed from its row and column sums. Brewbaker computed the number of m×n binary lonesum matrices. Kaneko defined the poly-Bernoulli numbers of an integer index, and showed that the number of m×n binary lonesum matrices is equal to the mth poly-Bernoulli number of index -n. In this paper, we are interested in q-ary lonesum matrices. There are two types of lonesumness for q-ary matrices, namely strongly and weakly lonesum. We first study strongly lonesum matrices: We compute the number of m×nq-ary strongly lonesum matrices, and provide a generalization of Kaneko’s formulas by deriving the generating function for the number of m×nq-ary strongly lonesum matrices. Next, we study weakly lonesum matrices: We show that the number of forbidden patterns for q-ary weakly lonesum matrices is infinite if q⩾5, and construct some forbidden patterns for q=3,4. We also suggest an open problem related to ternary and quaternary weakly lonesum matrices.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
