{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:55:59Z","timestamp":1766181359977,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A recurrence relation is derived for the rank (over most fields)  of the set-inclusion matrices on a finite ground set.<\/jats:p>","DOI":"10.37236\/1590","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T21:07:17Z","timestamp":1578690437000},"source":"Crossref","is-referenced-by-count":9,"title":["A Note on the Ranks of Set-Inclusion Matrices"],"prefix":"10.37236","volume":"8","author":[{"given":"D.","family":"De Caen","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2001,6,16]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v8i1n5\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v8i1n5\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,18]],"date-time":"2020-01-18T00:17:44Z","timestamp":1579306664000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v8i1n5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6,16]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2001,1,1]]}},"URL":"https:\/\/doi.org\/10.37236\/1590","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2001,6,16]]},"article-number":"N5"}}