On the number of subsequence sums related to the support of a sequence in finite abelian groups

Abstract

Let G be a finite abelian group and S a sequence with elements of G. Let |S| denote the length of S and supp(S) the set of all the distinct terms in S. For an integer k with k∈ [1, |S|], let k(S) ⊂ G denote the set of group elements which can be expressed as a sum of a subsequence of S with length k. Let (S)=k=1|S|k(S) and ≥ k(S)=t=k|S|t(S). It is known that if 0∈ (S), then |(S)|≥ |S|+|supp(S)|-1. In this paper, we determine the structure of a sequence S satisfying 0 (S) and |(S)|= |S|+|supp(S)|-1. As a consequence, we can give a counterexample of a conjecture of Gao, Grynkiewicz, and Xia. Moreover, we prove that if |S|>k and 0∈ ≥ k(S) supp(S), then |≥ k(S)|≥ |S|-k+|supp(S)|. Then we can give an alternative proof of a conjecture of Hamidoune, which was first proved by Gao, Grynkiewicz, and Xia.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…