pith. sign in

arxiv: 2606.08709 · v1 · pith:ZNPUAFSQnew · submitted 2026-06-07 · 🧮 math.CO

Large point-degrees in intersecting families of finite vector spaces

Jicheng Ma , Hao Li This is my paper

Pith reviewed 2026-06-27 17:49 UTC · model grok-4.3

classification 🧮 math.CO
keywords intersecting familiesfinite vector spacespoint-degreesq-binomial coefficientssubspace familiesextremal combinatoricsfinite fields
0
0 comments X

The pith

Every intersecting family of k-dimensional subspaces in an n-dimensional space over a finite field with n at least 2k+1 has its points(k) squared-th largest point-degree at most the q-binomial coefficient of n-2 choose k-2.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that for intersecting families of k-subspaces in n-space over F_q with n >= 2k+1, the ordered point-degrees satisfy a specific upper bound once the index reaches the square of the number of points in a k-dimensional subspace. This extends a known result from ordinary sets to the geometric setting of vector spaces, where the multiplicative nature of points changes how many high-degree points can appear before the bound stabilizes. A reader cares because the work shows precisely where the q-analog of the degree bound begins to hold and why a direct translation of the set-system threshold does not work. The paper also supplies a corrected starting index under extra conditions on n, q, and k, along with necessary conditions that any counterexample to a conjectured sharper bound must obey.

Core claim

Every intersecting family Fsubseteq Gr(V,k) with n>=2k+1 satisfies d_{points(k)^2}(F) <= qbinom(n-2,k-2). The naive q-analog of the (k+2)-th degree theorem fails because a vector-space Hilton-Milner construction has points(k+1) points of degree larger than qbinom(n-2,k-2); a corrected bound d_{1+points(k+1)}(F) <= qbinom(n-2,k-2) holds for fixed q, sufficiently large k, and n>3k. For larger indices i, a saturated construction identifies the conjectural sharp bound on d_{points(i+1)}(F), and any strict counterexample must satisfy two necessary conditions.

What carries the argument

The decreasing sequence of point-degrees d_1(F) >= d_2(F) >= ... of an intersecting family, with the bound d_i(F) <= qbinom(n-2,k-2) taking effect at i equal to the square of the number of points in a k-dimensional subspace.

If this is right

  • The inequality d_{points(k)^2}(F) <= qbinom(n-2,k-2) holds for every such intersecting family.
  • The direct translation of the set-system bound to index k+2 fails in the vector-space case.
  • A stronger bound holds on the (1 + points(k+1))-th degree when n > 3k, q is fixed, and k is large.
  • Any family violating the conjectural bound at larger indices must meet the two necessary conditions stated in the paper.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The multiplicative scaling of points inside subspaces forces the uniform bound to begin later than in the additive setting of sets.
  • Comparable shifts in the effective index may appear when other extremal results are carried over to q-analogs.
  • Direct computational checks of the necessary conditions for small q and k could indicate whether the conjectural bound holds.
  • The result points toward studying how the count of high-degree points grows with dimension in related intersecting problems over finite fields.

Load-bearing premise

The assumption that a structural result on the possible forms of intersecting families continues to apply when the dimension n exceeds 3k and k is large enough.

What would settle it

An explicit intersecting family in which the points(k)^2-th point-degree exceeds the q-binomial coefficient qbinom(n-2,k-2) would disprove the main bound.

read the original abstract

Let \(V\) be an \(n\)-dimensional vector space over the finite field \(\Fq\), and let \(\Gr{V}{k}\) denote the family of all \(k\)-dimensional subspaces of \(V\). A family \(\cF\subseteq\Gr{V}{k}\) is called intersecting if \(\dim(F\cap F')\ge1\) for all \(F,F'\in\cF\). For a point \(P\le V\), let \(d_P(\cF)\) denote the number of members of \(\cF\) that contain \(P\), and order the point-degrees as \(d_1(\cF)\ge d_2(\cF)\ge\cdots\ge d_{\points{n}}(\cF)\), where \(\points{m}=(q^m-1)/(q-1)\) is the number of points in an \(m\)-dimensional subspace. Recent work of Frankl and Wang~\cite{FW2025} and of Huang and Rao~\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)\). We prove that 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, as a vector-space Hilton--Milner construction has \(\points{k+1}\) points of degree larger than \(\qbinom{n-2}{k-2}\); we prove the corrected bound \(d_{1+\points{k+1}}(\cF)\le\qbinom{n-2}{k-2}\) for fixed \(q\), sufficiently large \(k\), and \(n>3k\), using a structural theorem of Ihringer and Kupavskii~\cite{IK2026}. For larger degree indices \(i\), a saturated Frankl--Hilton--Milner family of Ihringer and Kupavskii identifies the conjectural sharp bound on \(d_{\points{i+1}}(\cF)\), and we prove two necessary conditions that any strict counterexample to this conjecture must satisfy.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper proves that every intersecting family F ⊆ Gr(V,k) with n ≥ 2k+1 satisfies d_{points(k)^2}(F) ≤ qbinom(n-2,k-2), where points(m) = (q^m-1)/(q-1). This is presented as the correct q-analog of the Huang-Rao/Frankl-Wang order-statistic bound, after showing that the naive analog fails due to vector-space Hilton-Milner examples having points(k+1) large degrees. Conditional sharper bounds d_{1+points(k+1)}(F) ≤ qbinom(n-2,k-2) are proved for fixed q, large k and n>3k via the Ihringer-Kupavskii structural theorem, and two necessary conditions are given for any strict counterexample to a conjectural bound on d_{points(i+1)}(F) for larger i.

Significance. If the results hold, the work supplies the appropriate adjustment to the index in the q-setting to absorb extra point-degree mass from geometric constructions, thereby extending the recent combinatorial order-statistic theorems to finite vector spaces. The separation of the unconditional bound (for the points(k)^2 index) from the conditional results that invoke the structural theorem is a clear strength, as is the explicit identification of necessary conditions for the conjecture on saturated Frankl-Hilton-Milner families.

minor comments (2)
  1. The abstract and introduction should explicitly state the precise range of parameters (q, k, n) under which the unconditional bound holds without any appeal to IK2026, to avoid any reader confusion with the conditional regime n>3k.
  2. Notation for the ordered degrees d_1(F) ≥ … ≥ d_{points(n)}(F) is introduced clearly, but the manuscript should include a short remark confirming that points(k)^2 is always an integer between 1 and points(n) under the standing hypothesis n ≥ 2k+1.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and accurate summary of our results, the recognition of their significance in extending order-statistic theorems to the q-analog setting, and the recommendation for minor revision. No specific major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained

full rationale

The central unconditional bound d_{points(k)^2}(F) ≤ qbinom(n-2,k-2) for n ≥ 2k+1 is framed as a direct q-analog of the external Huang-Rao/Frankl-Wang results on set systems, with the index points(k)^2 chosen explicitly to handle vector-space Hilton-Milner examples. Conditional sharpenings for larger indices invoke the independent structural theorem of Ihringer-Kupavskii (IK2026) under stated assumptions (n>3k, fixed q, large k), without reducing the main claim to any fitted parameter, self-definition, or self-citation chain. No equations or steps in the provided abstract collapse the claimed inequality to its inputs by construction, and all cited results are from non-overlapping authors.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work relies on standard linear algebra over finite fields and the definition of intersecting families; no new free parameters, ad-hoc axioms, or invented entities are introduced in the abstract.

axioms (2)
  • standard math Basic properties of finite-dimensional vector spaces and their subspaces over F_q hold, including the count of points in an m-dimensional subspace as (q^m-1)/(q-1).
    Invoked throughout the definitions of Gr(V,k) and point-degrees.
  • domain assumption A family is intersecting precisely when every pair of k-subspaces has intersection dimension at least 1.
    Central definition used to state all results.

pith-pipeline@v0.9.1-grok · 5990 in / 1466 out tokens · 21801 ms · 2026-06-27T17:49:48.514422+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

16 extracted references · 2 linked inside Pith

  1. [1]

    Khachatrian

    Rudolf Ahlswede and Levon H. Khachatrian. The complete intersection theorem for systems of finite sets.European J. Combin., 18(2):125–136, 1997. 21

    1997

  2. [2]

    Brouwer, Ameera Chowdhury, P´ eter Frankl, Tibor Mussche, Bal´ azs Patk´ os, and Tam´ as Sz˝ onyi

    Aart Blokhuis, Andries E. Brouwer, Ameera Chowdhury, P´ eter Frankl, Tibor Mussche, Bal´ azs Patk´ os, and Tam´ as Sz˝ onyi. A Hilton-Milner theorem for vector spaces.Electronic Journal of Combinatorics, 17(1):Research Paper R71, 2010

    2010

  3. [3]

    Erd˝ os, C

    P. Erd˝ os, C. Ko, and R. Rado. Intersection Theorems for Systems of Finite Sets.Quart. J. Math., 12(1):313–320, 1961

    1961

  4. [4]

    Erd˝ os-Ko-Rado theorem with conditions on the maximal degree.J

    P´ eter Frankl. Erd˝ os-Ko-Rado theorem with conditions on the maximal degree.J. Combin. Theory Ser. A, 46(2):252–263, 1987

    1987

  5. [5]

    The shifting technique in extremal set theory

    P´ eter Frankl. The shifting technique in extremal set theory. In C. Whitehead, editor, Surveys in Combinatorics 1987, volume 123 ofLondon Math. Soc. Lecture Note Ser., pages 81–110. Cambridge Univ. Press, Cambridge, 1987

    1987

  6. [6]

    American Mathematical Society, Providence, RI, 2018

    P´ eter Frankl and Norihide Tokushige.Extremal Problems for Finite Sets, volume 86 of Student Mathematical Library. American Mathematical Society, Providence, RI, 2018

    2018

  7. [7]

    On the largest degrees in intersecting hypergraphs.arXiv preprint arXiv:2511.15508, 2025

    P´ eter Frankl and Jian Wang. On the largest degrees in intersecting hypergraphs.arXiv preprint arXiv:2511.15508, 2025

    arXiv 2025

  8. [8]

    P´ eter Frankl and Richard M. Wilson. The Erd˝ os-Ko-Rado theorem for vector spaces.J. Combin. Theory Ser. A, 43(2):228–236, 1986

    1986

  9. [9]

    A. J. W. Hilton and E. C. Milner. Some intersection theorems for systems of finite sets. Quarterly Journal of Mathematics, 18(1):369–384, 1967

    1967

  10. [10]

    Intersection theorems for systems of finite vector spaces.Discrete Math., 12:1–16, 1975

    Wen Ning Hsieh. Intersection theorems for systems of finite vector spaces.Discrete Math., 12:1–16, 1975

    1975

  11. [11]

    On theℓ-th largest degree of an intersecting family.arXiv preprint arXiv:2602.01692v3, 2026

    Hao Huang and Rui Rao. On theℓ-th largest degree of an intersecting family.arXiv preprint arXiv:2602.01692v3, 2026

    Pith/arXiv arXiv 2026

  12. [12]

    Degree versions of the Erd˝ os-Ko-Rado theorem and Erd˝ os hyper- graph matching conjecture.J

    Hao Huang and Yi Zhao. Degree versions of the Erd˝ os-Ko-Rado theorem and Erd˝ os hyper- graph matching conjecture.J. Combin. Theory Ser. A, 150:233–247, 2017

    2017

  13. [13]

    Structure oft-Intersecting families of vector spaces.arXiv preprint arXiv:2605.02698, 2026

    Ferdinand Ihringer and Andrey Kupavskii. Structure oft-Intersecting families of vector spaces.arXiv preprint arXiv:2605.02698, 2026

    Pith/arXiv arXiv 2026

  14. [14]

    Diversity of uniform intersecting families.European J

    Andrey Kupavskii. Diversity of uniform intersecting families.European J. Combin., 74:39– 47, 2018

    2018

  15. [15]

    Acta Mathematica Hungarica, 176:215–235, 2025

    Yunjing Shan and Junling Zhou.d-degree Erd˝ os-Ko-Rado theorem for finite vector spaces. Acta Mathematica Hungarica, 176:215–235, 2025

    2025

  16. [16]

    A Kruskal–Katona-type theorem for graphs:q- Kneser graphs.Journal of Combinatorial Theory, Series A, 198:105766, 2023

    Jun Wang, Ao Xu, and Huajun Zhang. A Kruskal–Katona-type theorem for graphs:q- Kneser graphs.Journal of Combinatorial Theory, Series A, 198:105766, 2023. 22

    2023