• Corpus ID: 119306774

On the number of weighted subsequences with zero-sum in a finite abelian group

@article{Lemos2015OnTN,
  title={On the number of weighted subsequences with zero-sum in a finite abelian group},
  author={Ab'ilio Lemos and Allan De Oliveira Moura},
  journal={arXiv: Number Theory},
  year={2015}
}
Suppose G is a finite abelian group and S = g1 ···gl is a sequence of elements in G. For any element g of G and A ⊆ Z\{0}, let NA,g(S) denote the number of subsequences T = Q i∈I gi of S such that P i∈I aigi = g , where I ⊆ {1,...,l} and ai ∈ A. The purpose of this paper is to investigate the lower bound for NA,0(S). In particular, we prove that NA,0(S) ≥ 2 |S|=D A(G)+1 , where DA(G) is the smallest positive integer l such that every sequence over G of length at least l has a nonempty A-zero… 

References

SHOWING 1-10 OF 24 REFERENCES

A Combinatorial Problem on Finite Abelian Groups

Abstract In this paper the following theorem is proved. Let G be a finite Abelian group of order n . Then, n + D ( G )−1 is the least integer m with the property that for any sequence of m elements a

On the Number of Subsequences with a Given Sum in a Finite Abelian Group

TLDR
It is proved that either $N_g(S)=0$ or $N-g (S) \ge 2^{|S|-D(G)+1}$, where D(G)$ is the smallest positive integer such that every sequence over $G$ of length at least $\ell$ has a nonempty zero-sum subsequence.

Two theorems on the addition of residue classes

Theorem in the Additive Number Theory

THEOREM. Each set of 2n-1 integers contains some subset of n elements the sum of which is a multiple of n. PROOF. Assume first n = p (p prime). Our theorem is trivial for p = 2, thus henceforth p >

Davenport constant with weights and some related questions, II

On the number of zero-sum subsequences

Remarks on the plus–minus weighted Davenport constant

For (G, +) a finite abelian group the plus–minus weighted Davenport constant, denoted D±(G), is the smallest l such that each sequence g1…gl over G has a weighted zero-subsum with weights +1 and -1,

The number of zero sums modulo m in a sequence of length n

We prove a result related to the Erdős-Ginzburg-Ziv theorem: Let p and q be primes, α a positive integer, and m ∈{ p α , p α q }. Then for any sequence of integers c = { c 1 , c 2 ,…, c n } there are

Representation of Finite Abelian Group Elements by Subsequence Sums

Let $G\cong C_{n_1}\oplus ... \oplus C_{n_r}$ be a finite and nontrivial abelian group with $n_1|n_2|...|n_r$. A conjecture of Hamidoune says that if $W=w_1... w_n$ is a sequence of integers, all but

On the number of $m$-term zero-sum subsequences

A sequence S of terms from an abelian group is zero-sum if the sum of the terms of S is zero. In 1961 Erdős, Ginzburg and Ziv proved that any sequence of 2m− 1 terms from an abelian group of order m