Metraipolis › archive › dc_17aa1fd24655

Upper Bounds on the Turán Density of Hypergraphs Associated with the Projective Plane over a Finite Field — arXiv:2610.01084

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.01084
License (as archived)
CC0-1.0
Archived
2026-10-06T17:40:58.621Z
SHA-256 of the archived text
db2e30cf85ebdea075ce2fb08aa0d072e5eaf3d265d4a609f1f9715bead9e7cd
Stable URL of this page
https://metraipolis.com/documento/dc_17aa1fd24655

How to cite

Upper Bounds on the Turán Density of Hypergraphs Associated with the Projective Plane over a Finite Field — arXiv:2610.01084 — arXiv (en), https://arxiv.org/abs/2610.01084 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_17aa1fd24655 (Metraipolis archive dc_17aa1fd24655, sha256 db2e30cf85ebdea075ce2fb08aa0d072e5eaf3d265d4a609f1f9715bead9e7cd)
BibTeX
@misc{dc17aa1fd24655,
  title = {Upper Bounds on the Turán Density of Hypergraphs Associated with the Projective Plane over a Finite Field — arXiv:2610.01084},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.01084},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_17aa1fd24655; sha256 db2e30cf85ebdea075ce2fb08aa0d072e5eaf3d265d4a609f1f9715bead9e7cd},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01084. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $\PG(2,q)$ denote the projective plane over the finite field $\mathbb{F}_q$ where $q\geq2$ is a prime power. For a positive integer $t$, let $B_{t}[\PG(2,q)]$ denote the $t$-page book obtained from $t-$many copies of the $(q+1)-$graph $\PG(2,q)$, sharing a common edge. Employing the $\mathsf{L}^p-$method and using the incidence structure of the projective plane, we establish that the upper bound of Turán density of $B_{t}[\PG(2,q)]$ is $(q(q+1)^{-1})^{\frac{1}{qt}}$. For the $(q+1)-$graph $\PG(2,q)$, the previously known upper bound on its Turán density was $1-\binom{q^2}{q}^{-1}$. As a consequence of our estimate, this upper bound is improved to $(q(q+1)^{-1})^{\frac{1}{q}}$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.01084 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T16:06:55.836Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).