arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.09601math.CO
收藏

多种覆盖和填充情形下的阈值级数

Threshold Progressions in a Variety of Covering and Packing Contexts

Anant Godbole, Thomas Grubb, Kyutae Han, Bill Kay

摘要:

使用标准方法(由于Janson,Stein-Chen和Talagrand)从概率组合学,我们探索以下一般主题:随着从对象族${\cal A}$的每个成员被随机集合${\cal C}$中的至多一个对象“覆盖”到被覆盖至多$λ$次、被覆盖至少一次、被覆盖至少$λ$次的进展,出现了一系列的阈值。然后,我们将看到这些结果如何根据上下文和引入的依赖程度而变化。例子将从极值集合论,组合学,和加性数论。

英文摘要:

Using standard methods (due to Janson, Stein-Chen, and Talagrand) from probabilistic combinatorics, we explore the following general theme: As one progresses from each member of a family of objects ${\cal A}$ being "covered" by at most one object in a random collection ${\cal C}$, to being covered at most $λ$ times, to being covered at least once, to being covered at least $λ$ times, a hierarchy of thresholds emerge. We will then see how such results vary according to the context, and level of dependence introduced. Examples will be from extremal set theory, combinatorics, and additive number theory.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑