Inclusion Matrices and Chains
Abstract
Given integers , , and such that , let be the inclusion matrix of -subsets vs. -subsets of a -set. We modify slightly the concept of standard tableau to study the notion of rank of a finite set of positive integers which was introduced by Frankl. Utilizing this, a decomposition of the poset into symmetric skipless chains is given. Based on this decomposition, we construct an inclusion matrix, denoted by , which is row-equivalent to . Its Smith normal form is determined. As applications, Wilson's diagonal form of is obtained as well as a new proof of the well known theorem on the necessary and sufficient conditions for existence of integral solutions of the system due to Wilson. Finally we present anotherinclusion matrix with similar properties to those of which is in some way equivalent to .
Keywords
Cite
@article{arxiv.0709.3144,
title = {Inclusion Matrices and Chains},
author = {E. Ghorbani and G. B. Khosrovshahi and Ch. Maysoori and M. Mohammad-Noori},
journal= {arXiv preprint arXiv:0709.3144},
year = {2007}
}
Comments
Accepted for publication in Journal of Combinatorial Theory, Series A