Counting subset sums of finite Abelian groups

DOI10.1016/j.jcta.2011.07.003zbMath1229.05289arXiv1507.06329OpenAlexW2042824544MaRDI QIDQ645970

Daqing Wan, Jiyou Li

Publication date: 11 November 2011

Published in: Journal of Combinatorial Theory. Series A, The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.06329

zbMATH Keywords

character sumsfinite Abelian groupssubset sumssievecounting problemsinclusion-exclusionsubset sum problemRamanujan's trigonometric sumpolynomial subset sums

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Finite abelian groups (20K01) Polynomials over finite fields (11T06) Other character sums and Gauss sums (11T24) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Asymptotic enumeration (05A16) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (23)

Permutations of zero-sumsets in a finite vector space ⋮ INVERSE PROBLEMS OF SUBSET SUMS OF ZERO-SUM FREE SET WITH SIX ELEMENTS IN FINITE ABELIAN GROUPS ⋮ Subset sums of quadratic residues over finite fields ⋮ Algebraic geometric secret sharing schemes over large fields are asymptotically threshold ⋮ Counting polynomials over finite fields with prescribed leading coefficients and linear factors ⋮ Subset sums and block designs in a finite vector space ⋮ On the average sensitivity of the weighted sum function ⋮ On the Borwein conjecture ⋮ Subset sums over Galois rings. II ⋮ Counting subset sums of finite Abelian groups ⋮ On the Odlyzko-Stanley enumeration problem and Waring's problem over finite fields ⋮ On the subset sum problem for finite fields ⋮ The \(k\)-subset sum problem over finite fields ⋮ Counting compositions over finite abelian groups ⋮ A new sieve for restricted multiset counting ⋮ Binary Hamming codes and Boolean designs ⋮ The simplified weighted sum function and its average sensitivity ⋮ Distinct coordinate solutions of linear equations over finite fields ⋮ Moment subset sums over finite fields ⋮ Subset sums over Galois rings ⋮ A Reciprocity on Finite Abelian Groups Involving Zero-Sum Sequences ⋮ The \(k\)-subset sum problem over finite fields of characteristic 2 ⋮ Extensions of Schönemann's theorem in Galois rings

Cites Work

• A new sieve for distinct coordinate counting
• Counting subset sums of finite Abelian groups
• An asymptotic formula for counting subset sums over subgroups of finite fields
• Linear congruences and the von Sterneck function
• On the subset sum problem over finite fields
• Enumeration of power sums modulo a prime
• Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order.
• On a conjecture of Peter Borwein
• The subset sum problem for finite abelian groups
• On the Odlyzko-Stanley enumeration problem and Waring's problem over finite fields
• On upper bounds of Chalk and Hua for exponential sums
• Exponential sums modulo prime powers
• Computing Error Distance of Reed-Solomon Codes
• Counting Value Sets: Algorithm and Complexity
• Stopping Sets of Algebraic Geometry Codes
• Sum-Product Theorems and Applications
• Hard Problems of Algebraic Geometry Codes
• An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
• Generators and irreducible polynomials over finite fields
• New bounds for Gauss sums derived from KTH powers, and for Heilbronn's exponential sum
• On Deciding Deep Holes of Reed-Solomon Codes
• ESTIMATES FOR THE NUMBER OF SUMS AND PRODUCTS AND FOR EXPONENTIAL SUMS IN FIELDS OF PRIME ORDER
• On the addition of residue classes mod p
• Estimate of a complete rational trigonometric sum
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Counting subset sums of finite Abelian groups