Growth of regular partitions 3: strong regularity and the vertex partition
Abstract
We consider here the strong regularity for -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 , and a function . We define two growth functions associated to a hereditary property of -uniform hypergraphs: which measures the size of the vertex component, and 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 and ? In this paper, we consider this question for , 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 . The jump to the wowzer range uses a very fast growing 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