pith. sign in

arxiv: 2605.02698 · v1 · submitted 2026-05-04 · 🧮 math.CO

Structure of t-Intersecting Families of Vector Spaces

Ferdinand Ihringer , Andrey Kupavskii This is my paper

Pith reviewed 2026-05-08 18:24 UTC · model grok-4.3

classification 🧮 math.CO
keywords t-intersecting familiesvector spacesk-dimensional subspacesextremal combinatoricsHilton-Milner theoremdiversitycross-intersecting familiessubspace spreadness
0
0 comments X

The pith

Large t-intersecting families of k-dimensional subspaces admit a governing low-dimensional structure when the ambient dimension n is at least 2k+1.

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

The paper establishes that every sufficiently large t-intersecting family of k-dimensional subspaces in an n-dimensional vector space has its intersection behavior controlled by a low-dimensional subspace, provided n is at least 2k plus one. This structural result then serves as the basis for proving vector-space analogues of several classical theorems from extremal set theory. A sympathetic reader would care because the work shows how intersection conditions that are well-understood for sets carry over in a controlled way to linear spaces, allowing techniques to transfer between the two domains. The proofs introduce subspace spreadness to simplify families step by step until their structure becomes transparent.

Core claim

We show that all large t-intersecting families admit a governing low-dimensional structure for n ≥ 2k+1. This result, together with its cross-intersecting variant, allows us to prove analogues of several classical extremal set-theoretic results. In particular, we determine the intersecting families with the largest diversity, and we establish a Frankl-type degree-diversity result that generalizes the Hilton-Milner theorem. Our proofs rely on simplification procedures for t-intersecting and t-cross-intersecting families of subspaces based on the concept of subspace spreadness.

What carries the argument

simplification procedures for t-intersecting families that rely on the new notion of subspace spreadness, a generalization of classical spreadness from set systems, to reduce complex families to ones governed by a low-dimensional subspace.

If this is right

  • The maximum diversity among t-intersecting families of subspaces is achieved by families governed by a fixed low-dimensional subspace.
  • A degree-diversity theorem generalizing the Hilton-Milner theorem holds for t-intersecting families of subspaces.
  • Analogues of other classical extremal results for intersecting set families extend to the setting of t-intersecting subspace families via the same structural reduction.
  • The cross-intersecting variant yields corresponding bounds and structural descriptions for pairs of families.

Where Pith is reading between the lines

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

  • The same spreadness-based simplification might apply to families defined by other linear dependence or rank conditions beyond pure intersection.
  • Small-dimensional vector spaces could be used for exhaustive computer checks to locate the precise size threshold where the low-dimensional structure begins to dominate.
  • Similar governing structures may exist for intersecting families in other incidence geometries such as projective spaces.

Load-bearing premise

The t-intersecting family must be large enough in size and the ambient dimension n must be at least 2k plus 1.

What would settle it

An explicit construction of a large t-intersecting family of k-subspaces in dimension n at least 2k+1 that does not admit any low-dimensional governing structure would falsify the central claim.

read the original abstract

We study $t$-intersecting and $t$-cross-intersecting families of $k$-dimensional subspaces in finite vector spaces of dimension $n$. We show that all large $t$-intersecting families admit a governing low-dimensional structure for $n \ge 2k+1$. This result, together with its cross-intersecting variant, allows us to prove analogues of several classical extremal set-theoretic results. In particular, we determine the intersecting families with the largest diversity, and we establish a Frankl-type degree-diversity result that generalizes the Hilton-Milner theorem. Our proofs rely on simplification procedures for $t$-intersecting and $t$-cross-intersecting families of subspaces. These procedures are based on the concept of subspace spreadness, a generalization of the classical notion of spreadness for set systems.

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 / 3 minor

Summary. The paper studies t-intersecting and t-cross-intersecting families of k-dimensional subspaces in an n-dimensional vector space over a finite field. It proves that every sufficiently large t-intersecting family (for n ≥ 2k+1) admits a governing low-dimensional subspace structure, via iterative simplification procedures based on a new notion of subspace spreadness (defined as a minimum intersection density over (k-t+1)-dimensional extensions). The structure theorem is then applied to determine the t-intersecting families of maximum diversity and to prove a Frankl-type degree-diversity result that generalizes the Hilton-Milner theorem; a parallel cross-intersecting variant is also obtained.

Significance. If the results hold, the work supplies vector-space analogues of several classical extremal results in set theory, including structure theorems for large intersecting families. The explicit (parameter-dependent) size thresholds, the generalization of spreadness, and the non-circular case analysis for n ≥ 2k+1 are strengths; the simplification lemmas directly enable the diversity and degree-diversity applications.

minor comments (3)
  1. [Definition 2.3] Definition 2.3: the subspace spreadness parameter is introduced without an immediate comparison table to the classical set-system spreadness; adding one would clarify the precise generalization.
  2. [Theorem 4.2] Theorem 4.2 (diversity result): the proof invokes the structure theorem but does not restate the exact size threshold used; repeating the threshold (even as a reference to the earlier lemma) would improve readability.
  3. [Section 5] Section 5: the cross-intersecting variant is stated to follow by the same reduction, but the minor adjustments to the spreadness definition for the cross case are only sketched; a short dedicated paragraph would help.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and accurate summary of our manuscript, as well as for the recommendation of minor revision. The report correctly identifies the structure theorem for large t-intersecting families, the applications to diversity and degree-diversity, and the role of subspace spreadness. Since no specific major comments are listed under the MAJOR COMMENTS section, we have no individual points requiring rebuttal or clarification at this stage.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper explicitly defines subspace spreadness as the minimum intersection density over all (k-t+1)-dimensional extensions of a given subspace and then proves two simplification lemmas that iteratively reduce large t-intersecting families (size above an explicit threshold) to families stabilized by a fixed low-dimensional subspace. These reductions are carried out by direct case analysis for n ≥ 2k+1 without invoking the final structure theorem as a premise. The cross-intersecting variant follows by the same explicit reduction. All steps rest on the classical spreadness notion generalized in a self-contained way rather than on self-citation chains or fitted inputs renamed as predictions.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper rests on standard linear-algebra axioms over finite fields and introduces subspace spreadness as a definitional tool rather than an independent entity.

axioms (1)
  • standard math Axioms of finite-dimensional vector spaces over finite fields
    The entire setting of k-dimensional subspaces in n-dimensional space is defined using these axioms.

pith-pipeline@v0.9.0 · 5435 in / 1279 out tokens · 27084 ms · 2026-05-08T18:24:46.181390+00:00 · methodology

discussion (0)

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

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Matchings in permutations

    math.CO 2026-05 unverdicted novelty 4.0

    Largest s-matching-free families of permutations are characterized, with a Hilton-Milner type theorem and results for derangements.

Reference graph

Works this paper leans on

37 extracted references · 37 canonical work pages · cited by 1 Pith paper

  1. [1]

    Ahlswede and L.H

    R. Ahlswede and L.H. Khachatrian,The Complete Intersection Theorem for Systems of Finite Sets, European Journal of Combinatorics. 18 (1997), 125–136

    work page 1997

  2. [2]

    Blokhuis, A.E

    A. Blokhuis, A.E. Brouwer, A. Chowdhury, P. Frankl, T. Mussche, B. Patk´ os, T. Sz˝ onyi,A Hilton–Milner theorem for vector spaces, Electron. J. Combin. 17(1) (2010). 24 FERDINAND IHRINGER, ANDREY KUPAVSKII

    work page 2010

  3. [3]

    Blokhuis, A.E

    A. Blokhuis, A.E. Brouwer, T. Sz˝ onyi,On the chromatic number of q-Kneser graphs, Des. Codes Cryptogr. 65(3) (2012) 187–197

    work page 2012

  4. [4]

    Brouwer, A.M

    A.E. Brouwer, A.M. Cohen, A. Neumaier,Distance-regular graphs, Springer Berlin Heidelberg, 1989

    work page 1989

  5. [5]

    M. Cao, B. Lv, K. Wang,Non-trivialt-intersecting families for the distance-regular graphs of bilinear forms, J. Algebraic Combin. 63 (2026) 19

    work page 2026

  6. [6]

    M. Cao, B. Lv, K. Wang, S. Zhou,Non-trivialt-intersecting families for vector spaces, SIAM J. Discrete Math. 36(3) (2022) 1823–1847

    work page 2022

  7. [7]

    Chowdhury and B

    A. Chowdhury and B. Patk´ os,Shadows and intersections in vector spaces, J. Combin. Theory Ser. A 117(8) (2010) 1095–1106

    work page 2010

  8. [8]

    De Boeck,The largest Erd˝ os-Ko-Rado sets of planes in finite projective and finite classical polar spaces, Des

    M. De Boeck,The largest Erd˝ os-Ko-Rado sets of planes in finite projective and finite classical polar spaces, Des. Codes Cryptogr. 72 (2014) 77–117

    work page 2014

  9. [9]

    M. Deza, P. Frankl,Erd˝ os-Ko-Rado theorem–22 years later, Siam J. Algebraic Discrete Meth- ods 4 (1983) 419–431

    work page 1983

  10. [10]

    D’haeseleer,Hilton–Milner results in projective and affine spaces, Adv

    J. D’haeseleer,Hilton–Milner results in projective and affine spaces, Adv. Geom. 23(1) (2023) 1–24

    work page 2023

  11. [11]

    Dinur, E

    I. Dinur, E. Friedgut,Intersecting families are essentially contained in juntas, Combin. Probab. Comput. 18 (2009) 107–122

    work page 2009

  12. [12]

    Erd˝ os, C

    P. Erd˝ os, C. Ko, R. Rado,Intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser. (2) 12 (1961) 313–320

    work page 1961

  13. [13]

    S. Evra, G. Kindler, N. Lifshitz,Polynomial Bogolyubov for special linear groups via tensor rank, arXiv:2404.00641 [math.CO]

    work page arXiv

  14. [14]

    Frankl,On intersecting families of finite sets, J

    P. Frankl,On intersecting families of finite sets, J. Combin. Theory Ser. A 24 (1978), 146–161

    work page 1978

  15. [15]

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

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

    work page 1987

  16. [16]

    Frankl, J

    P. Frankl, J. Wang,Improved bounds on the maximum diversity of intersecting families, European J. Combin. 118 (2024) 103885

    work page 2024

  17. [17]

    Frankl, R

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

    work page 1986

  18. [18]

    F¨ uredi,Erd˝ os–Ko–Rado type theorems with upper bounds on the maximum degree, Collo- quia Math

    Z. F¨ uredi,Erd˝ os–Ko–Rado type theorems with upper bounds on the maximum degree, Collo- quia Math. Soc. J. Bolyai 25, Szeged, 1978, pp. 177–207

    work page 1978

  19. [19]

    C. Gong, B. Lv, K. Wang,Non-trivial intersecting families for finite affine spaces, arXiv:1901.05759 [math.CO]

    work page arXiv 1901

  20. [20]

    Godsil, M.W

    C.D. Godsil, M.W. Newman,Independent sets in association schemes, Combinatorica 26(4) (2006) 431–443

    work page 2006

  21. [21]

    Hilton, E.C

    A.J.W. Hilton, E.C. Milner,Some intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser. (2) 18 (1967) 369–384

    work page 1967

  22. [22]

    Hirschfeld,Projective Geometries Over Finite Fields, Oxford Mathematical Mono- graphs

    J.W.P. Hirschfeld,Projective Geometries Over Finite Fields, Oxford Mathematical Mono- graphs. Clarendon Press, 1998

    work page 1998

  23. [23]

    Hsieh,Intersection theorems for systems of finite vector spaces, Discrete Math

    W.N. Hsieh,Intersection theorems for systems of finite vector spaces, Discrete Math. 12(1) (1975) 1–16

    work page 1975

  24. [24]

    Hsieh,Families of intersecting finite vector spaces, J

    W.N. Hsieh,Families of intersecting finite vector spaces, J. Combin. Theory Ser. A 18 (1975) 252–261

    work page 1975

  25. [25]

    Huang,An analogue of the Erd˝ os-Ko-Rado theorem for the distance-regular graphs of bilinear forms, Discrete Math

    T. Huang,An analogue of the Erd˝ os-Ko-Rado theorem for the distance-regular graphs of bilinear forms, Discrete Math. 64(2) (1987) 191–198

    work page 1987

  26. [26]

    Ihringer,The Chromatic Number of theq-Kneser graph forqLarge, Electron

    F. Ihringer,The Chromatic Number of theq-Kneser graph forqLarge, Electron. J. Combin. 26(1) (2019)

    work page 2019

  27. [27]

    Ihringer, A

    F. Ihringer, A. Kupavskii,Regular intersecting families, Discrete Math. 270 (2019) 142–152

    work page 2019

  28. [28]

    Kupavskii,Erd˝ os-Ko-Rado type results for partitions via spread approximations, Eur

    A. Kupavskii,Erd˝ os-Ko-Rado type results for partitions via spread approximations, Eur. J. Comb. 132 (2026)

    work page 2026

  29. [29]

    Kupavskii,Delta-system method: a survey, arXiv:2508.20132

    A. Kupavskii,Delta-system method: a survey, arXiv:2508.20132

    work page arXiv

  30. [30]

    Kupavskii, D

    A. Kupavskii, D. Zakharov,Regular bipartite graphs and intersecting families, J. Comb. Theory Ser. A 155 (2018) 180–189

    work page 2018

  31. [31]

    Mussche,Extremal combinatorics in generalized Kneser graphs, (2009).https://doi.org/ 10.6100/IR642440

    T. Mussche,Extremal combinatorics in generalized Kneser graphs, (2009).https://doi.org/ 10.6100/IR642440

    work page doi:10.6100/ir642440 2009

  32. [32]

    P. M. Neumann, C. E. Praeger,Cyclic matrices over finite fields, J. London Math. Soc. 52(2) (1995) 263–284

    work page 1995

  33. [33]

    Y. Shan, J. Zhou,d-Degree Erd˝ os-Ko-Rado theorem for finite vector spaces, (2024).https: //doi.org/10.48550/arXiv.2411.17985

    work page doi:10.48550/arxiv.2411.17985 2024

  34. [34]

    S. Suda, H. Tanaka,A cross-intersection theorem for vector spaces based on semidefinite programming, Bulletin of the London Mathematical Society 46 (2014) 342–348.https://doi. org/10.1112/blms/bdt101 STRUCTURE OFt-INTERSECTING FAMILIES OF VECTOR SPACES 25

    work page doi:10.1112/blms/bdt101 2014

  35. [35]

    Tanaka,Classification of subsets with minimal width and dual width in Grassmann, bi- linear forms and dual polar graphs, J

    H. Tanaka,Classification of subsets with minimal width and dual width in Grassmann, bi- linear forms and dual polar graphs, J. Combin. Theory Ser. A 113(5) (2006) 903–910

    work page 2006

  36. [36]

    Tanaka, N

    H. Tanaka, N. Tokushige,Extremal problems for intersecting families of subspaces with a measure, European J. Combin. 127 (2025) 104156

    work page 2025

  37. [37]

    J. Wang, A. Xu, H. Zhang,A Kruskal–Katona-type theorem for graphs:q-Kneser graphs, J. Combin. Theory Ser. A 198 (2023) 105766

    work page 2023