Journal of Combinatorial Theory最新文献

筛选
英文 中文
Memorial note 纪念注意
Journal of Combinatorial Theory Pub Date : 1969-11-01 DOI: 10.1016/S0021-9800(69)80028-1
John Riordan
{"title":"Memorial note","authors":"John Riordan","doi":"10.1016/S0021-9800(69)80028-1","DOIUrl":"10.1016/S0021-9800(69)80028-1","url":null,"abstract":"","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 3","pages":"Pages 286-287"},"PeriodicalIF":0.0,"publicationDate":"1969-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80028-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81725085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A remark on B4-Sequences 关于b4序列的评述
Journal of Combinatorial Theory Pub Date : 1969-11-01 DOI: 10.1016/S0021-9800(69)80024-4
Bernt Lindström
{"title":"A remark on B4-Sequences","authors":"Bernt Lindström","doi":"10.1016/S0021-9800(69)80024-4","DOIUrl":"10.1016/S0021-9800(69)80024-4","url":null,"abstract":"","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 3","pages":"Pages 276-277"},"PeriodicalIF":0.0,"publicationDate":"1969-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80024-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88397486","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
A generalization of a combinatorial theorem of macaulay 麦考利的一个组合定理的推广
Journal of Combinatorial Theory Pub Date : 1969-11-01 DOI: 10.1016/S0021-9800(69)80016-5
G.F. Clements , B. Lindström
{"title":"A generalization of a combinatorial theorem of macaulay","authors":"G.F. Clements ,&nbsp;B. Lindström","doi":"10.1016/S0021-9800(69)80016-5","DOIUrl":"10.1016/S0021-9800(69)80016-5","url":null,"abstract":"<div><p>Let <em>E</em> denote the set of all vectors of dimension <em>n</em> (<em>n</em>≥2) with non-negative integral components. <em>E</em> is ordered in the lexicographic order. Let <em>E<sub>v</sub></em> denote the subset of all vectors in <em>E</em> with component sum <em>v</em>. If <em>H<sub>v</sub></em> denotes any subset of <em>E<sub>v</sub></em> let <em>LH<sub>v</sub></em> denote the set of the →<em>H<sub>v</sub></em>→ last elements in <em>E<sub>v</sub></em>, where →<em>H<sub>v</sub></em>→ is the number of elements of <em>H<sub>v</sub></em>. Let <em>PH<sub>v</sub></em> denote the set of all vectors of <em>E</em><sub><em>v</em>+1</sub>, which are obtained by the addition of 1 to a component of a vector in <em>H<sub>v</sub></em>. In [3] Macaulay proved the inclusion <em>P</em>(<em>LH<sub>v</sub></em>) ⊂ <em>L</em>(<em>PH<sub>v</sub></em>). Sperner gave a shorter proof in [4]. Let <em>k</em><sub>1</sub> ≤ <em>k</em><sub>2</sub> ≤ … ≤ <em>k<sub>n</sub></em> be given positive integers and let <em>F</em> denote the set of all vectors (<em>a</em><sub>1</sub>,…,<em>a<sub>n</sub></em>) with integer components and 0 ≤ <em>a<sub>i</sub></em> ≤ <em>k<sub>i</sub> i</em> = 1,…, <em>n</em>. We shall prove Macaulay's inclusion for subsets <em>H<sub>v</sub></em> of <em>F<sub>v</sub></em> even if the operators <em>P</em> and <em>L</em> are restricted to operate in <em>F</em>. This will follow from our theorem. As another application we prove a generalization of the main result in [2]. By a different method Katona proved the theorem when <em>k</em><sub>1</sub> = <em>k</em><sub>2</sub> = … = <em>k<sub>n</sub></em> = 1 (see [1, Theorem 1]).</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 3","pages":"Pages 230-238"},"PeriodicalIF":0.0,"publicationDate":"1969-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80016-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90272670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 223
On furnishing Room squares 关于布置房间正方形
Journal of Combinatorial Theory Pub Date : 1969-11-01 DOI: 10.1016/S0021-9800(69)80022-0
R.C. Mullin , E. Nemeth
{"title":"On furnishing Room squares","authors":"R.C. Mullin ,&nbsp;E. Nemeth","doi":"10.1016/S0021-9800(69)80022-0","DOIUrl":"10.1016/S0021-9800(69)80022-0","url":null,"abstract":"<div><p>The authors show that for <em>v</em>=6<em>t</em>+1=<em>p<sup>n</sup>, p</em> a prime, there exists a Room square of order <em>v</em>+1.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 3","pages":"Pages 266-272"},"PeriodicalIF":0.0,"publicationDate":"1969-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80022-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77109504","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 43
A new proof of Brooks's chromatic number theorem for graphs 图的布鲁克斯色数定理的新证明
Journal of Combinatorial Theory Pub Date : 1969-11-01 DOI: 10.1016/S0021-9800(69)80018-9
J. Ponstein
{"title":"A new proof of Brooks's chromatic number theorem for graphs","authors":"J. Ponstein","doi":"10.1016/S0021-9800(69)80018-9","DOIUrl":"10.1016/S0021-9800(69)80018-9","url":null,"abstract":"<div><p>The main purpose of this paper is to present one more proof of a theorem due to Brooks [1, 2, 3].</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 3","pages":"Pages 255-257"},"PeriodicalIF":0.0,"publicationDate":"1969-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80018-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79037622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Some new partition theorems. II 一些新的分拆定理。2
Journal of Combinatorial Theory Pub Date : 1969-11-01 DOI: 10.1016/S0021-9800(69)80020-7
George E. Andrews
{"title":"Some new partition theorems. II","authors":"George E. Andrews","doi":"10.1016/S0021-9800(69)80020-7","DOIUrl":"https://doi.org/10.1016/S0021-9800(69)80020-7","url":null,"abstract":"","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 3","pages":"Pages 262-263"},"PeriodicalIF":0.0,"publicationDate":"1969-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80020-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137216932","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Packing a rectangular box with the twelve solid pentominoes 把十二根五角星装进一个长方形盒子里
Journal of Combinatorial Theory Pub Date : 1969-11-01 DOI: 10.1016/S0021-9800(69)80025-6
C.J. Bouwkamp
{"title":"Packing a rectangular box with the twelve solid pentominoes","authors":"C.J. Bouwkamp","doi":"10.1016/S0021-9800(69)80025-6","DOIUrl":"10.1016/S0021-9800(69)80025-6","url":null,"abstract":"","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 3","pages":"Pages 278-280"},"PeriodicalIF":0.0,"publicationDate":"1969-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80025-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87466802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
A class of covers for finite projective geometries which are related to the design of combinatorial filing systems 有限射影几何的一类盖,与组合归档系统的设计有关
Journal of Combinatorial Theory Pub Date : 1969-11-01 DOI: 10.1016/S0021-9800(69)80014-1
Gary G. Koch
{"title":"A class of covers for finite projective geometries which are related to the design of combinatorial filing systems","authors":"Gary G. Koch","doi":"10.1016/S0021-9800(69)80014-1","DOIUrl":"10.1016/S0021-9800(69)80014-1","url":null,"abstract":"<div><p>A method is given for selecting a certain subset of <em>m</em>-flats from a finite projective geometry <em>PG(N, q)</em> which cover all (<em>t</em>−1) flats there, where <em>m</em>≥<em>t</em>−1. These results have application to the problem of designing efficient information retrieval systems.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 3","pages":"Pages 215-220"},"PeriodicalIF":0.0,"publicationDate":"1969-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80014-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78886383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
More birthday surprises 更多生日惊喜
Journal of Combinatorial Theory Pub Date : 1969-11-01 DOI: 10.1016/S0021-9800(69)80019-0
Meyer Dwass
{"title":"More birthday surprises","authors":"Meyer Dwass","doi":"10.1016/S0021-9800(69)80019-0","DOIUrl":"10.1016/S0021-9800(69)80019-0","url":null,"abstract":"","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 3","pages":"Pages 258-261"},"PeriodicalIF":0.0,"publicationDate":"1969-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80019-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87188126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 40
Some inequalities from switching theory 交换理论中的一些不等式
Journal of Combinatorial Theory Pub Date : 1969-11-01 DOI: 10.1016/S0021-9800(69)80012-8
J.L. Brenner
{"title":"Some inequalities from switching theory","authors":"J.L. Brenner","doi":"10.1016/S0021-9800(69)80012-8","DOIUrl":"10.1016/S0021-9800(69)80012-8","url":null,"abstract":"<div><p><em>k</em>-Dimensional arrays of multiway switches are used to derive inequalities. (Analytic proofs are also given.) As an example, suppose 0&lt;<em>p, q, r, …; p+q+r+ …</em>=1; <em>l, m, n, …&gt;1, S=lmn …</em>. Interpreting <em>p, q, r</em>, … as probabilities that an individual switch be set in a coordinate direction, we derive</p><p><em>k</em>−1&lt;(1−<em>p<sup>S/l</sup></em>)<sup><em>l</em></sup>+(1−<em>q<sup>S/m</sup></em>)<sup><em>m</em></sup>+(1−<em>r<sup>S/n</sup></em>)<sup><em>n</em></sup>+ …</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"7 3","pages":"Pages 197-205"},"PeriodicalIF":0.0,"publicationDate":"1969-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0021-9800(69)80012-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86746408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信