English

Growth of regular partitions 3: strong regularity and the vertex partition

Combinatorics 2025-08-05 v3 Logic

Abstract

We consider here the strong regularity for 33-uniform hypergraphs developed by Frankl, Gowers, Kohayakawa, Nagle, R\"{o}dl, Skokan, and Schacht. This type of regular decomposition comes with two components, a partition of the vertices, and a partition of the pairs of vertices. The data of a regular decomposition also includes two parameters measuring quasirandomness, a fixed constant ϵ1>0\epsilon_1>0, and a function ϵ2:N(0,1]\epsilon_2:\mathbb{N}\rightarrow (0,1]. We define two growth functions associated to a hereditary property H\mathcal{H} of 33-uniform hypergraphs: TH(ϵ1,ϵ2)T_{\mathcal{H}}(\epsilon_1,\epsilon_2) which measures the size of the vertex component, and LH(ϵ,ϵ2)L_{\mathcal{H}}(\epsilon,\epsilon_2) which measures the size of the pairs component. We introduce the following question. What are the possible asymptotic growth rates of functions of the form THT_{\mathcal{H}} and LHL_{\mathcal{H}}? In this paper, we consider this question for THT_{\mathcal{H}}, proving a separation into four classes: constant, polynomial, exponential, or at least wowzer. The separations among the constant, polynomial and exponential ranges require only slow growing (namely polynomial) choices for ϵ2\epsilon_2. The jump to the wowzer range uses a very fast growing ϵ2\epsilon_2 and makes crucial use of a lower bound construction for strong graph regularity due to Conlon and Fox.

Keywords

Cite

@article{arxiv.2404.02024,
  title  = {Growth of regular partitions 3: strong regularity and the vertex partition},
  author = {C. Terry},
  journal= {arXiv preprint arXiv:2404.02024},
  year   = {2025}
}

Comments

Updated to make explicit which results require polynomial vs. super polynomial growth of the function determining the regularity of the pairs partition. Contains some overlap of preliminaries and background material with its companion paper arXiv:2404.02030