On the structure of p-zero-sum free sequences and its application to a variant of Erdos--Ginzburg--Ziv theorem
Abstract
Let p be any odd prime number. Let k be any positive integer such that 2≤ k≤ [p+13]+1. Let S = (a1,a2,...,a2p-k) be any sequence in Zp such that there is no subsequence of length p of S whose sum is zero in . Then we prove that we can arrange the sequence S as follows: S = (a, a, ..., au times, b, b, >..., bv times, a1', a2', >..., a2p-k-u-v') where u≥ v, u+v≥ 2p-2k+2 and a-b generates . This extends a result in gao10 to all primes p and k satisfying (p+1)/4+3≤ k≤ (p+1)/3+1. Also, we prove that if g denotes the number of distinct residue classes modulo p appearing in the sequence S in of length 2p-k (2≤ k≤ [(p+1)/4]+1), and g≥ 22k-2, then there exists a subsequence of S of length p whose sum is zero in .
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.