arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.01293math.COmath.LO
收藏

正则划分的增长 2:弱正则性

Growth of regular partitions 2: Weak regularity

University of Illinois at Chicago(芝加哥伊利诺伊大学)

C. Terry

AI总结:

本文研究了3-正则超图的正则划分增长,定义了弱超图正则性,并证明了该函数的增长率分为四个类别。

摘要:

本系列论文第二部分研究了3-正则超图的正则划分增长。本文引入了弱超图正则性概念,定义了函数M_H(ε)表示满足弱正则划分的最小整数M。证明了该函数的增长率属于常数、多项式、单指数与双指数之间或塔状增长四种情况之一,结果为后续研究奠定了基础。

英文摘要:

This is Part 2 in a series of papers about the growth of regular partitions in hereditary properties $3$-uniform hypergraphs. The focus of this paper is the notion of weak hypergraph regularity, first developed by Chung, Chung-Graham, and Haviland-Thomason. Given a hereditary property of $3$-uniform hypergraphs $\mathcal{H}$, we define a function $M_{\mathcal{H}}:(0,1)\rightarrow \mathbb{N}$ by letting $M_{\mathcal{H}}(ε)$ be the smallest integer $M$ such that all sufficiently large elements of $\mathcal{H}$ admit weak regular partitions of size at most $M$. We show the asymptotic growth rate of such a function falls into one of four categories: constant, polynomial, between single and double exponentials, or tower. These results are a crucial component in Part 3 of the series, which considers vertex partitions associated to a stronger notion of hypergraph regularity.

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

↑