On the size of subsets of F_p^n without p distinct elements summing to zero

DOI10.1007/S11856-021-2145-XzbMATH Open1497.11033arXiv1904.09560OpenAlexW3160248697MaRDI QIDQ2048853FDOQ2048853

Authors: Lisa Sauermann 

Publication date: 24 August 2021

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Abstract: Let us fix a prime $p$. The ErdH{o}s-Ginzburg-Ziv problem asks for the minimum integer $s$ such that any collection of $s$ points in the lattice $mathbb{Z}^n$ contains $p$ points whose centroid is also a lattice point in $mathbb{Z}^n$. For large $n$, this is essentially equivalent to asking for the maximum size of a subset of $mathbb{F}_p^n$ without $p$ distinct elements summing to zero. In this paper, we give a new upper bound for this problem for any fixed prime $pgeq5$ and large $n$. In particular, we prove that any subset of $mathbb{F}_p^n$ without $p$ distinct elements summing to zero has size at most $C_{p}cdotleft(2sqrtpight{)}^n$, where $C_p$ is a constant only depending on $p$. For $p$ and $n$ going to infinity, our bound is of the form $p^{(1/2)cdot(1+o(1))n}$, whereas all previously known upper bounds were of the form $p^{(1-o(1))n}$ (with $p^n$ being a trivial bound). Our proof uses the so-called multi-colored sum-free theorem which is a consequence of the Croot-Lev-Pach polynomial method. This method and its consequences were already applied by Naslund as well as by Fox and the author to prove bounds for the problem studied in this paper. However, using some key new ideas, we significantly improve their bounds.

Full work available at URL: https://arxiv.org/abs/1904.09560

Recommendations

• Large zero-free subsets of \(\mathbb Z/p\mathbb Z\)
• Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions
• The Erdős-Ginzburg-Ziv constant and progression-free subsets
• Sumsets as unions of sumsets of subsets
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression

zbMATH Keywords

zero-sum subsetmulti-colored sum-free theoremErdős-Ginzburg-Ziv problem

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30)

Cites Work

• The probabilistic method
• Title not available (Why is that?)
• Extensions of generalized product caps
• On sunflowers and matrix multiplication
• On Kemnitz' conjecture concerning lattice-points in the plane
• Sequences in abelian groups \(G\) of odd order without zero-sum subsequences of length \(\exp(G)\)
• ZERO-SUM PROBLEMS IN FINITE ABELIAN GROUPS AND AFFINE CAPS
• Lower bounds for multidimensional zero sums
• A lattice point problem and additive number theory
• Ein Extremalproblem für Gitterpunkte.
• The Erdős-Ginzburg-Ziv constant and progression-free subsets
• Erdős-Ginzburg-Ziv constants by avoiding three-term arithmetic progressions
• Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• Exponential bounds for the Erdős-Ginzburg-Ziv constant
• On cap sets and the group-theoretic approach to matrix multiplication
• New applications of the polynomial method: the cap set conjecture and beyond
• The partition rank of a tensor and \(k\)-right corners in \(\mathbb{F}_q^n\)
• A lower bound for the \(k\)-multicolored sum-free problem in \(\mathbb{Z}_m^n\)

Cited In (9)

• The Erdős-Ginzburg-Ziv constant and progression-free subsets
• Subsets of without L-shaped configurations
• On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions
• Bounds on the higher degree Erdős-Ginzburg-Ziv constants over \({\mathbb{F}}_q^n\)
• A lower bound for the \(k\)-multicolored sum-free problem in \(\mathbb{Z}_m^n\)
• On the size of subsets of \(\mathbb{F}_q^n\) avoiding solutions to linear systems with repeated columns
• Subsets without \(q\)-separation and binomial products of Fibonacci numbers
• Polynomial equations in \(\mathbb{F}_q [t]\)
• Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\)

This page was built for publication: On the size of subsets of \(\mathbb{F}_p^n\) without \(p\) distinct elements summing to zero

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048853)