Structure of sets with small product sets in torsion-free groups, cyclic groups of prime orders and abelian groups
Raj Kumar Mistri, Nitesh Prajapati

TL;DR
This paper establishes optimal lower bounds for generalized product sets in torsion-free and cyclic groups, characterizes the structure of sets achieving these bounds, and extends inverse theorems in additive combinatorics.
Contribution
It provides the first optimal bounds and structural characterizations for generalized product sets in non-abelian torsion-free groups and cyclic groups of prime order, extending classical additive combinatorics results.
Findings
Optimal lower bounds for generalized product sets in torsion-free groups.
Structural characterization of sets attaining the bounds.
New proofs and extensions of the DeVos-Goddyn-Mohar Theorem and subsequence sum results.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Finite Group Theory Research · graph theory and CDMA systems
