A new sieve for distinct coordinate counting

DOI10.1007/S11425-010-3121-9MaRDI QIDQ625832zbMATH OpenOpenAlexFDO

Authors Jiyou Li, Daqing Wan

Publication date 25 February 2011

Published in Science China. Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11425-010-3121-9

zbMATH Keywords

sievedistinct coordinate counting

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other character sums and Gauss sums (11T24) Applications of sieve methods (11N36)

Recommendations

• A new sieve for restricted multiset counting
• Two algorithms for the sieve method
• Sieve methods in combinatorics
• Untangling upper-bound sieves
• scientific article; zbMATH DE number 3989351

Cites work

• A deterministic reduction for the gap minimum distance problem (extended abstract)
• Complexity of Decoding Positive-Rate Reed-Solomon Codes
• Diameters and Eigenvalues
• Factoring polynomials in finite fields: An application of Lang-Weil to a problem in graph theory
• Generators and irreducible polynomials over finite fields
• On Deciding Deep Holes of Reed-Solomon Codes
• On error distance of Reed-Solomon codes
• On the List and Bounded Distance Decodability of Reed–Solomon Codes
• On the subset sum problem over finite fields
• Polynomial factorisation and an application to regular directed graphs

Cited in

(21)

• The simplified weighted sum function and its average sensitivity
• The \(k\)-subset sum problem over finite fields of characteristic 2
• Distinct coordinate solutions of linear equations over finite fields
• Subset sums over Galois rings
• On the Borwein conjecture
• On the Odlyzko-Stanley enumeration problem and Waring's problem over finite fields
• Deep holes in Reed-Solomon codes based on Dickson polynomials
• The \(k\)-subset sum problem over finite fields
• On sums of coefficients of polynomials related to the Borwein conjectures
• A new sieve for restricted multiset counting
• Some formulae for coefficients in restricted \(q\)-products
• An approach to the moments subset sum problem through systems of diagonal equations over finite fields
• Subset sums of quadratic residues over finite fields
• Subset sums over Galois rings. II
• An asymptotic formula for counting subset sums over subgroups of finite fields
• On sums of coefficients of Borwein type polynomials over arithmetic progressions
• Asymptotic distributions of the number of zeros of random polynomials in Hayes equivalence class over a finite field
• Counting polynomials with distinct zeros in finite fields
• Extensions of Schönemann's theorem in Galois rings
• Moment subset sums over finite fields
• On the average sensitivity of the weighted sum function

This page was built for publication: A new sieve for distinct coordinate counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625832)