Weak Sequenceability in Cyclic Groups
Simone Costa, Stefano Della Fiore

TL;DR
This paper introduces the concept of t-weak sequenceability in abelian groups, exploring conditions under which subsets can be ordered to produce walks with large girth in Cayley graphs, extending classical sequenceability conjectures.
Contribution
It proposes a weakening of the sequenceability conjecture, defining t-weak sequenceability, and proves that subsets of cyclic groups are t-weak sequenceable for t<7 or t<8 under certain conditions.
Findings
Any subset of Z_p extbackslash extbraceleft 0 extbraceright is t-weak sequenceable for t<7.
If the subset does not contain pairs of the form extbackslash{}{x, -x extbackslash{}}, it is t-weak sequenceable for t<8.
The concept extends classical sequenceability by allowing partial sums to form walks with girth larger than t.
Abstract
A subset of an abelian group is sequenceable if there is an ordering of its elements such that the partial sums , given by and for , are distinct, with the possible exception that we may have . In the literature there are several conjectures and questions concerning the sequenceability of subsets of abelian groups, which have been combined and summarized in into the conjecture that if a subset of an abelian group does not contain 0 then it is sequenceable. If the elements of a sequenceable set do not sum to then there exists a simple path in the Cayley graph such that . In this paper, inspired by this graph-theoretical interpretation, we propose a weakening of this conjecture. Here, under the above assumptions, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · graph theory and CDMA systems · semigroups and automata theory
