Tree suspensions and transfer functions for single degree Turán spectra

Abstract

For integers 1 <k, let Πk denote the single-forbidden -degree Turán spectrum of k-uniform hypergraphs. We introduce transfer functions for this spectrum: explicit functions f such that, for every F, there is another single k-graph F* with π(F*)=f(π(F)). 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 Πk for every 1<k, a second acting when k/2, and a third acting in the ordinary Turán case =1. 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 2 together with the ordinary Turán accumulation result of Conlon and Schülke, we prove that Πk has infinitely many accumulation points for every k3 and every 1<k. 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 k3 and every ∈\1, k/2,…,k-2\, the spectrum Πk contains algebraic numbers of arbitrarily large degree over Q. 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…