Bounds on the size of Progression-Free Sets in ℤ m n

P. Pach
{"title":"Bounds on the size of Progression-Free Sets in ℤ<i>\n <sub>m</sub>\n <sup>n</sup>\n </i>","authors":"P. Pach","doi":"10.2478/udt-2022-0005","DOIUrl":null,"url":null,"abstract":"\n In this note we give an overview of the currently known best lower and upper bounds on the size of a subset of ℤ\n n\n m\n avoiding k-term arithmetic progression. We will focus on the case when the length of the forbidden progression is 3. We also formulate some open questions.","PeriodicalId":23390,"journal":{"name":"Uniform distribution theory","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Uniform distribution theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/udt-2022-0005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this note we give an overview of the currently known best lower and upper bounds on the size of a subset of ℤ n m avoiding k-term arithmetic progression. We will focus on the case when the length of the forbidden progression is 3. We also formulate some open questions.
n中无进展集大小的界
在这篇文章中,我们概述了目前已知的避免k项等差数列的一个子集的大小的最佳下界和上界。我们将重点讨论禁止进程长度为3的情况。我们还提出了一些开放式问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信