A new palette framework reduces (k-2)-uniform Turán densities of k-graphs to palette-homomorphism problems and yields exact values including (r-1)/r, (r-1)^2/r^2, and (k-1)^k/k^k for various k and r.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
math.CO 3representative citing papers
Finite palette avoidance for self-converse tournaments reduces exactly to a one-sided degree-square Turán problem, and for the directed triangle this gives sharp endpoints whose 3-graph uniform Turán densities accumulate at 1/3.
The paper shows π₁(S_k) equals (k²-5k+7)/(k-1)² for k≥9 by improving the optimality range of the palette construction.
citing papers explorer
-
Uniform Tur\'an densities of $k$-uniform hypergraphs
A new palette framework reduces (k-2)-uniform Turán densities of k-graphs to palette-homomorphism problems and yields exact values including (r-1)/r, (r-1)^2/r^2, and (k-1)^k/k^k for various k and r.
-
Finite palette endpoints and degree-square Tur\'an problems
Finite palette avoidance for self-converse tournaments reduces exactly to a one-sided degree-square Turán problem, and for the directed triangle this gives sharp endpoints whose 3-graph uniform Turán densities accumulate at 1/3.
-
Tur\'an density of stars in uniformly dense hypergraphs
The paper shows π₁(S_k) equals (k²-5k+7)/(k-1)² for k≥9 by improving the optimality range of the palette construction.