正规 CW 复数的欧拉定理

IF 1 2区 数学 Q1 MATHEMATICS Combinatorica Pub Date : 2024-01-05 DOI:10.1007/s00493-023-00080-1
Richard H. Hammack, Paul C. Kainen
{"title":"正规 CW 复数的欧拉定理","authors":"Richard H. Hammack, Paul C. Kainen","doi":"10.1007/s00493-023-00080-1","DOIUrl":null,"url":null,"abstract":"<p>For strongly connected, pure <i>n</i>-dimensional regular CW-complexes, we show that <i>evenness</i> (each <span>\\((n{-}1)\\)</span>-cell is contained in an even number of <i>n</i>-cells) is equivalent to generalizations of both cycle decomposition and traversability.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Euler’s Theorem for Regular CW-Complexes\",\"authors\":\"Richard H. Hammack, Paul C. Kainen\",\"doi\":\"10.1007/s00493-023-00080-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>For strongly connected, pure <i>n</i>-dimensional regular CW-complexes, we show that <i>evenness</i> (each <span>\\\\((n{-}1)\\\\)</span>-cell is contained in an even number of <i>n</i>-cells) is equivalent to generalizations of both cycle decomposition and traversability.</p>\",\"PeriodicalId\":50666,\"journal\":{\"name\":\"Combinatorica\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-01-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Combinatorica\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00493-023-00080-1\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00493-023-00080-1","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

对于强连接的纯 n 维正则 CW 复合物,我们证明了偶数性(每个 \((n{-}1)\) 单元包含在偶数个 n 单元中)等同于循环分解和可遍历性的广义化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Euler’s Theorem for Regular CW-Complexes

For strongly connected, pure n-dimensional regular CW-complexes, we show that evenness (each \((n{-}1)\)-cell is contained in an even number of n-cells) is equivalent to generalizations of both cycle decomposition and traversability.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Combinatorica
Combinatorica 数学-数学
CiteScore
1.90
自引率
0.00%
发文量
45
审稿时长
>12 weeks
期刊介绍: COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are - Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups). - Combinatorial optimization. - Combinatorial aspects of geometry and number theory. - Algorithms in combinatorics and related fields. - Computational complexity theory. - Randomization and explicit construction in combinatorics and algorithms.
期刊最新文献
Hamilton Transversals in Tournaments Pure Pairs. VIII. Excluding a Sparse Graph Perfect Matchings in Random Sparsifications of Dirac Hypergraphs Storage Codes on Coset Graphs with Asymptotically Unit Rate A Whitney Type Theorem for Surfaces: Characterising Graphs with Locally Planar Embeddings
×
引用
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