Graham's rearrangement for a class of semidirect products
arXiv:2503.18101
Abstract
A famous conjecture of Graham asserts that every set can be ordered so that all partial sums are distinct. Bedert and Kravitz proved that this statement holds whenever . In this paper, we will use a similar procedure to obtain an upper bound of the same type in the case of semidirect products where satisfies for each and where is abelian and each subset of can be ordered such that all of its partial products are distinct.