n立方的塔克引理的组合证明

James K. Baker
{"title":"n立方的塔克引理的组合证明","authors":"James K. Baker","doi":"10.1016/S0021-9800(70)80081-3","DOIUrl":null,"url":null,"abstract":"<div><p>Tucker's lemma is a combinatorial result which may be used to derive several theorems in topology. Some basic properties are established for the cube of integer lattice points. Tucker's lemma is then proved by applying a result which was originally presented for the octahedral subdivision of the <em>n</em>-disk.</p></div>","PeriodicalId":100765,"journal":{"name":"Journal of Combinatorial Theory","volume":"8 3","pages":"Pages 279-290"},"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)80081-3","citationCount":"7","resultStr":"{\"title\":\"A combinatorial proof of Tucker's lemma for the n-cube\",\"authors\":\"James K. Baker\",\"doi\":\"10.1016/S0021-9800(70)80081-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Tucker's lemma is a combinatorial result which may be used to derive several theorems in topology. Some basic properties are established for the cube of integer lattice points. Tucker's lemma is then proved by applying a result which was originally presented for the octahedral subdivision of the <em>n</em>-disk.</p></div>\",\"PeriodicalId\":100765,\"journal\":{\"name\":\"Journal of Combinatorial Theory\",\"volume\":\"8 3\",\"pages\":\"Pages 279-290\"},\"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)80081-3\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021980070800813\",\"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/S0021980070800813","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

塔克引理是一个组合结果,可以用来导出拓扑学中的几个定理。建立了整数格点立方体的一些基本性质。然后应用最初提出的n盘八面体细分的结果来证明Tucker引理。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A combinatorial proof of Tucker's lemma for the n-cube

Tucker's lemma is a combinatorial result which may be used to derive several theorems in topology. Some basic properties are established for the cube of integer lattice points. Tucker's lemma is then proved by applying a result which was originally presented for the octahedral subdivision of the n-disk.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Announcement A rank inequality for finite geometric lattices On the factorisation of the complete graph into factors of diameter 2 On nonreconstructable tournaments The number of classes of isomorphic graded partially ordered sets
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1