{"title":"某些二进制矩阵的枚举","authors":"Douglas E. Jackson, R.C. Entringer","doi":"10.1016/S0021-9800(70)80082-5","DOIUrl":null,"url":null,"abstract":"<div><p>An <em>m×n</em> (0, 1) matrix (<em>a<sub>ij</sub></em>) is said to be a * matrix iff <em>a<sub>ij</sub></em>=1 implies <em>a<sub>i′j′</sub></em>=1 for all (<em>i′, j′</em>) satisfying 1≤<em>i′<i, 1≤j′≤j</em>. * matrices with certain additional restrictions are counted and enumerations of random walks and decision patterns are obtained.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"8 3","pages":"Pages 291-298"},"PeriodicalIF":0.0000,"publicationDate":"1970-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80082-5","citationCount":"4","resultStr":"{\"title\":\"Enumeration of certain binary matrices\",\"authors\":\"Douglas E. Jackson, R.C. Entringer\",\"doi\":\"10.1016/S0021-9800(70)80082-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>An <em>m×n</em> (0, 1) matrix (<em>a<sub>ij</sub></em>) is said to be a * matrix iff <em>a<sub>ij</sub></em>=1 implies <em>a<sub>i′j′</sub></em>=1 for all (<em>i′, j′</em>) satisfying 1≤<em>i′<i, 1≤j′≤j</em>. * matrices with certain additional restrictions are counted and enumerations of random walks and decision patterns are obtained.</p></div>\",\"PeriodicalId\":100765,\"journal\":{\"name\":\"Journal of Combinatorial Theory\",\"volume\":\"8 3\",\"pages\":\"Pages 291-298\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1970-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0021-9800(70)80082-5\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021980070800825\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021980070800825","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An m×n (0, 1) matrix (aij) is said to be a * matrix iff aij=1 implies ai′j′=1 for all (i′, j′) satisfying 1≤i′<i, 1≤j′≤j. * matrices with certain additional restrictions are counted and enumerations of random walks and decision patterns are obtained.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
