2000 character limit reached
A new sieve for restricted multiset counting
Published 22 Sep 2019 in math.CO and math.NT | (1909.10898v3)
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 $\mathbb{Z}/n\mathbb{Z}$. .
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.