Apwenian数列的计算机辅助证明

Hao Fu, Guo-Niu Han
{"title":"Apwenian数列的计算机辅助证明","authors":"Hao Fu, Guo-Niu Han","doi":"10.1145/2930889.2930891","DOIUrl":null,"url":null,"abstract":"An infinite ±1-sequence is called Apwenian if its Hankel determinant of order n divided by 2n-1 is an odd number for every positive integer n. In 1998, Allouche, Peyriere, Wen and Wen discovered and proved that the Thue--Morse sequence is an Apwenian sequence by direct determinant manipulations. Recently, Bugeaud and Han re-proved the latter result by means of an appropriate combinatorial method. By significantly improving the combinatorial method, we find several new Apwenian sequences with Computer Assistance. This research has application in Number Theory to determining the irrationality exponents of some transcendental numbers.","PeriodicalId":169557,"journal":{"name":"Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation","volume":"110 8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Computer Assisted Proof for Apwenian Sequences\",\"authors\":\"Hao Fu, Guo-Niu Han\",\"doi\":\"10.1145/2930889.2930891\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An infinite ±1-sequence is called Apwenian if its Hankel determinant of order n divided by 2n-1 is an odd number for every positive integer n. In 1998, Allouche, Peyriere, Wen and Wen discovered and proved that the Thue--Morse sequence is an Apwenian sequence by direct determinant manipulations. Recently, Bugeaud and Han re-proved the latter result by means of an appropriate combinatorial method. By significantly improving the combinatorial method, we find several new Apwenian sequences with Computer Assistance. This research has application in Number Theory to determining the irrationality exponents of some transcendental numbers.\",\"PeriodicalId\":169557,\"journal\":{\"name\":\"Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation\",\"volume\":\"110 8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2930889.2930891\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2930889.2930891","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

如果无限±1序列的n阶汉克尔行列式除以2n-1对每一个正整数n都是奇数,则称为Apwenian序列。1998年,Allouche、Peyriere、Wen和Wen通过直接行列式操作发现并证明了Thue—Morse序列是Apwenian序列。最近,Bugeaud和Han用一种合适的组合方法重新证明了后一种结果。通过对组合方法的显著改进,我们在计算机辅助下发现了几个新的Apwenian序列。本研究在数论中对某些超越数的无理数指数的确定具有一定的应用价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Computer Assisted Proof for Apwenian Sequences
An infinite ±1-sequence is called Apwenian if its Hankel determinant of order n divided by 2n-1 is an odd number for every positive integer n. In 1998, Allouche, Peyriere, Wen and Wen discovered and proved that the Thue--Morse sequence is an Apwenian sequence by direct determinant manipulations. Recently, Bugeaud and Han re-proved the latter result by means of an appropriate combinatorial method. By significantly improving the combinatorial method, we find several new Apwenian sequences with Computer Assistance. This research has application in Number Theory to determining the irrationality exponents of some transcendental numbers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Computing Limits of Real Multivariate Rational Functions Faster LLL-type Reduction of Lattice Bases Positive Root Isolation for Poly-Powers Computing the Lie Algebra of the Differential Galois Group of a Linear Differential System Fast Polynomial Multiplication over F260
×
引用
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