Tree suspensions and transfer functions for single degree Turán spectra
arXiv:2607.06518
Abstract
For integers , let denote the single-forbidden -degree Turán spectrum of -uniform hypergraphs. We introduce transfer functions for this spectrum: explicit functions such that, for every , there is another single -graph with . This gives a mechanism for producing new single-forbidden densities while retaining full control of the resulting value. Our transfer functions are realized by a new family of suspension-type operations, called tree suspensions. From these operations we obtain three explicit maps: one acting on for every , a second acting when , and a third acting in the ordinary Turán case . The common feature is a robust tree structure which gives the lower bound by a two-part construction and, in the regimes above, admits a matching embedding or Lagrangian upper bound. As a first application, the universal transfer function propagates accumulation points. Using the recent zero-accumulation results for together with the ordinary Turán accumulation result of Conlon and Schülke, we prove that has infinitely many accumulation points for every and every . This recovers, in particular, the known infinitude of accumulation points in the ordinary and codegree spectra. As a second application, combining two independent transfer functions forces algebraic degrees to grow. For every and every , the spectrum contains algebraic numbers of arbitrarily large degree over . Thus the arithmetic complexity previously known for finite forbidden families already occurs in the single-forbidden spectrum, both for ordinary Turán density and for a broad range of degree Turán densities.