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

Abstract

Let and m be positive integers with ≤ m, and let A = (A1, …, Am) be a finite sequence of finite subsets of a group G (not necessarily abelian), written multiplicatively. The generalized product set (A) is the set of all elements of G which can be represented as a product of exactly elements from distinct sets from 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 (A) in torsion-free groups (not necessarily abelian), and characterize the structure of underlying sets in the sequence A = (A1, …, Am) for which (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 Zp. 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…