Weak multiset sequenceability and weak BHR conjecture
Abstract
A subset S of a group (G,+) is t-weakly sequenceable if there is an ordering (y1, …, yk) of its elements such that the partial sums~s0, s1, …, sk, given by s0 = 0 and si = Σj=1i yj for 1 ≤ i ≤ k, satisfy si ≠ sj whenever and 1 ≤ |i-j|≤ t. In this paper, we consider the weak sequenceability problem on multisets. In particular, we are able to prove that a multiset M=[a1λ1,a2λ2,…,anλn] of non-identity elements of a generic group G is t-weakly sequenceable whenever the underlying set \a1,a2,…,an\ is sufficiently large (with respect to t) and the smallest prime divisor p of |G| is larger than t. A related question is the one posed by the Buratti, Horak, and Rosa (briefly BHR) conjecture here considered again in the weak sense. Given a multiset M and a walk W in Cay[G: M], we say that W is a realization of M if (W)= M. Here we prove that a multiset M=[a1λ1,a2λ2,…,anλn] of non-identity elements of G admits a realization W=(w0,…,w) such that wi≠ wj whenever and 1 ≤ |i-j|≤ t assuming that |M|=λ1+λ2+…+λn is sufficiently large and the smallest prime divisor p of |G| is larger than t(2t+1).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.