n中无进展集大小的界

Uniform distribution theory Pub Date : 2022-05-31 DOI:10.2478/udt-2022-0005

P. Pach

{"title":"n中无进展集大小的界","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":"{\"title\":\"Bounds on the size of Progression-Free Sets in ℤ\\n m\\n n\\n \",\"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}","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

摘要

在这篇文章中，我们概述了目前已知的避免k项等差数列的一个子集的大小的最佳下界和上界。我们将重点讨论禁止进程长度为3的情况。我们还提出了一些开放式问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Bounds on the size of Progression-Free Sets in ℤ _m ⁿ

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Uniform distribution theory

自引率

0.00%

发文量