An asymptotic formula for counting subset sums over subgroups of finite fields

Let F q be the finite field of q elements. Let H ⊆ F q ⁎ be a multiplicative subgroup. For a positive integer k and element b ∈ F q , we give a sharp estimate for the number of k-element subsets of H which sum to b.

Saved in:
Bibliographic Details
Published in:Finite fields and their applications 2012, Vol.18 (1), p.192-209
Main Authors: Zhu, Guizhen, Wan, Daqing
Format: Article
Language:English
Subjects:
Character sum
Distinct coordinate sieve
Finite fields
Inclusive–exclusive principle
Subset sum problem
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Let F q be the finite field of q elements. Let H ⊆ F q ⁎ be a multiplicative subgroup. For a positive integer k and element b ∈ F q , we give a sharp estimate for the number of k-element subsets of H which sum to b.
ISSN:1071-5797
1090-2465
DOI:10.1016/j.ffa.2011.07.010