The Structure of Large SUM-Free Sets in 𝔽n p

Author:

Versteegen Leo1ORCID

Affiliation:

1. Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences , Wilberforce Road, Cambridge, CB3 0WB, United Kingdom

Abstract

ABSTRACT A set $A\subset \mathbb{F}_p^n$ is sum-free if A + A does not intersect A. If $p\equiv 2 \;\mathrm{mod}\; 3$, the maximal size of a sum-free set in $\mathbb{F}_p^n$ is known to be $(p^n+p^{n-1})/3$. We show that if a sum-free set $A\subset \mathbb{F}_p^n$ has size at least $p^n/3-p^{n-1}/6+p^{n-2}$, then there exists subspace $V\lt\mathbb{F}_p^n$ of codimension 1 such that A is contained in $(p+1)/3$ cosets of V. For p = 5 specifically, we show the stronger result that every sum-free set of size larger than $1.2\cdot 5^{n-1}$ has this property, thus improving on a recent theorem of Lev.

Publisher

Oxford University Press (OUP)

Reference13 articles.

1. Sum-free sets in vector spaces over ${{\rm} GF}(2)$;Clark;J. Combin. Theory Ser. A,1992

2. Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry;Davydov;Probl. Peredachi Inf.,1989

3. Maximal sum-free sets of elements of finite groups;Diananda;Proc. Japan Acad.,1969

4. Sum-free sets in abelian groups;Green;Israel J. Math.,2005

5. Abschätzung der asymptotischen Dichte von Summenmengen;Kneser;Math. Z.,1953

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3