AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to guarantee the existence of a subsequence xi1,…,xin and units α1,…,αn with α1xi1+⋯+αnxin=0? Our main aim in this paper is to show that r=n+a is large enough, where a is the sum of the exponents of primes in the prime factorisation of n. This result, which is best possible, could be viewed as a unit version of the Erdős–Ginzberg–Ziv theorem. This proves a conjecture of Adhikari, Chen, Friedlander, Konyagin and Pappalardi.We also discuss a number of related questions, and make conjectures which would greatly extend a theorem of Gao
Given k,ℓ∈N+, let xi,j be, for 1≤i≤k and 0≤j≤ℓ some fixed integers, and define, for every n∈N+, sn:=...
Given k,ℓ∈N+, let xi,j be, for 1≤i≤k and 0≤j≤ℓ some fixed integers, and define, for every n∈N+, sn:=...
AbstractLet ϵ(N) > 0 be a function of positive integers N and such that ϵ(N) → 0 and Nϵ(N) → ∞ as N ...
AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to g...
AbstractA prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says tha...
AbstractIn 1966 P. Erdös proved the following theorem:Let B = {bi: 1 < b1 < b2 < b3 < …} be an infin...
AbstractSuppose ε > 0 and k > 1. We show that if n > n0(k, ε) and A ⊆ Zn satisfies |A| > ((1k) + ε)n...
AbstractLet Pr denote an almost-prime with at most r prime factors, counted according to multiplicit...
AbstractThe following two facts are shown: 1.(i) There is a computable constant γ > 0 such that, giv...
AbstractIn this note, we supply the details of the proof of the fact that if a1,…,an+Ω(n) are intege...
AbstractErdös, Ginzburg and Ziv proved that any sequence of 2n−1 (not necessary distinct) members of...
AbstractGiven a positive integer l, this paper establishes the existence of constants η > 1 and δ > ...
AbstractTextLet S be a sequence of n nonnegative integers not exceeding n−1 such that S takes at lea...
AbstractGiven a set A⊂N let σA(n) denote the number of ordered pairs (a,a′)∈A×A such that a+a′=n. Th...
Given k,ℓ∈N+, let xi,j be, for 1≤i≤k and 0≤j≤ℓ some fixed integers, and define, for every n∈N+, sn:=...
Given k,ℓ∈N+, let xi,j be, for 1≤i≤k and 0≤j≤ℓ some fixed integers, and define, for every n∈N+, sn:=...
Given k,ℓ∈N+, let xi,j be, for 1≤i≤k and 0≤j≤ℓ some fixed integers, and define, for every n∈N+, sn:=...
AbstractLet ϵ(N) > 0 be a function of positive integers N and such that ϵ(N) → 0 and Nϵ(N) → ∞ as N ...
AbstractLet x1,…,xr be a sequence of elements of Zn, the integers modulo n. How large must r be to g...
AbstractA prototype of zero-sum theorems, the well-known theorem of Erdős, Ginzburg and Ziv says tha...
AbstractIn 1966 P. Erdös proved the following theorem:Let B = {bi: 1 < b1 < b2 < b3 < …} be an infin...
AbstractSuppose ε > 0 and k > 1. We show that if n > n0(k, ε) and A ⊆ Zn satisfies |A| > ((1k) + ε)n...
AbstractLet Pr denote an almost-prime with at most r prime factors, counted according to multiplicit...
AbstractThe following two facts are shown: 1.(i) There is a computable constant γ > 0 such that, giv...
AbstractIn this note, we supply the details of the proof of the fact that if a1,…,an+Ω(n) are intege...
AbstractErdös, Ginzburg and Ziv proved that any sequence of 2n−1 (not necessary distinct) members of...
AbstractGiven a positive integer l, this paper establishes the existence of constants η > 1 and δ > ...
AbstractTextLet S be a sequence of n nonnegative integers not exceeding n−1 such that S takes at lea...
AbstractGiven a set A⊂N let σA(n) denote the number of ordered pairs (a,a′)∈A×A such that a+a′=n. Th...
Given k,ℓ∈N+, let xi,j be, for 1≤i≤k and 0≤j≤ℓ some fixed integers, and define, for every n∈N+, sn:=...
Given k,ℓ∈N+, let xi,j be, for 1≤i≤k and 0≤j≤ℓ some fixed integers, and define, for every n∈N+, sn:=...
Given k,ℓ∈N+, let xi,j be, for 1≤i≤k and 0≤j≤ℓ some fixed integers, and define, for every n∈N+, sn:=...
AbstractLet ϵ(N) > 0 be a function of positive integers N and such that ϵ(N) → 0 and Nϵ(N) → ∞ as N ...