A new sieve for restricted multiset counting

DOI10.1016/J.DISC.2021.112487MaRDI QIDQ2032908zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 14 June 2021

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

restricted multiset countingsieve

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Abstract: The Li--Wan sieve is extended to multisets when the underlying set is symmetric. The main ingredient of the proof is the Mobius inversion formula on the poset of partitions of $1,2,dots,k$ ordered by refinement. As illustrative applications, we investigate the problems of partitions over finite fields and zero-sum multisets over the additive group $mathbbZ/nmathbbZ$. .

Recommendations

• A new sieve for distinct coordinate counting
• Two algorithms for the sieve method
• Counting compositions over finite abelian groups
• scientific article; zbMATH DE number 962458
• Multiplicative functions and Brun's sieve

Cites work

• A bijection between necklaces and multisets with divisible subset sum
• A course in combinatorics.
• A new sieve for distinct coordinate counting
• An asymptotic formula for counting subset sums over subgroups of finite fields
• Complexity of Decoding Positive-Rate Primitive Reed–Solomon Codes
• Distance Distribution in Reed-Solomon Codes
• Enumeration of power sums modulo a prime
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• On a conjecture of polynomials with prescribed range
• On Deciding Deep Holes of Reed-Solomon Codes
• On error distance of Reed-Solomon codes
• On the average sensitivity of the weighted sum function
• On the Borwein conjecture
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• On the List and Bounded Distance Decodability of Reed–Solomon Codes
• On the Odlyzko-Stanley enumeration problem and Waring's problem over finite fields
• On the subset sum problem over finite fields
• Partitions and compositions over finite fields
• Permutations, hyperplanes and polynomials over finite fields
• The subset sum problem for finite abelian groups

Cited in

(5)

• Untangling upper-bound sieves
• Finding and Counting MSTD Sets
• Two algorithms for the sieve method
• A new sieve for distinct coordinate counting
• A bijection between necklaces and restricted multisets

This page was built for publication: A new sieve for restricted multiset counting

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