Overview
This research investigates large point-degrees within intersecting families of finite vector spaces. Specifically, it establishes bounds for these point-degrees, building upon previous work concerning uniform intersecting families. The study addresses the inadequacy of a direct q-analog translation from set systems and proposes a corrected bound under certain parameters.
Research Context
The study operates within the mathematical domain of finite vector spaces. Let $V$ be an $n$-dimensional vector space over the finite field $\Fq$. The family $\Gr{V}{k}$ represents all $k$-dimensional subspaces of $V$. A family $\cF\subseteq\Gr{V}{k}$ is defined as intersecting if, for any two members $F,F'\in\cF$, their intersection dimension satisfies $\dim(F\cap F')\ge1$.
For a point $P\le V$, $d_P(\cF)$ denotes the number of members of $\cF$ that contain $P$. These point-degrees are ordered as $d_1(\cF)\ge d_2(\cF)\ge\cdots\ge d_{\points{n}}(\cF)$, where $\points{m}=(q^m-1)/(q-1)$ signifies the number of points in an $m$-dimensional subspace.
Prior work by Frankl and Wang (referenced as \cite{FW2025}) and Huang and Rao (referenced as \cite{HR2026}) established that for $k$-uniform intersecting families $\cF\subseteq\binom{[n]}{k}$ with $n\ge2k+1$, the bound $\binom{n-2}{k-2}$ governs the order statistic $d_{2k+1}(\cF)$. This provided a precedent for investigating similar bounds in the context of finite vector spaces.
Approach
The research first examines a direct q-analog of existing results. It identifies that the naive $q$-analog of the Huang–Rao $(k+2)$-th degree theorem does not hold. This is demonstrated by a vector-space Hilton–Milner construction, which exhibits $\points{k+1}$ points with degrees exceeding $\qbinom{n-2}{k-2}$.
To address this, the study shifted towards proving a corrected bound. This involved specific conditions for the parameters $q$, $k$, and $n$. The proof of the corrected bound is stated to rely on a structural theorem developed by Ihringer and Kupavskii (referenced as \cite{IK2026}).
For larger degree indices $i$, the research indicates that a saturated Frankl–Hilton–Milner family, also identified by Ihringer and Kupavskii, suggests the conjectural sharp bound on $d_{\points{i+1}}(\cF)$. The study then proceeds to identify two necessary conditions that must be met by any strict counterexample to this conjecture.
Findings
- Every intersecting family $\cF\subseteq\Gr{V}{k}$ with $n\ge2k+1$ satisfies $d_{\points{k}^{2}}(\cF)\le\qbinom{n-2}{k-2}$.
- The naive $q$-analog of the Huang–Rao $(k+2)$-th degree theorem fails. This is supported by a vector-space Hilton–Milner construction which yields $\points{k+1}$ points with degrees greater than $\qbinom{n-2}{k-2}$.
- The corrected bound $d_{1+\points{k+1}}(\cF)\le\qbinom{n-2}{k-2}$ holds for fixed $q$, sufficiently large $k$, and $n\ge3k$. This bound is derived using a structural theorem by Ihringer and Kupavskii.
- For larger degree indices $i$, a saturated Frankl–Hilton–Milner family, as identified by Ihringer and Kupavskii, points to the conjectural sharp bound for $d_{\points{i+1}}(\cF)$.
- Any strict counterexample to this conjectural sharp bound must satisfy two specific necessary conditions.