Flag Algebras and the Hypergraph Turán Density Problem for 3-Uniform Geometric Structures

Read full text
Authors: Zen Revista, 10 MFC
Cited by: 0

Abstract

The determination of the Turán density (F) for 3-uniform hypergraphs remains one of the most challenging frontiers in extremal combinatorics. This monograph explores the application of Razborov's Flag Algebra calculus to a specific class of forbidden substructures arising from finite geometric configurations, termed 3-uniform geometric structures. We focus on the Fano plane and the tetrahedron K4(3), investigating the asymptotic density of hypergraphs forbidding these geometries. By constructing a sequence of positive semidefinite matrices within the semantic cone of the associated flag algebra A3, we derive improved upper bounds for the Turán density of the generalized geometric configuration Gk. Furthermore, we analyze the stability of the extremal constructions, demonstrating that the unique maximizers are blow-ups of specific algebraic structures. Our results bridge the gap between computational extremal combinatorics and classical finite geometry, offering new insights into the "jump" phenomenon of hypergraph Turán densities.

Fields of Study & Subjects

Limits and Structures in Graph Theory Advanced Combinatorial Mathematics Analytic Number Theory Research

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
31 January 2026