不可分解的组合博弈

IF 0.9 2区 数学 Q2 MATHEMATICS
{"title":"不可分解的组合博弈","authors":"","doi":"10.1016/j.jcta.2024.105964","DOIUrl":null,"url":null,"abstract":"<div><div>In Combinatorial Game Theory, short game forms are defined recursively over all the positions the two players are allowed to move to. A form is decomposable if it can be expressed as a disjunctive sum of two forms with smaller birthday. If there are no such summands, then the form is indecomposable. The main contribution of this document is the characterization of the indecomposable nimbers and the characterization of the indecomposable numbers. More precisely, a nimber is indecomposable if and only if its size is a power of two, and a number is indecomposable if and only if its absolute value is less than or equal to one.</div></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Indecomposable combinatorial games\",\"authors\":\"\",\"doi\":\"10.1016/j.jcta.2024.105964\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In Combinatorial Game Theory, short game forms are defined recursively over all the positions the two players are allowed to move to. A form is decomposable if it can be expressed as a disjunctive sum of two forms with smaller birthday. If there are no such summands, then the form is indecomposable. The main contribution of this document is the characterization of the indecomposable nimbers and the characterization of the indecomposable numbers. More precisely, a nimber is indecomposable if and only if its size is a power of two, and a number is indecomposable if and only if its absolute value is less than or equal to one.</div></div>\",\"PeriodicalId\":50230,\"journal\":{\"name\":\"Journal of Combinatorial Theory Series A\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Combinatorial Theory Series A\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0097316524001031\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316524001031","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

在组合博弈论中,简短博弈形式是在允许两位棋手移动的所有位置上递归定义的。如果一个形式可以表示为两个生日较小的形式的析取和,那么这个形式就是可分解的。如果没有这样的和,那么这个棋形就是不可分解的。本文的主要贡献在于描述了不可分解数的特征和不可分解数的特征。更确切地说,当且仅当一个数的大小是 2 的幂时,它是不可分解的;当且仅当一个数的绝对值小于或等于 1 时,它是不可分解的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Indecomposable combinatorial games
In Combinatorial Game Theory, short game forms are defined recursively over all the positions the two players are allowed to move to. A form is decomposable if it can be expressed as a disjunctive sum of two forms with smaller birthday. If there are no such summands, then the form is indecomposable. The main contribution of this document is the characterization of the indecomposable nimbers and the characterization of the indecomposable numbers. More precisely, a nimber is indecomposable if and only if its size is a power of two, and a number is indecomposable if and only if its absolute value is less than or equal to one.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.90
自引率
9.10%
发文量
94
审稿时长
12 months
期刊介绍: The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信