Graham's rearrangement for a class of semidirect products
Abstract
A famous conjecture of Graham asserts that every set A ⊂eq Zp \0\ can be ordered so that all partial sums are distinct. Bedert and Kravitz proved that this statement holds whenever |A| ≤ ec( p)1/4. In this paper, we will use a similar procedure to obtain an upper bound of the same type in the case of semidirect products Zp H where : H Aut(Zp) satisfies (h) ∈ \id, -id\ for each h ∈ H and where H is abelian and each subset of H can be ordered such that all of its partial products are distinct.
0
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.