{"title":"关于有限集合的分离系统问题","authors":"T.J. Dickson","doi":"10.1016/S0021-9800(69)80011-6","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper we define a completely separating system of an <em>n</em>-set, an extension of the concept of a separating system introduced by Renyi [1] for use in certain information theoretic problems. We then consider the problem of finding the cardinality of a minimal completely separating system and show that this, considered as a function of <em>n</em>, is asymptotic to the cardinality of a minimal separating system.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 3","pages":"Pages 191-196"},"PeriodicalIF":0.0000,"publicationDate":"1969-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80011-6","citationCount":"45","resultStr":"{\"title\":\"On a problem concerning separating systems of a finite set\",\"authors\":\"T.J. Dickson\",\"doi\":\"10.1016/S0021-9800(69)80011-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper we define a completely separating system of an <em>n</em>-set, an extension of the concept of a separating system introduced by Renyi [1] for use in certain information theoretic problems. We then consider the problem of finding the cardinality of a minimal completely separating system and show that this, considered as a function of <em>n</em>, is asymptotic to the cardinality of a minimal separating system.</p></div>\",\"PeriodicalId\":100765,\"journal\":{\"name\":\"Journal of Combinatorial Theory\",\"volume\":\"7 3\",\"pages\":\"Pages 191-196\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1969-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80011-6\",\"citationCount\":\"45\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021980069800116\",\"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/S0021980069800116","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On a problem concerning separating systems of a finite set
In this paper we define a completely separating system of an n-set, an extension of the concept of a separating system introduced by Renyi [1] for use in certain information theoretic problems. We then consider the problem of finding the cardinality of a minimal completely separating system and show that this, considered as a function of n, is asymptotic to the cardinality of a minimal separating system.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
