Bounded unique representation bases for the integers

IF 1 3区 数学 Q1 MATHEMATICS European Journal of Combinatorics Pub Date : 2024-10-16 DOI:10.1016/j.ejc.2024.104080
Yong-Gao Chen, Jin-Hui Fang
{"title":"Bounded unique representation bases for the integers","authors":"Yong-Gao Chen,&nbsp;Jin-Hui Fang","doi":"10.1016/j.ejc.2024.104080","DOIUrl":null,"url":null,"abstract":"<div><div>For a nonempty set <span><math><mi>A</mi></math></span> of integers and an integer <span><math><mi>n</mi></math></span>, let <span><math><mrow><msub><mrow><mi>r</mi></mrow><mrow><mi>A</mi></mrow></msub><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span> be the number of representations of <span><math><mrow><mi>n</mi><mo>=</mo><mi>a</mi><mo>+</mo><msup><mrow><mi>a</mi></mrow><mrow><mo>′</mo></mrow></msup></mrow></math></span> with <span><math><mrow><mi>a</mi><mo>≤</mo><msup><mrow><mi>a</mi></mrow><mrow><mo>′</mo></mrow></msup></mrow></math></span> and <span><math><mrow><mi>a</mi><mo>,</mo><msup><mrow><mi>a</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>∈</mo><mi>A</mi></mrow></math></span>, and let <span><math><mrow><msub><mrow><mi>d</mi></mrow><mrow><mi>A</mi></mrow></msub><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span> be the number of representations of <span><math><mrow><mi>n</mi><mo>=</mo><mi>a</mi><mo>−</mo><msup><mrow><mi>a</mi></mrow><mrow><mo>′</mo></mrow></msup></mrow></math></span> with <span><math><mrow><mi>a</mi><mo>,</mo><msup><mrow><mi>a</mi></mrow><mrow><mo>′</mo></mrow></msup><mo>∈</mo><mi>A</mi></mrow></math></span>. Erdős and Turán (1941) posed the profound conjecture: if <span><math><mi>A</mi></math></span> is a set of positive integers such that <span><math><mrow><msub><mrow><mi>r</mi></mrow><mrow><mi>A</mi></mrow></msub><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>≥</mo><mn>1</mn></mrow></math></span> for all sufficiently large <span><math><mi>n</mi></math></span>, then <span><math><mrow><msub><mrow><mi>r</mi></mrow><mrow><mi>A</mi></mrow></msub><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow></mrow></math></span> is unbounded. Nešetřil and Serra (2004) introduced the notion of bounded sets and confirmed the Erdős–Turán conjecture for all bounded bases. Nathanson (2003) considered the existence of the set <span><math><mi>A</mi></math></span> with logarithmic growth such that <span><math><mrow><msub><mrow><mi>r</mi></mrow><mrow><mi>A</mi></mrow></msub><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></span> for all integers <span><math><mi>n</mi></math></span>. In this paper, we prove that, for any positive function <span><math><mrow><mi>l</mi><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow></mrow></math></span> with <span><math><mrow><mi>l</mi><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow><mo>→</mo><mn>0</mn></mrow></math></span> as <span><math><mrow><mi>x</mi><mo>→</mo><mi>∞</mi></mrow></math></span>, there is a bounded set <span><math><mi>A</mi></math></span> of integers such that <span><math><mrow><msub><mrow><mi>r</mi></mrow><mrow><mi>A</mi></mrow></msub><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></span> for all integers <span><math><mi>n</mi></math></span> and <span><math><mrow><msub><mrow><mi>d</mi></mrow><mrow><mi>A</mi></mrow></msub><mrow><mo>(</mo><mi>n</mi><mo>)</mo></mrow><mo>=</mo><mn>1</mn></mrow></math></span> for all positive integers <span><math><mi>n</mi></math></span>, and <span><math><mrow><mi>A</mi><mrow><mo>(</mo><mo>−</mo><mi>x</mi><mo>,</mo><mi>x</mi><mo>)</mo></mrow><mo>≥</mo><mi>l</mi><mrow><mo>(</mo><mi>x</mi><mo>)</mo></mrow><mo>log</mo><mi>x</mi></mrow></math></span> for all sufficiently large <span><math><mi>x</mi></math></span>, where <span><math><mrow><mi>A</mi><mrow><mo>(</mo><mo>−</mo><mi>x</mi><mo>,</mo><mi>x</mi><mo>)</mo></mrow></mrow></math></span> is the number of elements <span><math><mrow><mi>a</mi><mo>∈</mo><mi>A</mi></mrow></math></span> with <span><math><mrow><mo>−</mo><mi>x</mi><mo>≤</mo><mi>a</mi><mo>≤</mo><mi>x</mi></mrow></math></span>.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0195669824001653","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

For a nonempty set A of integers and an integer n, let rA(n) be the number of representations of n=a+a with aa and a,aA, and let dA(n) be the number of representations of n=aa with a,aA. Erdős and Turán (1941) posed the profound conjecture: if A is a set of positive integers such that rA(n)1 for all sufficiently large n, then rA(n) is unbounded. Nešetřil and Serra (2004) introduced the notion of bounded sets and confirmed the Erdős–Turán conjecture for all bounded bases. Nathanson (2003) considered the existence of the set A with logarithmic growth such that rA(n)=1 for all integers n. In this paper, we prove that, for any positive function l(x) with l(x)0 as x, there is a bounded set A of integers such that rA(n)=1 for all integers n and dA(n)=1 for all positive integers n, and A(x,x)l(x)logx for all sufficiently large x, where A(x,x) is the number of elements aA with xax.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
整数的有界唯一表示基
对于非空整数集合 A 和整数 n,设 rA(n) 是 n=a+a′ 的表示数,其中 a≤a′ 和 a,a′∈A ;设 dA(n) 是 n=a-a′ 的表示数,其中 a,a′∈A 。厄尔多斯和图兰(1941)提出了一个深刻的猜想:如果 A 是一个正整数集合,对于所有足够大的 n,rA(n)≥1,那么 rA(n) 是无界的。Nešetřil 和 Serra (2004) 引入了有界集的概念,并证实了 Erdős-Turán 对所有有界基的猜想。Nathanson (2003) 考虑了具有对数增长的集合 A 的存在性,即对于所有整数 n,rA(n)=1。在本文中,我们证明了对于任何正函数 l(x),当 x→∞ 时,l(x)→0,存在一个有界的整数集合 A,使得对于所有整数 n,rA(n)=1;对于所有正整数 n,dA(n)=1;对于所有足够大的 x,A(-x,x)≥l(x)logx,其中 A(-x,x) 是具有 -x≤a≤x 的元素 a∈A 的个数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.10
自引率
10.00%
发文量
124
审稿时长
4-8 weeks
期刊介绍: The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.
期刊最新文献
A combinatorial PROP for bialgebras Signed Mahonian polynomials on derangements in classical Weyl groups Degree conditions for Ramsey goodness of paths Bounded unique representation bases for the integers On the faces of unigraphic 3-polytopes
×
引用
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