scholarly journals Erdős-Ginzburg-Ziv Constants by Avoiding Three-Term Arithmetic Progressions

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. 

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.


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].


Author(s):  
Weidong Gao ◽  
Siao Hong ◽  
Wanzhen Hui ◽  
Xue Li ◽  
Qiuyu Yin ◽  
...  

10.37236/970 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Fang Sun

Let $G$ be a finite abelian group with exponent $m$, and let $S$ be a sequence of elements in $G$. Let $f(S)$ denote the number of elements in $G$ which can be expressed as the sum over a nonempty subsequence of $S$. In this paper, we show that, if $|S|=m$ and $S$ contains no nonempty subsequence with zero sum, then $f(S)\geq 2m-1$. This answers an open question formulated by Gao and Leader. They proved the same result with the restriction $(m,6)=1$.


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$.


Integers ◽  
2012 ◽  
Vol 12 (4) ◽  
Author(s):  
Weidong Gao ◽  
Linlin Wang

Abstract.Letdenote the cross number ofWe determine


2017 ◽  
Vol 14 (01) ◽  
pp. 167-191 ◽  
Author(s):  
Dongchun Han ◽  
Hanbin Zhang

Let [Formula: see text] be an additive finite abelian group with exponent [Formula: see text]. For any positive integer [Formula: see text], let [Formula: see text] be the smallest positive integer [Formula: see text] such that every sequence [Formula: see text] in [Formula: see text] of length at least [Formula: see text] has a zero-sum subsequence of length [Formula: see text]. Let [Formula: see text] be the Davenport constant of [Formula: see text]. In this paper, we prove that if [Formula: see text] is a finite abelian [Formula: see text]-group with [Formula: see text] then [Formula: see text] for every [Formula: see text], which confirms a conjecture by Gao et al. recently, where [Formula: see text] is a prime.


2013 ◽  
Vol 09 (04) ◽  
pp. 813-843 ◽  
Author(s):  
GREG MARTIN ◽  
NATHAN NG

Let L(s, χ) be a fixed Dirichlet L-function. Given a vertical arithmetic progression of T points on the line ℜs = ½, we show that at least cT/ log T of them are not zeros of L(s, χ) (for some positive constant c). This result provides some theoretical evidence towards the conjecture that all nonnegative ordinates of zeros of Dirichlet L-functions are linearly independent over the rationals. We also establish an upper bound (depending upon the progression) for the first member of the arithmetic progression that is not a zero of L(s, χ).


2018 ◽  
Vol 155 (1) ◽  
pp. 126-163 ◽  
Author(s):  
Andrew Granville ◽  
Adam J. Harper ◽  
K. Soundararajan

Halász’s theorem gives an upper bound for the mean value of a multiplicative function$f$. The bound is sharp for general such$f$, and, in particular, it implies that a multiplicative function with$|f(n)|\leqslant 1$has either mean value$0$, or is ‘close to’$n^{it}$for some fixed$t$. The proofs in the current literature have certain features that are difficult to motivate and which are not particularly flexible. In this article we supply a different, more flexible, proof, which indicates how one might obtain asymptotics, and can be modified to treat short intervals and arithmetic progressions. We use these results to obtain new, arguably simpler, proofs that there are always primes in short intervals (Hoheisel’s theorem), and that there are always primes near to the start of an arithmetic progression (Linnik’s theorem).


Sign in / Sign up

Export Citation Format

Share Document