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 at most one relatively prime to $|G|$, and $S$ is a sequence over $G$ with $|S|\geq |W|+|G|-1\geq |G|+1$, the maximum multiplicity of $S$ at most $|W|$, and $σ(W)\equiv 0\mod |G|$, then there exists a nontrivial subgroup $H$ such that every element $g\in H$ can be represented as a weighted subsequence sum of the form $g=\sum_{i=1}^{n}w_is_i$, with $s_1... s_n$ a subsequence of $S$. We give two examples showing this does not hold in general, and characterize the counterexamples for large $|W|\geq {1/2}|G|$.
A theorem of Gao, generalizing an older result of Olson, says that if $G$ is a finite abelian group, and $S$ is a sequence over $G$ with $|S|\geq |G|+D(G)-1$, then either every element of $G$ can be represented as a $|G|$-term subsequence sum from $S$, or there exists a coset $g+H$ such that all but at most $|G/H|-2$ terms of $S$ are from $g+H$. We establish some very special cases in a weighted analog of this theorem conjectured by Ordaz and Quiroz, and some partial conclusions in the remaining cases, which imply a recent result of Ordaz and Quiroz. This is done, in part, by extending a weighted setpartition theorem of Grynkiewicz, which we then use to also improve the previously mentioned result of Gao by showing that the hypothesis $|S|\geq |G|+D(G)-1$ can be relaxed to $|S|\geq |G|+d^*(G)$, where $d^*(G)=\Sum_{i=1}^{r}(n_i-1)$. We also use this method to derive a variation on Hamidoune's conjecture valid when at least $d^*(G)$ of the $w_i$ are relatively prime to $|G|$.
We show that a zero-sum-free sequence of length $n$ over an abelian group spans at least $2n$ distinct subsequence sums, unless it possesses a rigid, easily-described structure.
We show that a finite zero-sum-free sequence $α$ over an abelian group has at least $c|α|^{4/3}$ distinct subsequence sums, unless $α$ is "controlled" by a small number of its terms; here $|α|$ denotes the number of terms of $α$, and $c>0$ is an absolute constant.
Let $\mathcal{A}$ be a sequence of $rk$ terms which is made up of $k$ distinct integers each appearing exactly $r$ times in $\mathcal{A}$. The sum of all terms of a subsequence of $\mathcal{A}$ is called a subsequence sum of $\mathcal{A}$. For a nonnegative integer $α\leq rk$, let $Σ_α (\mathcal{A})$ be the set of all subsequence sums of $\mathcal{A}$ that correspond to the subsequences of length $α$ or more. When $r=1$, we call the subsequence sums as subset sums and we write $Σ_α (A)$ for $Σ_α (\mathcal{A})$. In this article, using some simple combinatorial arguments, we establish optimal lo…
Let $A$ be a nonempty finite set of $k$ integers. Given a subset $B$ of $A$, the sum of all elements of $B$, denoted by $s(B)$, is called the subset sum of $B$. For a nonnegative integer $α$ ($\leq k$), let \[Σ_α (A):=\{s(B): B \subset A, |B|\geq α\}.\] Now, let $\mathcal{A}=(\underbrace{a_{1},\ldots,a_{1}}_{r_{1}~\text{copies}}, \underbrace{a_{2},\ldots,a_{2}}_{r_{2}~\text{copies}},\ldots, \underbrace{a_{k},\ldots,a_{k}}_{r_{k}~\text{copies}})$ be a finite sequence of integers with $k$ distinct terms, where $r_{i}\geq 1$ for $i=1,2,\ldots,k$. Given a subsequence $\mathcal{B}$ of $\mathcal{A}$…
In this paper we study the distribution of very short sequences of inversive congruential pseudorandom numbers modulo $2^t$. We derive a new bound on exponential sums with such sequences and use it to give estimate their discrepancy. The technique we use, based the method of N. M. Korobov (1972) of estimating double Weyl sums and a fully explicit form of the Vinogradov mean value theorem due to K. Ford (2002), has never been used in this area and is very likely to find further applications.
Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The Kemperman Structure Theorem characterizes all subsets $A,\,B\subseteq G$ satisfying $|A+B|<|A|+|B|$ and has been extended to cover the case when $|A+B|\leq |A|+|B|$. Utilizing these results, we provide a precise structural description of all finite subsets $A\subseteq G$ with $|nA|\leq (|A|+1)n-3$ when $n\geq 3$ (also when $G$ is infinite), in which case many of the pathological possibilities from the case $n=2$ vanish, particularly for large $n\geq \…
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 …
Suppose that $A$, $B$ and $S$ are non-empty subsets of a finite abelian group $G$. Then the generalized restricted sumset $$ A\stackrel{S}+B:=\{a+b:\,a\in A,\ b\in B,\ a-b\not\in S\} $$ contains at least $$ \min\{|A|+|B|-3|S|,p(G)\} $$ elements, where $p(G)$ is the least prime factor of $|G|$. Further, we also have $$ |A\stackrel{S}+B|\geq \min\{|A|+|B|-|S|-2,p(G)\}, $$ provided that both $|A|$ and $|B|$ are large with respect to $|S|$.
Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar Theorem or the Partition Theorem, has become a powerful tool used to prove numerous zero-sum and subsequence sum questions. It provides a structural description of sequences having a small number of $n$-term subsequence sums, ensuring this is only possible if most terms of the sequence are contained in a small number of $H$-cosets. For large $n\geq \frac1p|G|-1$ o…
Let $G$ be a finite abelian group with exponent $n$. Let $η(G)$ denote the smallest integer $\ell$ such that every sequence over $G$ of length at least $\ell$ has a zero-sum subsequence of length at most $n$. We determine the precise value of $η(G)$ when $G$ is a $p$-group whose Davenport constant is at most $2n-1$. This confirms one of the equalities in a conjecture by Schmid and Zhuang from 2010.
For a finite abelian group $G$ with subsets $A$ and $B$, the sumset $AB$ is $\{ab \mid a\in A, b \in B\}$. A fundamental problem in additive combinatorics is to find a lower bound for the cardinality of $AB$ in terms of the cardinalities of $A$ and $B$. This article addresses the analogous problem for sequences in abelian groups and flags in field extensions. For a positive integer $n$, let $[n]$ denote the set $\{0,\dots,n-1\}$. To a finite abelian group $G$ of cardinality $n$ and an ordering $G = \{1=v_0,\dots,v_{n-1}\}$, associate the function $T \colon [n] \times [n] \rightarrow [n]$ defin…
For a positive integer $h$ and a subset $A$ of a given finite abelian group, we let $hA$, $h \hat{\;} A$, and $h_{\pm}A$ denote the $h$-fold sumset, restricted sumset, and signed sumset of $A$, respectively. Here we review some of what is known and not yet known about the minimum sizes of these three types of sumsets, as well as their corresponding critical numbers. In particular, we discuss several new open direct and inverse problems.
The purpose of the article is to provide an unified way to formulate zero-sum invariants. Let $G$ be a finite additive abelian group. Let $B(G)$ denote the set consisting of all nonempty zero-sum sequences over G. For $Ω\subset B(G$), let $d_Ω(G)$ be the smallest integer $t$ such that every sequence $S$ over $G$ of length $|S|\geq t$ has a subsequence in $Ω$.We provide some first results and open problems on $d_Ω(G)$.
As a consequence of their work, Bruce C. Berndt and Ronald J. Evans in 1977 and Larry Joel Goldstein and Michael Razar in 1976 obtained a formula for the square of the class number of an imaginary quadratic number field in terms of Dedekind sums. Here we focus only on this formula and give a new short and simple proof of it. We finally express the relative class numbers of imaginary abelian number fields in terms of Dedekind sums.
Let $a(n)$ denote the number of non-isomorphic abelian groups with $n$ elements. In 1991 Ivić proved an asymptotic formula of the sum $\sum_{n\leq x} a(n+ a(n)).$ In this paper, we will prove a sharper asymptotic formula for this sum.
Let $G$ be a finite additive abelian group with exponent $d^kn, d,n>1,$ and $k$ a positive integer. For $S$ a sequence over $G$ and $A=\{1,2,\ldots,d^kn-1\}\setminus\{d^kn/d^i:i\in[1,k]\}, $ we investigate the lower bound of the number $N_{A,0}(S)$, which denotes the number of $A$-weighted zero-sum subsequences of $S.$ In particular, we prove that $N_{A,0}(S)\ge 2^{|S|-D_A(G)+1},$ where $D_A(G)$ is the $A$-weighted Davenport Constant. We also characterize the structures of the extremal sequences for which equality holds for some groups.
On the Minimum Size of Signed Sumsets in Elementary Abelian Groups
对于有限阿贝尔群$G$和正整数$m$和$h$，我们令$$ρ(G, m, h) = \min \{|hA| \; : \; A \subseteq G, |A|=m\}$$和$$ρ_{\pm} (G, m, h) = \min \{|h_{\pm} A| \; : \; A \subseteq G, |A|=m\},$$，其中$hA$和$h_{\pm} A$分别表示$A$的$h$ -倍符号和集和$h$ -倍符号和集.对$ρ(G, m, h)$的研究已有200年的历史，目前已知的有$G$、$m$和$h$。在以前的工作中，我们提供了一个上限$ρ_{\pm} (G, m, h)$，我们相信是准确的，并证明了$ρ_{\pm} (G, m, h)$同意$ρ(G, m, h)$时，$G$是循环的。在这里，我们研究$ρ_{\pm} (G, m, h)$初等阿贝尔群$G$，特别是，我们确定所有的$m$值为$ρ_{\pm} (\mathbb{Z}_p^2, m, 2)$等于$ρ(\mathbb{Z}_p^2, m, 2)$为一个给定的素数$p$。
Let $G=(\mathbb Z/n\mathbb Z) \oplus (\mathbb Z/n\mathbb Z)$. Let $\mathsf {s}_{\leq k}(G)$ be the smallest integer $\ell$ such that every sequence of $\ell$ terms from $G$, with repetition allowed, has a nonempty zero-sum subsequence with length at most $k$. It is known that $\mathsf {s}_{\leq 2n-1-k}(G)=2n-1+k$ for $k\in [0,n-1]$, with the structure of extremal sequences showing this bound tight determined when $k\in \{0,1,n-1\}$, and for various special cases when $k\in [2,n-2]$. For the remaining values $k\in [2,n-2]$, the characterization of extremal sequences of length $2n-2+k$ avoiding …
For a finite set $A$ of size $n$, an ordering is an injection from $\{1,2,\ldots,n\}$ to $A$. We present results concerning the asymptotic properties of the length $L_n$ of the longest arithmetic subsequence in a random ordering of an additive set $A$. In the torsion-free case where $A = [1,n]^d\subseteq {\bf Z}^d$, we prove that $L_n\sim 2d\log n/\log\log n$. We show that the case $A = {\bf Z}/n{\bf Z}$ behaves asymptotically like the torsion-free case with $d=1$, and then use this fact to compute the expected length of the longest arithmetic subsequence in a random ordering of an arbitrary f…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given explicitly in terms of partial Bell polynomials that depend on at most d-1 terms of the generalized Lucas sequence associated with the given recurrence. We also provide an elegant formula for the partial sums of such sequences and illustrate all of our results with examples of various orders, including common generalizations of the Fibonacci numbers.
Let $A$ be a multiset with elements in an abelian group. Let $FS(A)$ be the multiset containing the $2^{|A|}$ sums of all subsets of $A$. We study the reconstruction problem ``Given $FS(A)$, is it possible to identify $A$?'', and we give a satisfactory answer for all abelian groups. We prove that, up to identifying multisets through a natural equivalence relation, the function $A \mapsto FS(A)$ is injective (and thus the reconstruction problem is solvable) if and only if every order $n$ of a torsion element of the abelian group satisfies a certain number-theoretical property linked to the mult…
Let $G$ be a finite abelian group. Let $g(G)$ be the smallest positive integer $t$ such that every subset of cardinality $t$ of the group $G$ contains a subset of cardinality $\mathrm{exp}(G)$ whose sum is zero. In this paper, we show that if X is a subset of $\mathbb{Z}^2_{2n}$ with cardinality $4n+1$ and $2n$ or $2n-1$ elements of $X$ have the same first coordintes, then $X$ contains a zero sum subset. As an application of our results we prove that $g(\mathbb{Z}^2_6) = 13.$ This settles Gao-Thangaduri's conjecture for the case $n=6.$ We also prove some results towards the general even $n$ ca…
By well known results of probability theory, any sequence of random variables with bounded second moments has a subsequence satisfying the central limit theorem and the law of the iterated logarithm in a randomized form. In this paper we give criteria for a sequence $(X_n)$ of random variables to have a subsequence $(X_{n_k})$ whose weighted partial sums, suitably normalized, converge weakly to a stable distribution with parameter $0<α<2$.
Let $G$ be an abelian group of finite order $n$, and let $h$ be a positive integer. A subset $A$ of $G$ is called {\em weakly $h$-incomplete}, if not every element of $G$ can be written as the sum of $h$ distinct elements of $A$; in particular, if $A$ does not contain $h$ distinct elements that add to zero, then $A$ is called {\em weakly $h$-zero-sum-free}. We investigate the maximum size of weakly $h$-incomplete and weakly $h$-zero-sum-free sets in $G$, denoted by $C_h(G)$ and $Z_h(G)$, respectively. Among our results are the following: (i) If $G$ is of odd order and $(n-1)/2 \leq h \leq n-2$…
A $Γ$-magic rectangle set $MRS_Γ(a, b; c)$ of order $abc$ is a collection of $c$ arrays $(a\times b)$ whose entries are elements of group $Γ$, each appearing once, with all row sums in every rectangle equal to a constant $ω\in Γ$ and all column sums in every rectangle equal to a constant $δ\in Γ$. In this paper we prove that for $\{a,b\}\neq\{2^α,2k+1\}$ where $α$ and $k$ are some natural numbers, a $Γ$-magic rectangle set MRS$_Γ(a, b;c)$ exists if and only if $a$ and $b$ are both even or and $|Γ|$ is odd or $Γ$ has more than one involution. Moreover we obtain sufficient and necessary conditio…
