Table of Contents
Fetching ...

Direct and Inverse Problems for Restricted Signed Sumsets -- I

Raj Kumar Mistri, Nitesh Prajapati

TL;DR

We study the direct and inverse problems for the restricted $h$-fold signed sumset $h^{\wedge}_{\pm}A$ in additive abelian groups, focusing on $G = \mathbb{Z}$. The authors develop a suite of auxiliary lemmas and constructive techniques to derive tight lower bounds for $|h^{\wedge}_{\pm}A|$ and to characterize extremal sets. They prove the conjectures of Bhanja, Komatsu and Pandey for sets of positive integers, showing that equality in the extremal bound forces $A$ to be a dilate of the odd progression $\{1,3,\ldots,2k-1\}$; a follow-up work extends these results to nonnegative integers. The results advance understanding of restricted signed sumsets and inverse problems in additive combinatorics, with potential implications for related sumset problems and broader applications in number theory.

Abstract

Let $A=\{a_{1},\ldots,a_{k}\}$ be a nonempty finite subset of an additive abelian group $G$. For a positive integer $h$, the $h$-fold signed sumset of $A$, denoted by $h_{\pm}A$, is defined as $$h_{\pm}A=\left\lbrace \sum_{i=1}^{k} λ_{i} a_{i}: λ_{i} \in \{-h, \ldots, 0, \ldots, h\} \ \text{for} \ i= 1, 2, \ldots, k \ \text{and} \ \sum_{i=1}^{k} \left|λ_{i} \right| =h\right\rbrace,$$ and 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. $$ A direct problem for the sumset $h^{\wedge}_{\pm}A$ is to find the optimal size of $h^{\wedge}_{\pm}A$ in terms of $h$ and $|A|$. An inverse problem for this sumset is to determine the structure of the underlying set $A$ when the sumset $h^{\wedge}_{\pm}A$ has optimal size. While some results are known for the signed sumsets in finite abelian groups due to Bajnok and Matzke, not much is known for the restricted $h$-fold signed sumset $h^{\wedge}_{\pm}A$ even in the additive group of integers $\Bbb Z$. In case of $G = \Bbb Z$, Bhanja, Komatsu and Pandey studied these problems for the sumset $h^{\wedge}_{\pm}A$ for $h=2, 3$, and $k$, and conjectured the direct and inverse results for $h \geq 4$. In this paper, we prove these conjectures completely for the sets of positive integers. In a subsequent paper, we prove these conjectures for the sets of nonnegative integers.

Direct and Inverse Problems for Restricted Signed Sumsets -- I

TL;DR

We study the direct and inverse problems for the restricted -fold signed sumset in additive abelian groups, focusing on . The authors develop a suite of auxiliary lemmas and constructive techniques to derive tight lower bounds for and to characterize extremal sets. They prove the conjectures of Bhanja, Komatsu and Pandey for sets of positive integers, showing that equality in the extremal bound forces to be a dilate of the odd progression ; a follow-up work extends these results to nonnegative integers. The results advance understanding of restricted signed sumsets and inverse problems in additive combinatorics, with potential implications for related sumset problems and broader applications in number theory.

Abstract

Let be a nonempty finite subset of an additive abelian group . For a positive integer , the -fold signed sumset of , denoted by , is defined as and the restricted -fold signed sumset of , denoted by , is defined as A direct problem for the sumset is to find the optimal size of in terms of and . An inverse problem for this sumset is to determine the structure of the underlying set when the sumset has optimal size. While some results are known for the signed sumsets in finite abelian groups due to Bajnok and Matzke, not much is known for the restricted -fold signed sumset even in the additive group of integers . In case of , Bhanja, Komatsu and Pandey studied these problems for the sumset for , and , and conjectured the direct and inverse results for . In this paper, we prove these conjectures completely for the sets of positive integers. In a subsequent paper, we prove these conjectures for the sets of nonnegative integers.

Paper Structure

This paper contains 3 sections, 22 theorems, 345 equations.

Key Result

Theorem A

Let $A$ be a nonempty finite set of integers with $|A| = k$ and let $1 \leq h \leq k.$ Then The lower bound in $(res-sum-bound)$ is best possible.

Theorems & Definitions (36)

  • Theorem A: nath1; nath
  • Theorem B: nath1; nath
  • Theorem C: bhanja-kom-pandey2021
  • Theorem D: bhanja-kom-pandey2021
  • Theorem E: bhanja-kom-pandey2021
  • Theorem F: bhanja-kom-pandey2021
  • Conjecture 1: bhanja-kom-pandey2021
  • Conjecture 2: bhanja-kom-pandey2021
  • Theorem 1.1
  • Theorem 1.2
  • ...and 26 more