The lower-bound conjecture for the zero-sum-free sequence constant

Let n>1n>1 be a positive integer, and let pp be the smallest prime divisor of nn. For positive integers nn and kk, let

h(n,k)=min{h(S)S=n+k},h(n,k)=\min\{h(S)\mid |S|=n+k\},

where SS ranges over sequences in Zn\mathbb{Z}_n of length n+kn+k such that 0n(S)0\notin\sum_n(S). Lower-bound conjecture. If k(n/p)1k\geq (n/p)-1, then

h(n,k)k+1.h(n,k)\geq k+1.

This conjecture extends known lower bounds for h(n,k)h(n,k) and addresses the range in which the previously expected bound has counterexamples. Its status is unresolved in the supplied source.

Sources & referencesView supporting material

Primary source

W D Gao, A Panigrahi and R Thangadurai, “On the structure of p-zero-sum free sequences and its application to a variant of Erdos–Ginzburg–Ziv theorem”, arXiv:math/0503095 (2005).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.