Non-jumping Tur\'an densities of hypergraphs
Zilong Yan, Yuejian Peng

TL;DR
This paper investigates the structure of Turán densities in hypergraphs, identifying new non-jump values smaller than previously known and demonstrating the existence of infinitely many irrational non-jumps for all ranks.
Contribution
It introduces a smaller non-jump value for hypergraph Turán densities and proves the existence of infinitely many irrational non-jumps for all r ≥ 3.
Findings
${54r!\over 25r^r}$ is a new, smaller non-jump for r ≥ 3
Established the existence of infinitely many irrational non-jumps for every r ≥ 3
Extended understanding of the distribution of Turán densities in hypergraphs
Abstract
A real number is a jump for an integer if there exists such that no number in can be the Tur\'an density of a family of -uniform graphs. A classical result of Erd\H os and Stone \cite{ES} implies that that every number in is a jump for . Erd\H os \cite{E64} also showed that every number in is a jump for and asked whether every number in is a jump for . Frankl and R\"odl \cite{FR84} gave a negative answer by showing a sequence of non-jumps for every . After this, Erd\H os modified the question to be whether is a jump for ? What's the smallest non-jump? Frankl, Peng, R\"odl and Talbot \cite{FPRT} showed that is a non-jump for . Baber and Talbot \cite{BT0} showed that every $\alpha\in[0.2299, 0.2316)\cup [0.2871,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Advanced Graph Theory Research
