Restricted Sumsets in Finite Nilpotent Groups

2012/06/27 by Shanshan Du, Hao Pan, Du, Shanshan +1
Computer Science · Engineering · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Group Theory (math.GR) #Limits and Structures in Graph Theory #Number Theory (math.NT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1206.6160

openalex publication_date 2012/06/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Suppose that A,B are two non-empty subsets of the finite nilpotent group G. If A\not=B, then the cardinality of the restricted sumset A\dotplus B=a+b: a∈ A, b∈ B, a≠ b is at least minp(G),|A|+|B|-2, where p(G) denotes the least prime factor of |G|.

Cited by

• The inverse Erdos-Heilbronn Problem for restricted set addition in finite groups

Related

• The restricted sumsets in finite abelian groups
• On the generalized restricted sumsets in abelian groups
• On two new kinds of restricted sumsets
• On restricted sumsets over a field
• Large restricted sumsets in general abelian group