|国家预印本平台
首页|The asymptotic uniform distribution of subset sums

The asymptotic uniform distribution of subset sums

The asymptotic uniform distribution of subset sums

来源:Arxiv_logoArxiv
英文摘要

Let $G$ be a finite abelian group of order $n$, and for each $a\in G$ and integer $1\le h\le n$ let $\mathcal{F}_a(h)$ denote the family of all $h$-element subsets of $G$ whose sum is $a$. A problem posed by Katona and Makar-Limanov is to determine whether the minimum and maximum sizes of the families $\mathcal{F}_a(h)$ (as $a$ ranges over $G$) become asymptotically equal as $n\rightarrow \infty$ when $h=\left\lfloor\frac{n}{2}\right\rfloor$. We affirmatively answer this question and in fact show that the same asymptotic equality holds for every $4\leq h\leq \left\lfloor\frac{n}{2}\right\rfloor+1$.

Jing Wang

数学

Jing Wang.The asymptotic uniform distribution of subset sums[EB/OL].(2025-05-18)[2025-06-24].https://arxiv.org/abs/2505.12319.点此复制

评论