Some direct and inverse problems for the Restricted Signed sumset in set of integers
Abstract
Given a positive integer h and a nonempty finite set of integers A=\a1,a2,…,ak\, the restricted h-fold signed sumset of A, denoted by hA, is defined as hA= Σi=1k λi ai: λi ∈ -1, 0, 1 \ for \ i= 1, 2, …, k \ and \ Σi=1k | λi | =h. The direct problem associated with this sumset is to find the optimal lower bound of |hA|, and the inverse problem associated with this sumset is to determine the structure of the underlying set A, when |hA| attains the optimal lower bound. Bhanja, Komatsu and Pandey studied the direct and inverse problem for the restricted h-fold signed sumset for h=2, 3, and k and conjectured some direct and inverse results for h ≥ 4. In this paper, we prove these conjectures for h=4. We also prove the direct and inverse theorems for arbitrary h under certain restrictions on the set A which are particular cases of the conjectures. Moreover, we prove these conjectures for arithmetic progressions.
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.