scholarly journals The Minimum Size of Signed Sumsets

10.37236/4881 ◽  
2015 ◽  
Vol 22 (2) ◽  
Author(s):  
Béla Bajnok ◽  
Ryan Matzke

For a finite abelian group $G$ and positive integers $m$ and $h$, we let $$\rho(G, m, h) = \min \{ |hA| \; : \; A \subseteq G, |A|=m\}$$ and$$\rho_{\pm} (G, m, h) = \min \{ |h_{\pm} A| \; : \; A \subseteq G, |A|=m\},$$ where $hA$ and $h_{\pm} A$ denote the $h$-fold sumset and the $h$-fold signed sumset of $A$, respectively. The study of $\rho(G, m, h)$ has a 200-year-old history and is now known for all $G$, $m$, and $h$. Here we prove that $\rho_{\pm}(G, m, h)$ equals $\rho (G, m, h)$ when $G$ is cyclic, and establish an upper bound for $\rho_{\pm} (G, m, h)$ that we believe gives the exact value for all $G$, $m$, and $h$.

2011 ◽  
Vol 12 (01n02) ◽  
pp. 125-135 ◽  
Author(s):  
ABBY GAIL MASK ◽  
JONI SCHNEIDER ◽  
XINGDE JIA

Cayley digraphs of finite abelian groups are often used to model communication networks. Because of their applications, extremal Cayley digraphs have been studied extensively in recent years. Given any positive integers d and k. Let m*(d, k) denote the largest positive integer m such that there exists an m-element finite abelian group Γ and a k-element subset A of Γ such that diam ( Cay (Γ, A)) ≤ d, where diam ( Cay (Γ, A)) denotes the diameter of the Cayley digraph Cay (Γ, A) of Γ generated by A. Similarly, let m(d, k) denote the largest positive integer m such that there exists a k-element set A of integers with diam (ℤm, A)) ≤ d. In this paper, we prove, among other results, that [Formula: see text] for all d ≥ 1 and k ≥ 1. This means that the finite abelian group whose Cayley digraph is optimal with respect to its diameter and degree can be a cyclic group.


2001 ◽  
Vol 63 (1) ◽  
pp. 115-121 ◽  
Author(s):  
T. Bier ◽  
A. Y. M. Chin

Let A be a finite Abelian group written additively. For two positive integers k, l with k ≠ l, we say that a subset S ⊂ A is of type (k, l) or is a (k, l) -set if the equation x1 + x2 + … + xk − xk+1−… − xk+1 = 0 has no solution in the set S. In this paper we determine the largest possible cardinality of a (k, l)-set of the cyclic group ℤP where p is an odd prime. We also determine the number of (k, l)-sets of ℤp which are in arithmetic progression and have maximum cardinality.


2017 ◽  
Vol 13 (02) ◽  
pp. 301-308 ◽  
Author(s):  
Mohan N. Chintamani ◽  
Prabal Paul

Let [Formula: see text] be a finite abelian group with exponent exp[Formula: see text]. Let [Formula: see text]. The constant [Formula: see text] is defined as the least positive integer [Formula: see text] such that for any given sequence [Formula: see text] of elements of [Formula: see text] with length [Formula: see text] it has a [Formula: see text] length [Formula: see text]-weighted zero-sum subsequence. In this article, we obtain the exact value of [Formula: see text] for [Formula: see text] and an upper bound for the case [Formula: see text], where [Formula: see text] is an odd prime, [Formula: see text] is an odd integer and [Formula: see text]. We also obtain the structural information on the extremal zero-sum free sequences.


2019 ◽  
Vol 18 (09) ◽  
pp. 1950163
Author(s):  
Meena Sahai ◽  
Bhagwat Sharan

Let [Formula: see text] be an arbitrary group and let [Formula: see text] be a field of characteristic [Formula: see text]. In this paper, we give some improvements of the upper bound of the lower Lie nilpotency index [Formula: see text] of the group algebra [Formula: see text]. We also give improved bounds for [Formula: see text], where [Formula: see text] is the number of independent generators of the finite abelian group [Formula: see text]. Furthermore, we give a description of the Lie nilpotent group algebra [Formula: see text] with [Formula: see text] or [Formula: see text]. We also show that for [Formula: see text] and [Formula: see text], [Formula: see text] if and only if [Formula: see text], where [Formula: see text] is the upper Lie nilpotency index of [Formula: see text].


2018 ◽  
Vol 14 (02) ◽  
pp. 383-397 ◽  
Author(s):  
Mohan N. Chintamani ◽  
Prabal Paul

For a finite abelian group [Formula: see text] with exponent [Formula: see text], let [Formula: see text]. The constant [Formula: see text] (respectively [Formula: see text]) is defined to be the least positive integer [Formula: see text] such that given any sequence [Formula: see text] over [Formula: see text] with length [Formula: see text] has a [Formula: see text]-weighted zero-sum subsequence of length [Formula: see text] (respectively at most [Formula: see text]). In [M. N. Chintamani and P. Paul, On some weighted zero-sum constants, Int. J. Number Theory 13(2) (2017) 301–308], we proved the exact value of this constant for the group [Formula: see text] and proved the structure theorem for the extremal sequences related to this constant. In this paper, we prove the similar results for the group [Formula: see text] and we obtained an upper bound when [Formula: see text] is replaced by any integer [Formula: see text].


2016 ◽  
Vol 12 (04) ◽  
pp. 913-943 ◽  
Author(s):  
Yushuang Fan ◽  
Qinghai Zhong

Let [Formula: see text] be a finite abelian group. The Erdős–Ginzburg–Ziv constant [Formula: see text] of [Formula: see text] is defined as the smallest integer [Formula: see text] such that every sequence [Formula: see text] over [Formula: see text] of length [Formula: see text] has a zero-sum subsequence [Formula: see text] of length [Formula: see text]. The value of this classical invariant for groups with rank at most two is known. But the precise value of [Formula: see text] for the groups of rank larger than two is difficult to determine. In this paper, we pay attention to the groups of the form [Formula: see text], where [Formula: see text] and [Formula: see text]. We give a new upper bound of [Formula: see text] for odd integer [Formula: see text]. For [Formula: see text], we obtain that [Formula: see text] for [Formula: see text] and [Formula: see text] for [Formula: see text].


2019 ◽  
Vol 18 (08) ◽  
pp. 1950158
Author(s):  
Coy L. May ◽  
Jay Zimmerman

Let [Formula: see text] denote the set of positive integers that may appear as the real genus of a finite abelian group. We obtain a set of (simple) necessary conditions for an integer [Formula: see text] to belong to [Formula: see text]. We also prove that the real genus of an abelian group is not congruent to 3 modulo 4 and that the genus of an abelian group of odd order is a multiple of 4. Finally, we obtain upper and lower bounds for the density of the set [Formula: see text].


10.37236/7275 ◽  
2018 ◽  
Vol 25 (2) ◽  
Author(s):  
Jacob Fox ◽  
Lisa Sauermann

For a finite abelian group $G$, The Erdős-Ginzburg-Ziv constant $\mathfrak{s}(G)$ is the smallest $s$ such that every sequence of $s$ (not necessarily distinct) elements of $G$ has a zero-sum subsequence of length $\operatorname{exp}(G)$. For a prime $p$, let $r(\mathbb{F}_p^n)$ denote the size of the largest subset of $\mathbb{F}_p^n$ without a three-term arithmetic progression. Although similar methods have been used to study $\mathfrak{s}(G)$ and $r(\mathbb{F}_p^n)$, no direct connection between these quantities has previously been established. We give an upper bound for $\mathfrak{s}(G)$ in terms of $r(\mathbb{F}_p^n)$ for the prime divisors $p$ of $\operatorname{exp}(G)$. For the special case $G=\mathbb{F}_p^n$, we prove $\mathfrak{s}(\mathbb{F}_p^n)\leq 2p\cdot r(\mathbb{F}_p^n)$. Using the upper bounds for $r(\mathbb{F}_p^n)$ of Ellenberg and Gijswijt, this result improves the previously best known upper bounds for $\mathfrak{s}(\mathbb{F}_p^n)$ given by Naslund. 


2015 ◽  
Vol 11 (07) ◽  
pp. 2141-2150 ◽  
Author(s):  
Weidong Gao ◽  
Pingping Zhao ◽  
Jujuan Zhuang

Let G be an additive finite abelian group, and let disc (G) denote the smallest positive integer t such that every sequence S over G of length ∣S∣ ≥ t has two nonempty zero-sum subsequences of distinct lengths. We determine disc (G) for some groups including the groups [Formula: see text], the groups of rank at most two and the groups Cmpn ⊕ H, where m, n are positive integers, p is a prime and H is a p-group with pn ≥ D*(H).


10.37236/1735 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Dhruv Mubayi ◽  
Yi Zhao

Given positive integers $n,k,t$, with $2 \le k\le n$, and $t < 2^k$, let $m(n,k,t)$ be the minimum size of a family ${\cal F}$ of nonempty subsets of $[n]$ such that every $k$-set in $[n]$ contains at least $t$ sets from ${\cal F}$, and every $(k-1)$-set in $[n]$ contains at most $t-1$ sets from ${\cal F}$. Sloan et al. determined $m(n, 3, 2)$ and Füredi et al. studied $m(n, 4, t)$ for $t=2, 3$. We consider $m(n, 3, t)$ and $m(n, 4, t)$ for all the remaining values of $t$ and obtain their exact values except for $k=4$ and $t= 6, 7, 11, 12$. For example, we prove that $ m(n, 4, 5) = {n \choose 2}-17$ for $n\ge 160$. The values of $m(n, 4, t)$ for $t=7,11,12$ are determined in terms of well-known (and open) Turán problems for graphs and hypergraphs. We also obtain bounds of $m(n, 4, 6)$ that differ by absolute constants.


Sign in / Sign up

Export Citation Format

Share Document