{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:01:32Z","timestamp":1753884092215},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8598,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0166-218x(90)90018-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"25-40","source":"Crossref","is-referenced-by-count":22,"title":["On minimum matrix representation of closure operations"],"prefix":"10.1016","volume":"26","author":[{"given":"F.E.","family":"Bennett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90018-8_BIB1","first-page":"580","article-title":"Dependency structures of data base relationship","volume":"74","author":"Armstrong","year":"1974"},{"key":"10.1016\/0166-218X(90)90018-8_BIB2","doi-asserted-by":"crossref","unstructured":"F.E. Bennett, Concerning pairwise balanced designs with prime power block sizes, Contemp. Math., (to appear).","DOI":"10.1090\/conm\/111\/1079735"},{"key":"10.1016\/0166-218X(90)90018-8_BIB3","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0095-8956(81)90067-8","article-title":"Almost resolvable decomposition of K\u2217n","volume":"30","author":"Bennett","year":"1981","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(90)90018-8_BIB4","series-title":"Design Theory","author":"Beth","year":"1985"},{"key":"10.1016\/0166-218X(90)90018-8_BIB5","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0097-3165(79)90105-5","article-title":"Optimal packings of K4's into a Kn","volume":"26","author":"Brouwer","year":"1979","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0166-218X(90)90018-8_BIB6","series-title":"Res. Rept. ZW123\/79","article-title":"The number of mutually orthogonal Latin squares \u2014 a table up to order 10 000","author":"Brouwer","year":"1979"},{"key":"10.1016\/0166-218X(90)90018-8_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(77)90037-1","article-title":"Group divisible designs with block-size four","volume":"20","author":"Brouwer","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(90)90018-8_BIB8","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1137\/0601012","article-title":"Candidate keys and antichains","volume":"1","author":"Demetrovics","year":"1980","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(90)90018-8_BIB9","first-page":"247","article-title":"On the equivalence of candidate keys with Sperner systems","volume":"4","author":"Demetrovics","year":"1979","journal-title":"Acta Cybernet."},{"key":"10.1016\/0166-218X(90)90018-8_BIB10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0166-218X(85)80003-2","article-title":"Minimum matrix representation of closure operations","volume":"11","author":"Demetrovics","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(90)90018-8_BIB11","first-page":"383","article-title":"A complete census of (10,3,2)-block designs and of Mendelsohn triple systems of order ten I, Mendelsohn triple systems without repeated blocks","author":"Ganter","year":"1977","journal-title":"Proceedings 7th Manitoba Conference on Numerical Mathematics and Computing"},{"key":"10.1016\/0166-218X(90)90018-8_BIB12","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(75)90040-0","article-title":"Balanced incomplete block designs and related designs","volume":"11","author":"Hanani","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(90)90018-8_BIB13","first-page":"49","article-title":"Some remarks on pairwise balanced designs","volume":"165","author":"Lenz","year":"1984","journal-title":"Mitt. Math. Sem. Giessen"},{"key":"10.1016\/0166-218X(90)90018-8_BIB14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.2307\/1967920","article-title":"Euler squares","volume":"23","author":"MacNeish","year":"1922","journal-title":"Ann. of Math."},{"key":"10.1016\/0166-218X(90)90018-8_BIB15","first-page":"18","article-title":"Constructions and uses of pairwise balanced designs","volume":"55","author":"Wilson","year":"1974","journal-title":"Mathematical Centre Tracts"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X90900188?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X90900188?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:50:43Z","timestamp":1555116643000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X90900188"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["0166218X90900188"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90018-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}