Table of Contents
Fetching ...

Structure of sets with small product sets in torsion-free groups, cyclic groups of prime orders and abelian groups

Raj Kumar Mistri, Nitesh Prajapati

Abstract

Let $\ell$ and $m$ be positive integers with $\ell \leq m$, and let $\mathcal{A} = (A_1, \ldots, A_m)$ be a finite sequence of finite subsets of a group $G$ (not necessarily abelian), written multiplicatively. The {\it generalized product set} $Π^{\ell}(\mathcal{A})$ is the set of all elements of $G$ which can be represented as a product of exactly $\ell$ elements from $\ell$ distinct sets from $\mathcal{A}$ taken in any order. DeVos, Goddyn and Mohar obtained the nontrivial lower bound for the size of this product set when $G$ is abelian. The DeVos-Goddyn-Mohar Theorem is a fundamental result in additive combinatorics which unifies various results from zero-sum combinatorics and has connections with subsequence sums and sumsets. In this paper, we obtain an optimal lower bound for the size of generalized product set $Π^{\ell}(\mathcal{A})$ in torsion-free groups (not necessarily abelian), and characterize the structure of underlying sets in the sequence $\mathcal{A} = (A_1, \ldots, A_m)$ for which $Π^{\ell}(\mathcal{A})$ achieves the optimal lower bound. By slightly modifying the arguments of the proofs in the case of torsion-free groups, we derive such inverse theorems in cyclic groups of prime orders also. Our proof of these result also yields a new proof of DeVos-Goddyn-Mohar Theorem in $\mathbb{Z}_p$. Moreover, we extend these inverse results to arbitrary abelian groups. Furthermore, as an application, we generalize a theorem for subsequence sums due to Hamidoune in torsion-free groups, and obtain several other results for subsequence sums in arbitrary groups.

Structure of sets with small product sets in torsion-free groups, cyclic groups of prime orders and abelian groups

Abstract

Let and be positive integers with , and let be a finite sequence of finite subsets of a group (not necessarily abelian), written multiplicatively. The {\it generalized product set} is the set of all elements of which can be represented as a product of exactly elements from distinct sets from taken in any order. DeVos, Goddyn and Mohar obtained the nontrivial lower bound for the size of this product set when is abelian. The DeVos-Goddyn-Mohar Theorem is a fundamental result in additive combinatorics which unifies various results from zero-sum combinatorics and has connections with subsequence sums and sumsets. In this paper, we obtain an optimal lower bound for the size of generalized product set in torsion-free groups (not necessarily abelian), and characterize the structure of underlying sets in the sequence for which achieves the optimal lower bound. By slightly modifying the arguments of the proofs in the case of torsion-free groups, we derive such inverse theorems in cyclic groups of prime orders also. Our proof of these result also yields a new proof of DeVos-Goddyn-Mohar Theorem in . Moreover, we extend these inverse results to arbitrary abelian groups. Furthermore, as an application, we generalize a theorem for subsequence sums due to Hamidoune in torsion-free groups, and obtain several other results for subsequence sums in arbitrary groups.
Paper Structure (10 sections, 52 theorems, 339 equations)

This paper contains 10 sections, 52 theorems, 339 equations.

Key Result

Theorem 1.1

Let $\ell \geq 2$ be an integer. Let $p$ be a prime, and let $A_1, \ldots, A_{\ell}$ be nonempty subset of $\mathbb{Z}_p$. Then

Theorems & Definitions (88)

  • Theorem 1.1: Cauchy-Davenport Theorem
  • Theorem 1.2
  • Theorem 1.3
  • Theorem 1.4: DeVos-Goddyn-Mohar Theorem
  • Theorem 1.5
  • Corollary 1.6
  • Definition 1.7: Geometric progression of type $(a, g, b)$
  • Remark 1.8
  • Remark 1.9
  • Definition 1.10: $(\ell, g)$- minimizing sequence of sets
  • ...and 78 more