Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 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 subsequences with a given sum in a finite abelian group (1101.4492v1)

Published 24 Jan 2011 in math.CO and math.NT

Abstract: Suppose $G$ is a finite abelian group and $S$ is a sequence of elements in $G$. For any element $g$ of $G$, let $N_g(S)$ denote the number of subsequences of $S$ with sum $g$. The purpose of this paper is to investigate the lower bound for $N_g(S)$. In particular, we prove that either $N_g(S)=0$ or $N_g(S) \ge 2{|S|-D(G)+1}$, where $D(G)$ is the smallest positive integer $\ell$ such that every sequence over $G$ of length at least $\ell$ has a nonempty zero-sum subsequence. We also characterize the structures of the extremal sequences for which the equality holds for some groups.

Citations (9)

Summary

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