Alternating Parity Weak Sequencing

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 [10] it was proved that if the order of a group is pe then all sufficiently large subsets of the non-identity elements are t-weakly sequenceable when p > 3 is prime, e ≤ 3 and t ≤ 6. Inspired by this result, we show that, if G is the semidirect product of Zp and Z2 and the subset S is balanced, then S admits, regardless of its size, an alternating parity t-weak sequencing whenever p > 3 is prime and t ≤ 8. A subset of G is balanced if it contains the same number of even elements and odd elements and an alternating parity ordering alternates even and odd elements. Then using a hybrid approach that combines both Ramsey theory and the probabilistic method we also prove, for groups G that are semidirect products of a generic (non necessarily abelian) group N and Z2, that all sufficiently large balanced subsets of the non-identity elements admit an alternating parity t-weak sequencing. The same procedure works also for studying the weak sequenceability for generic sufficiently large (not necessarily balanced) sets. Here we have been able to prove that, if the size of a subset S of a group G is large enough and if S does not contain 0, then S is t-weakly sequenceable.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…