English

Growth of regular partitions 4: strong regularity and the pairs partition

Combinatorics 2025-08-05 v3 Logic

Abstract

This paper studies bounds in a strong form of regularity for 33-uniform hypergraphs which was developed by Frankl, Gowers, Kohayakawa, Nagle, R\"{o}dl, Skokan, and Schacht. Regular decompositions of this type involve two structural components: a partition on the vertex set and a partition on the pairs of vertices. The regularity of such decompositions are measured by two parameters: an ϵ1>0\epsilon_1>0 and a function ϵ2:N(0,1]\epsilon_2:\mathbb{N}\rightarrow (0,1]. To each hereditary property H\mathcal{H} of 33-uniform hypergraphs, we associate two corresponding growth functions: TH(ϵ1,ϵ2)T_{\mathcal{H}}(\epsilon_1,\epsilon_2) for the size of the vertex component, and LH(ϵ1,ϵ2)L_{\mathcal{H}}(\epsilon_1,\epsilon_2) for the size of the pairs component. The problem of understanding the asymptotic growth of such functions was introduced in a companion paper, which also proved several results about THT_{\mathcal{H}}. In this paper we study the possible asymptotic behavior of LHL_{\mathcal{H}}. We show any such function is either constant, bounded above and below by a polynomial, or bounded below by an exponential. All results require only reasonable growth rates for ϵ2\epsilon_2 (namely polynomial).

Keywords

Cite

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

Comments

Updated to make explicit the fact that all proofs require only a polynomial growth rate for the function measuring the regularity of the pairs partition. Substantial details added to the upper bounds section and corrections of some errors. Contains overlap in preliminaries and background with its companion paper arXiv: 2404.02024