Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the number of weighted subsequences with zero-sum in a finite abelian group (1505.01194v3)

Published 5 May 2015 in math.NT

Abstract: Suppose $G$ is a finite abelian group and $S=g_{1}\cdots g_{l}$ is a sequence of elements in $G$. For any element $g$ of $G$ and $A\subseteq\mathbb{Z}\backslash\left{ 0\right} $, let $N_{A,g}(S)$ denote the number of subsequences $T=\prod_{i\in I}g_{i}$ of $S$ such that $\sum_{i\in I}a_{i}g_{i}=g$ , where $I\subseteq\left{ 1,\ldots,l\right}$ and $a_{i}\in A$. The purpose of this paper is to investigate the lower bound for $N_{A,0}(S)$. In particular, we prove that $N_{A,0}(S)\geq2{|S|-D_{A}(G)+1}$, where $D_{A}(G)$ is the smallest positive integer $l$ such that every sequence over $G$ of length at least $l$ has a nonempty $A$-zero-sum subsequence. We also characterize the structures of the extremal sequences for which the equality holds for some groups.

Summary

We haven't generated a summary for this paper yet.