Table of Contents
Fetching ...

Some direct and inverse problems for the Restricted Signed sumset in set of integers

Mohan, Raj Kumar Mistri, Ram Krishna Pandey

Abstract

Given a positive integer $h$ and a nonempty finite set of integers $A=\{a_{1},a_{2},\ldots,a_{k}\}$, the restricted $h$-fold signed sumset of $A$, denoted by $h^{\wedge}_{\pm}A$, is defined as $$h^{\wedge}_{\pm}A=\left\lbrace \sum_{i=1}^{k} λ_{i} a_{i}: λ_{i} \in \left\lbrace -1, 0, 1\right\rbrace \ \text{for} \ i= 1, 2, \ldots, k \ \text{and} \ \sum_{i=1}^{k} \left| λ_{i} \right| =h\right\rbrace.$$ The direct problem associated with this sumset is to find the optimal lower bound of $|h^{\wedge}_{\pm}A|$, and the inverse problem associated with this sumset is to determine the structure of the underlying set $A$, when $|h^{\wedge}_{\pm}A|$ 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 \geq 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.

Some direct and inverse problems for the Restricted Signed sumset in set of integers

Abstract

Given a positive integer and a nonempty finite set of integers , the restricted -fold signed sumset of , denoted by , is defined as The direct problem associated with this sumset is to find the optimal lower bound of , and the inverse problem associated with this sumset is to determine the structure of the underlying set , when attains the optimal lower bound. Bhanja, Komatsu and Pandey studied the direct and inverse problem for the restricted -fold signed sumset for , and and conjectured some direct and inverse results for . In this paper, we prove these conjectures for . We also prove the direct and inverse theorems for arbitrary under certain restrictions on the set which are particular cases of the conjectures. Moreover, we prove these conjectures for arithmetic progressions.
Paper Structure (5 sections, 21 theorems, 139 equations)

This paper contains 5 sections, 21 theorems, 139 equations.

Key Result

Theorem 1

Let $h$ and $k$ be positive integers with $h \leq k$. Let $A$ be a set of $k$ nonnegative integers. If $0 \notin A$, then If $0 \in A$, then These lower bounds are best possible for $h=1,2$, and k.

Theorems & Definitions (37)

  • Theorem 1: BhanjaKomPandey2021
  • Conjecture 1: BhanjaKomPandey2021
  • Conjecture 2: BhanjaKomPandey2021
  • Theorem 2: Nathanson1996
  • Lemma 1
  • proof
  • Lemma 2
  • Theorem 3
  • proof
  • Corollary 1
  • ...and 27 more