Counting subset sums of finite Abelian groups (Q645970)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 6968574

Counting polynomial subset sums

In more languages

Language	Label	Description	Also known as
English	Counting subset sums of finite Abelian groups	scientific article; zbMATH DE number 6968574	Counting polynomial subset sums

Statements

scholarly article

Counting subset sums of finite Abelian groups (English)

Counting polynomial subset sums (English)

Journal of Combinatorial Theory. Series A

The Ramanujan Journal

publication date

11 November 2011

30 October 2018

full work available at URL

https://arxiv.org/abs/1507.06329

zbMATH Keywords

subset sums

sieve

finite Abelian groups

Ramanujan's trigonometric sum

polynomial subset sums

inclusion-exclusion

character sums

subset sum problem

counting problems

MaRDI profile type

MaRDI publication profile

Hard Problems of Algebraic Geometry Codes

On Deciding Deep Holes of Reed-Solomon Codes

On the subset sum problem over finite fields

A new sieve for distinct coordinate counting

Linear congruences and the von Sterneck function

Enumeration of power sums modulo a prime

On a conjecture of Peter Borwein

Sum-Product Theorems and Applications

Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order.

ESTIMATES FOR THE NUMBER OF SUMS AND PRODUCTS AND FOR EXPONENTIAL SUMS IN FIELDS OF PRIME ORDER

Counting Value Sets: Algorithm and Complexity

On upper bounds of Chalk and Hua for exponential sums

Exponential sums modulo prime powers

On the addition of residue classes mod p

An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem

New bounds for Gauss sums derived from KTH powers, and for Heilbronn's exponential sum

The subset sum problem for finite abelian groups

On the Odlyzko-Stanley enumeration problem and Waring's problem over finite fields

Counting subset sums of finite Abelian groups

Estimate of a complete rational trigonometric sum

Generators and irreducible polynomials over finite fields

Stopping Sets of Algebraic Geometry Codes

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

Computing Error Distance of Reed-Solomon Codes

Identifiers

zbMATH Open document ID

10.1016/j.jcta.2011.07.003

10.1007/s11139-018-0020-0

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:645970

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q645970&oldid=37881093"