Conjecture on weak sequenceability of abelian groups

About 4 years old · traced to

Let tt be a positive integer, let GG be an abelian group, and let AA be a finite subset of G∖{0}G\setminus\{0\} with ∣A∣=k>t|A|=k>t. An ordering of AA is a tt-weak sequencing if its partial sums s0,s1,…,sks_0,s_1,\ldots,s_k satisfy si≠sjs_i\ne s_j whenever i≠ji\ne j and ∣i−j∣≤t|i-j|\leq t; AA is tt-weak sequenceable if it admits such an ordering.

Weak sequenceability conjecture. The set AA is tt-weak sequenceable. Equivalently, every abelian group is tt-weak sequenceable.

This is a weakening of strong sequenceability motivated by a graph-theoretic interpretation of partial sums as walks with large girth. The paper presents it as an analogue of the Alspach–Liversidge conjecture; no resolution is supplied.

References

Primary source

Simone Costa and Stefano Della Fiore, “Weak Sequenceability in Cyclic Groups”, arXiv:2205.12017 (2022).

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.