Search arXivSearch

arXiv · 2602.19168

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

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Raj Kumar Mistri, Nitesh Prajapati. 2026-02-22. Structure of sets with small product sets in torsion-free groups, cyclic groups of prime orders and abelian groups. https://arxiv.org/abs/2602.19168

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO