Pith. sign in

REVIEW 3 minor 25 references

$q$-analogues of Fisher's inequality and oddtown theorem

T0 review · 0 major / 3 minor · reviewed 2026-05-22 · grok-4.3

Challenge this review Download PDF Read on arXiv ↗

Pith's one-line read A q-analogue of Fisher's inequality limits the number of clubs to the number of inhabitants when pairwise intersections have constant size.

desk verdict Short note delivering direct q-analogues of Fisher's inequality and the oddtown theorem via Gaussian binomials and finite-field linear algebra. read the letter →

arxiv 2505.15664 v1 submitted 2025-05-21 math.CO

Hiranya Kishore Dey This is my paper
classification math.CO
keywords q-analogueFisher'sinequalityoddtowntheoremdesigntheoryfinitefieldscombinatorialboundsprimepower
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper establishes a q-analogue of Fisher's inequality from design theory. In the classical version, if every pair of clubs shares the same number of members then the number of clubs cannot exceed the number of inhabitants. The q-version adapts this bound to a parameterized setting, most likely using subspaces or linear spaces over a field with q elements. A sympathetic reader would care because the extension shows how basic counting bounds survive the passage to finite geometries. The paper also supplies a q-analogue of the oddtown theorem when q is an odd prime power.

What carries the argument

The q-analogue of the constant pairwise intersection size condition that lets the original counting or linear-algebra argument transfer to the q-setting.

What would settle it

A collection of q-clubs with constant pairwise intersection sizes in which the number of clubs exceeds the number of inhabitants, or an oddtown family over an even prime power that violates the expected bound.

Watch

Extended reading notes

Core claim

We establish a q-analogue of Fisher's inequality. Additionally, we present a q-analogue of the oddtown theorem for the case when q is an odd prime power.

Load-bearing premise

The requirement that every pair of clubs has exactly the same intersection size carries over unchanged to the q-version, and the oddtown extension holds only when q is an odd prime power.

Editorial extensions

If this is right

  • The classical b ≥ v bound on blocks versus points continues to hold in q-designs with uniform intersections.
  • The oddtown bound on families with odd cardinalities and even intersections extends directly to the q-case for odd prime powers.
  • The same uniformity hypothesis suffices for both results without extra restrictions on the parameters.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The q-Fisher result may yield analogous bounds for other classical design inequalities once translated to the same q-language.
  • Explicit small examples for q = 3 could be enumerated by hand or machine to confirm the numerical bound.
  • The construction may connect to linear-algebra methods already used in q-analogues of intersecting families.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 3 minor

Summary. The paper establishes a q-analogue of Fisher's inequality bounding the number of subspaces of a vector space over GF(q) with constant intersection dimension, and a q-analogue of the oddtown theorem restricted to the case when q is an odd prime power, both proved via direct arguments using Gaussian binomial coefficients and linear algebra over finite fields.

Significance. If the derivations hold, the results furnish natural q-analogues of two classical theorems in extremal set theory, extending them to the setting of finite vector spaces where intersections are measured by dimension; this may prove useful for applications in finite geometry and q-analogues of designs. The manuscript credits the direct combinatorial approach via Gaussian binomials and the restriction to odd prime powers for the oddtown case (to ensure -1 is not a square), which aligns with standard techniques in the field.

minor comments (3)
  1. [Theorem 1.1] The statement of the q-Fisher inequality in the main theorem should explicitly record the precise bound in terms of the Gaussian binomial coefficient [n choose k]_q to make the comparison with the classical case immediate.
  2. [Section 3] In the proof of the oddtown q-analogue, the parity condition on dimensions is invoked via the field characteristic; a brief remark clarifying why the argument requires q odd (rather than merely odd prime power) would aid readers unfamiliar with the linear-algebraic parity trick.
  3. [Introduction] Notation for the q-analogue of a 'club' or block (i.e., the collection of subspaces) is introduced without a dedicated definition paragraph; adding one sentence would improve readability for non-specialists.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript and for recommending minor revision. The referee's summary accurately captures the main contributions: a q-analogue of Fisher's inequality for subspaces with constant intersection dimension, proved via Gaussian binomials and linear algebra, together with a q-analogue of the oddtown theorem restricted to odd prime powers q. No specific major comments were listed in the report, so we have no individual points requiring rebuttal or revision at this stage.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity identified

full rationale

The derivations consist of direct combinatorial arguments that translate the classical uniformity and parity conditions into the q-setting via Gaussian binomials and linear algebra over GF(q). No step reduces a claimed result to a fitted parameter, self-definition, or load-bearing self-citation; the odd-prime-power restriction follows from the field property that -1 is not a square, which is an external algebraic fact independent of the paper's own inputs.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

The work rests on standard definitions of q-analogues and Gaussian binomial coefficients from prior literature, with no new free parameters or invented entities introduced.

assumptions (1)
  • standard math Gaussian binomial coefficients satisfy the standard q-analogue identities and counting properties for subspaces.
    Invoked throughout the q-analogue constructions and bounds.

how reviews work

0 comments
Cite this review

Pith. "Pith review of $q$-analogues of Fisher's inequality and oddtown theorem." pith.science (2026). https://pith.science/paper/2505.15664

@misc{pith2026250515664,
  author       = {Pith},
  title        = {Pith review of: $q$-analogues of Fisher's inequality and oddtown theorem},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2505.15664}},
  note         = {Machine review of arXiv:2505.15664}
}
abstract

A classical result in design theory, known as Fisher's inequality, states that if every pair of clubs in a town shares the same number of members, then the number of clubs cannot exceed the number of inhabitants in the town. In this short note, we establish a $q$-analogue of Fisher's inequality. Additionally, we present a $q$-analogue of the oddtown theorem for the case when $q$ is an odd prime power.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

25 extracted references · 25 canonical work pages

  1. [1]

    Babai, On the nonuniform Fisher inequality, Discrete Mathematics, 66 (1987), 303– 307

    L. Babai, On the nonuniform Fisher inequality, Discrete Mathematics, 66 (1987), 303– 307. 7

    work page 1987

  2. [2]

    Babai and P

    L. Babai and P . Frankl, Linear algebra methods in combina torics, Preliminary V ersion 2, Department of Computer Science, University of Chicago, 199 2

    work page

  3. [3]

    E. R. Berlekamp, On subsets with intersections of even ca rdinality, Canadian Mathemat- ical Bulletin, 12 (1969), 471–474

    work page 1969

  4. [4]

    Blokhuis, A

    A. Blokhuis, A. E. Brouwer, A. Chowdhury, P . Frankl, T. Mu ssche, B. Patkós, and T. Sz˝onyi, A Hilton–Milner theorem for vector spaces, Electronic Journal of Combinatorics, 17 (2010), R71

    work page 2010

  5. [5]

    Bollobás

    B. Bollobás. On generalized graphs, Acta Mathematica Academiae Scientiarum Hungar- ica, 16 (1965), 447–452

    work page 1965

  6. [6]

    R. C. Bose, A note on Fisher’s inequality for balanced inc omplete block designs, Annals of Mathematical Statistics , 20 (1949), 619–620

    work page 1949

  7. [7]

    N. G. de Bruijn and P . Erd ˝os, On a combinatorial problem, Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen Serie A, 51 (1948), 1277–1279; Indagationes Mathematicae, 10 (1948), 421–423

    work page 1948

  8. [8]

    M. Deza, P . Frankl and N. M. Singhi, On functions of strength t, Combinatorica, 3 (1983), 331–339

    work page 1983

Show all 25 references
  1. [9]

    Erd ˝os, C

    P . Erd ˝os, C. Ko and R. Rado, Intersection theorems for systems of fin ite sets, The Quar- terly Journal of Mathematics , Oxford Series, 12 (1961), 313–320

    1961

  2. [10]

    R. A. Fisher, An examination of the different possible s olutions of a problem in incom- plete blocks, Annals of Eugenics, 10 (1940), 52–75

    1940

  3. [11]

    Frankl and R

    P . Frankl and R. M. Wilson, The Erd ˝os-Ko-Rado theorem for vector spaces. Journal of Combinatorial Theory, Series A, 43 (1986), 228–236

    1986

  4. [12]

    Frankl and A

    P . Frankl and A. M. Odlyzko, On subsets with cardinaliti es of intersections divisible by a fixed integer, European Journal of Combinatorics , 4 (1983), 215–220

    1983

  5. [13]

    Goldman and G

    J. Goldman and G. Rota, The number of subspaces of a vecto r space, Recent progress in combinatorics. Proceedings of the third Waterloo Confer ence on combinatorics, 1968, New York, (1969), 75–83

    1968

  6. [14]

    J. E. Graver, Boolean designs and self-dual matroids, Linear Algebra and its Applications, 10 (1975), 111–128

    1975

  7. [15]

    A. J. W. Hilton and E. C. Milner, Some intersection theor ems for systems of finite sets, The Quarterly Journal of Mathematics , Oxford Series, 18 (1967), 369–384

    1967

  8. [16]

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

    1975

  9. [17]

    J. R. Isbell, An inequality for incidence matrices, Proceedings of the American Mathe- matical Society 10 (1959), 216–218. 8

    1959

  10. [18]

    G. O. H. Katona, A simple proof of the Erd ˝os-Chao Ko-Rado theorem. Journal of Com- binatorial Theory, Series B, 13 (1972), 183–184

    1972

  11. [19]

    K. N. Majumdar, On some theorems in combinatorics relat ing to incomplete block de- signs, Annals of Mathematical Statistics , 24 (1953), 377–389

    1953

  12. [20]

    Mathew, T

    R. Mathew, T. K. Mishra, A combinatorial proof of Fisher ’s inequality, Graphs and Com- binatorics, 36 (2020), 1953–1956

    2020

  13. [21]

    Sudakov, P

    B. Sudakov, P . Vieira, Two remarks on eventown and oddto wn problems, Siam Journal on Discrete Mathematics 32 (2018), 280–295

    2018

  14. [22]

    Szabó, V

    T. Szabó, V . Vu, Exact k-wise intersection theorems, Graphs and Combinatorics , 21 (2005), 247–261

    2005

  15. [23]

    Vu, Extremal set systems with weakly restricted inte rsections, Combinatorica, 19 (1999), 567–587

    V . Vu, Extremal set systems with weakly restricted inte rsections, Combinatorica, 19 (1999), 567–587

    1999

  16. [24]

    Lovász, Flats in matroids and geometric graphs

    L. Lovász, Flats in matroids and geometric graphs. In P .J. Cameron, editor, Combinatorial surveys: Proceedings of the Sixth British Combinatorial Co nference, Egham, (1977), 45– 86

    1977

  17. [25]

    D. R. Woodall, A note on fisher’s inequality, Journal of Combinatorial Theory, Series A , 77 (1997), 171–176. 9

    1997

Pith tools

Reviewed May 22, 2026 · model on record in the stance chip above.