paper

Erdős--Ko--Rado theorems in -norm for three finite spaces

arXiv:2607.23663

Abstract

Let be a -uniform hypergraph. The famous Erdős--Ko--Rado (1961) theorem determines the maximum size and extremal structure for being -intersecting, that is, for any two edges of . The codegree squared sum is the square of the -norm of the codegree vector of all -sets in , which was initially introduced for Turán problems of hypergraphs. Recently, Brooks and Linz (2026), as well as Wu and Zhang (2026) investigated the maximum value of and corresponding extremal structures for being -intersecting. Moreover, Brooks and Linz asked if the classical results on intersecting families can be extended to . In this paper, by developing the spectral techniques for incidence matrices, we study the extremal problems of for being intersecting families in finite vector spaces, affine spaces, and attenuated spaces, and establish the Erdős--Ko--Rado theorems in -norm for the three finite spaces.