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

preprint2021arXivOpen access

Abstract

Suppose GG is a finite abelian group and S=g1⋯glS=g_{1}\cdots g_{l} is a sequence of elements in GG. For any element gg of GG and A⊆Z\{0}A\subseteq\mathbb{Z}\backslash\left\{ 0\right\} , let NA,g(S)N_{A,g}(S) denote the number of subsequences T=∏i∈IgiT=\prod_{i\in I}g_{i} of SS such that ∑i∈Iaigi=g\sum_{i\in I}a_{i}g_{i}=g , where I⊆{1,…,l}I\subseteq\left\{ 1,\ldots,l\right\} and ai∈Aa_{i}\in A. The purpose of this paper is to investigate the lower bound for NA,0(S)N_{A,0}(S). In particular, we prove that NA,0(S)≥2∣S∣−DA(G)+1N_{A,0}(S)\geq2^{|S|-D_{A}(G)+1}, where DA(G)D_{A}(G) is the smallest positive integer ll such that every sequence over GG of length at least ll has a nonempty AA-zero-sum subsequence. We also characterize the structures of the extremal sequences for which the equality holds for some groups.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.