A Generalisation on Erdos Distinct Subset Sums Problem
Abstract
This paper investigates the Erdos distinct subset sums problem in Zk. Beyond the classical variance method, using alternative statistical quantities like E[\|X\|1] and E[\|X\|33] can yield better bounds in certain dimensions. This innovation improves previous low-dimensional results and provides a framework for choosing suitable methods depending on the dimension.
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.