Scientific article

Sumsets in dihedral groups

Published inEuropean journal of combinatorics, vol. 27, no. 4, p. 617-628
Publication date2006

Let Dn be the dihedral group of order 2n. For all integers r, s such that 1 ≤ r, s ≤ 2n, we give an explicit upper bound for the minimal size μDn (r, s) = min |A · B| of sumsets (product sets) A · B, where A and B range over all subsets of Dn of cardinality r and s respectively. It is shown by construction that μDn (r, s) is bounded above by the known value of μG(r, s), where G is any abelian group of order 2n. We conjecture that this upper bound is sharp, and prove that it really is if n is a prime power.

Citation (ISO format)
ELIAHOU, Shalom, KERVAIRE, Michel. Sumsets in dihedral groups. In: European journal of combinatorics, 2006, vol. 27, n° 4, p. 617–628. doi: 10.1016/j.ejc.2003.09.023
Main files (1)
Article (Published version)
ISSN of the journal0195-6698

Technical informations

Creation10/13/2010 3:03:00 PM
First validation10/13/2010 3:03:00 PM
Update time03/14/2023 4:07:31 PM
Status update03/14/2023 4:07:31 PM
Last indexation01/15/2024 9:42:39 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack