pith. sign in

arxiv: 2605.23644 · v1 · pith:K2MJQ25Pnew · submitted 2026-05-22 · 🧮 math.CO · math.NT

Balanced intersection size distributions in projective planes

Zolt\'an L\'or\'ant Nagy , Zsuzsa Weiner This is my paper

Pith reviewed 2026-05-25 04:04 UTC · model grok-4.3

classification 🧮 math.CO math.NT
keywords projective planessecant sizesintersection distributionscharacter sumsfinite geometriespoint-line incidencescolorings
0
0 comments X

The pith

In a projective plane of order q, every point set forces some secant size to appear on Θ(q^{3/2}) lines.

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

The paper proves that in a projective plane of order q, for any subset S of points, when lines are grouped by their intersection size with S, the largest group has size Θ(q^{3/2}). This lower bound is achieved asymptotically by random point sets and by some explicit constructions. A sympathetic reader would care because the result quantifies a forced unevenness in finite geometries that does not appear in the real projective plane. The work further connects the distribution question to legitimate colorings of the lines.

Core claim

The central claim is that the minimum over all point sets S of the maximum number of lines sharing any single intersection cardinality k equals Θ(q^{3/2}). The lower bound follows from character-sum estimates on the incidence counts; matching upper bounds are obtained from randomized and explicit point sets. The authors also relate balanced secant distributions to legitimate colorings and prove a statement resembling the Erdős-Faber-Lovász conjecture.

What carries the argument

Character-sum estimates that bound how evenly the intersection sizes |ℓ ∩ S| can be distributed across the lines ℓ of the plane.

If this is right

  • The secant-size counts cannot be made flatter than this order.
  • Random point sets achieve the optimal balance up to constant factors.
  • The same bound separates finite planes from real ones in possible distributions.
  • Balanced distributions correspond to certain legitimate colorings of the plane.

Where Pith is reading between the lines

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

  • Similar forced imbalance may hold in other finite linear spaces or designs.
  • The coloring link could transfer techniques between incidence geometry and hypergraph coloring.
  • For small q the bound can be checked by exhaustive search over small point sets.

Load-bearing premise

The projective plane must arise from a finite field so that character-sum techniques can be applied to count the frequencies.

What would settle it

An explicit point set S in a projective plane of order q such that no intersection size k occurs on more than o(q^{3/2}) lines would disprove the claimed lower bound.

read the original abstract

Given a point set $S$ in a projective plane $\Pi_q$ of order $q$, each line $\ell$ determines a secant size $|S\cap \ell|$. We study how balanced the secant-size distribution can be for the line set $\mathcal{L}$ of the plane, in other words, how many lines must share the same secant size. We show that $\min_{ S\subseteq \Pi_q} \max_k |\{\ell\in \mathcal{L}: |\ell\cap S|=k\}|=\Theta(q^{3/2}).$ This shows a large contrast with the case of real projective (or affine) plane, where $\max_{k>1} |\{\ell\in~ \mathcal{L}: |\ell\cap S|=k\}|$ is always at least the third of $|\{\ell\in \mathcal{L}: |\ell\cap S|>1\}|$. We also discuss explicit constructions in addition to randomized point sets, that are asymptotically close to be optimal, and point out a link between the constructions and character-sum estimates. Finally, we explore the relation between balanced secant size distributions and legitimate colorings, studied by Alon and F\"uredi, and prove a result that might resemble the Erd\H{o}s-Faber-Lov\'asz conjecture.

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

2 major / 2 minor

Summary. The paper claims to prove that for any projective plane Π_q of order q, min over point sets S of max_k |{lines ℓ with |ℓ ∩ S| = k}| equals Θ(q^{3/2}). It contrasts this with the real projective plane (where the max frequency is at least one-third of the secant lines), supplies explicit and randomized constructions achieving the upper bound asymptotically, notes a link between the constructions and character-sum estimates, and proves a result relating balanced secant distributions to legitimate colorings in the style of the Erdős–Faber–Lovász conjecture.

Significance. If the Θ(q^{3/2}) bound holds under only the incidence axioms, the result supplies a sharp combinatorial distinction between finite and real projective planes together with asymptotically optimal constructions. The explicit link to character-sum estimates for the constructions is a concrete strength when the plane is Desarguesian.

major comments (2)
  1. [Abstract and lower-bound argument] Abstract: the central claim asserts the Θ(q^{3/2}) bound for an arbitrary projective plane obeying only the standard incidence axioms. The lower bound direction (Ω(q^{3/2})) is described as relying on character-sum estimates; these estimates in the literature require a finite-field coordinatization and do not apply to non-Desarguesian planes. The manuscript must either supply a field-free combinatorial argument (double counting, linear algebra, or eigenvalue methods) that establishes the Ω direction for every projective plane, or restrict the statement of the theorem to Desarguesian planes.
  2. [Constructions section] Constructions and randomized point sets: the manuscript states that both the explicit constructions and the randomized sets are asymptotically optimal. It is unclear whether these constructions are defined for an arbitrary incidence structure satisfying the projective-plane axioms or only for planes arising from GF(q). This distinction determines whether the matching O(q^{3/2}) upper bound on the min holds in full generality.
minor comments (2)
  1. [Notation] The notation Π_q and script L should be introduced once and used uniformly; the transition from the abstract to the body occasionally redefines them.
  2. [Colorings section] The relation to Alon–Füredi legitimate colorings is mentioned; the precise statement of the new result on colorings should be isolated in a separate theorem with a short proof sketch.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and for identifying the key issue regarding the scope of our lower-bound argument. We address each major comment below.

read point-by-point responses

  1. Referee: [Abstract and lower-bound argument] Abstract: the central claim asserts the Θ(q^{3/2}) bound for an arbitrary projective plane obeying only the standard incidence axioms. The lower bound direction (Ω(q^{3/2})) is described as relying on character-sum estimates; these estimates in the literature require a finite-field coordinatization and do not apply to non-Desarguesian planes. The manuscript must either supply a field-free combinatorial argument (double counting, linear algebra, or eigenvalue methods) that establishes the Ω direction for every projective plane, or restrict the statement of the theorem to Desarguesian planes.

    Authors: We agree that the Ω(q^{3/2}) lower bound in the manuscript relies on character-sum estimates available only for Desarguesian planes. No field-free combinatorial proof for arbitrary projective planes is currently available. We will therefore revise the manuscript to restrict the main theorem (and all related statements) to Desarguesian planes of order q. revision: yes

  2. Referee: [Constructions section] Constructions and randomized point sets: the manuscript states that both the explicit constructions and the randomized sets are asymptotically optimal. It is unclear whether these constructions are defined for an arbitrary incidence structure satisfying the projective-plane axioms or only for planes arising from GF(q). This distinction determines whether the matching O(q^{3/2}) upper bound on the min holds in full generality.

    Authors: Both the explicit constructions and the randomized point sets are defined using the vector-space structure over GF(q) and therefore apply only to Desarguesian planes. We will add explicit clarification of this scope in the revised manuscript and update all claims to be consistent with the restriction to Desarguesian planes. revision: yes

Circularity Check

0 steps flagged

No circularity: bound derived from incidence axioms plus external character-sum estimates

full rationale

The central Θ(q^{3/2}) result is obtained by combining double-counting on incidences with external Weil-type character-sum bounds; no equation in the supplied abstract or reader's summary reduces the claimed minimum to a fitted parameter, a self-citation, or a renaming of an input quantity. The derivation therefore remains self-contained against the stated incidence axioms and the cited analytic tools.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the standard incidence axioms of a projective plane of order q together with analytic tools (character sums) from number theory; no free parameters or invented entities are introduced in the abstract.

axioms (1)
  • domain assumption A projective plane of order q exists and satisfies the usual incidence properties (any two distinct lines intersect in exactly one point, every line contains q+1 points).
    The statement and all subsequent claims are formulated for such a plane Π_q.

pith-pipeline@v0.9.0 · 5769 in / 1299 out tokens · 47589 ms · 2026-05-25T04:04:47.047400+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

35 extracted references · 35 canonical work pages

  1. [1]

    Adriaensen, S., Weiner, Zs. (2025). Points below a parabola in affine planes of prime order. Bull. Belg. Math. Soc. 32(3), 332–342

    work page 2025

  2. [2]

    Adriaensen, S., Sz˝ onyi, T., Weiner, Zs. (2026). Multisets with few special directions and small weight codewords in Desarguesian planes. Designs, Codes and Cryptography, 94(2), 35

    work page 2026

  3. [3]

    Alon, N., F¨ uredi, Z. (1989). Legitimate colorings of projective planes. Graphs and Combina- torics, 5(1), 95–106

    work page 1989

  4. [4]

    Ball, S. (2003). The number of directions determined by a function over a finite field. Journal of Combinatorial Theory, Series A, 104 (2), 341–350

    work page 2003

  5. [5]

    Two-coloring the points of a projective plane, manuscript

    Blokhuis, A., Mark´ o,´A., Sz˝ onyi, T., Weiner, Zs. Two-coloring the points of a projective plane, manuscript

    work page

  6. [6]

    Blokhuis, A., Seress, A., Wilbrink, H. A. (1991). On sets of points in PG(2, q) without tangents. Mitt. Math. Sem. Giessen, 201, 39–44

    work page 1991

  7. [7]

    Blokhuis, A., Sz˝ onyi, T., Weiner, Zs. (2003). On sets without tangents in Galois planes of even order. Designs, Codes and Cryptography, 29, 91–98. 12

    work page 2003

  8. [8]

    E., Storme, L., Sz˝ onyi, T

    Blokhuis, A., Ball, S., Brouwer, A. E., Storme, L., Sz˝ onyi, T. (1999). On the number of slopes of the graph of a function defined on a finite field. Journal of Combinatorial Theory, Series A, 86 (1), 187–196

    work page 1999

  9. [9]

    Bober, J., Goldmakher, L., Granville, A., Koukoulopoulos, D. (2018). The frequency and the structure of large character sums. Journal of the European Mathematical Society (EMS Publishing), 20(7)

    work page 2018

  10. [10]

    Bruen, A. A. (1971). Blocking sets in finite projective planes. SIAM Journal on Applied Math- ematics, 21(3), 380–392

    work page 1971

  11. [11]

    Conlon, D., Mattheus, S., Mubayi, D., Verstra¨ ete, J. (2024). Ramsey numbers and the Zarankiewicz problem. Bulletin of the London Mathematical Society, 56(6), 2014–2023

    work page 2024

  12. [12]

    Durante, N. (2014). On sets with few intersection numbers in finite projective and affine spaces. The Electronic Journal of Combinatorics, 21(4), P4–13

    work page 2014

  13. [13]

    Erd˝ os, P. (1988). Problems and results in combinatorial analysis and graph theory. In Annals of Discrete Mathematics (Vol. 38, pp. 81–92). Elsevier

    work page 1988

  14. [14]

    Ghidelli, L. (2020). On rich and poor directions determined by a subset of a finite plane. Discrete Mathematics, 343(5), 111811

    work page 2020

  15. [15]

    Green, B., Tao, T. (2013). On sets defining few ordinary lines. Discrete & Computational Geometry, 50(2), 409–468

    work page 2013

  16. [16]

    Harper, A. J. (2025). A note on character sums over short moving intervals. Journal of the Institute of Mathematics of Jussieu, 24(4), 1395–1427

    work page 2025

  17. [17]

    (1934) Abstrakte Begr¨ undung der komplexen Multiplikation und Riemannsche Ver- mutung in Funktionenk¨ orpern

    Hasse, H. (1934) Abstrakte Begr¨ undung der komplexen Multiplikation und Riemannsche Ver- mutung in Funktionenk¨ orpern. I. Nachr. Ges. Wiss. G¨ ottingen, 1–17

    work page 1934

  18. [18]

    Hasse, H. (1934). ¨Uber die Kongruenzzetafunktionen. Sitzungsber. Preuss. Akad. Wiss. Berlin 250–263

    work page 1934

  19. [19]

    H´ eger, T., Nagy, Z. L. (2025). Avoiding secants of given size in finite projective planes. Journal of Combinatorial Designs, 33(3), 83–93

    work page 2025

  20. [20]

    Hirzebruch, F. (1986). Arrangements of lines and algebraic surfaces. In Arithmetic and Ge- ometry (Vol. II, pp. 113–140). Birkh¨ auser

    work page 1986

  21. [21]

    Hussain, A. (2022). The limiting distribution of character sums. International Mathematics Research Notices, 2022(20), 16292–16326

    work page 2022

  22. [22]

    Y., Kelly, T., K¨ uhn, D., Methuku, A., Osthus, D

    Kang, D. Y., Kelly, T., K¨ uhn, D., Methuku, A., Osthus, D. (2023). A proof of the Erd˝ os- Faber-Lov´ asz conjecture. Annals of Mathematics, 198(2), 537–618

    work page 2023

  23. [23]

    Kiss, G., Somlai, G. (2024). Special directions on the finite affine plane. Designs, Codes and Cryptography 92(9), 2587–2597

    work page 2024

  24. [24]

    Lenstra Jr, H. W. (1987). Factoring integers with elliptic curves. Annals of mathematics, 649– 673. 13

    work page 1987

  25. [25]

    Mattheus, S., Verstra¨ ete, J. (2024). The asymptotics of r(4,t). Annals of Mathematics, 199(2), 919–941

    work page 2024

  26. [26]

    Melchior, E. (1941). ¨Uber Vielseite der projektiven Ebene. Deutsche Mathematik, 5, 461–475

    work page 1941

  27. [27]

    L., Vaughan, R

    Montgomery, H. L., Vaughan, R. C. (2007). Multiplicative number theory I: Classical theory (Vol. 97). Cambridge University press

    work page 2007

  28. [28]

    L., Weiner, Zs

    Nagy, Z. L., Weiner, Zs. (2026). Extremal secant size distributions in projective planes. Manuscript

    work page 2026

  29. [29]

    Pach, J., Agarwal, P. K. (1995). Combinatorial Geometry. Wiley

    work page 1995

  30. [30]

    (2004, June)

    Pach, J., Radoici´ c, R., Tardos, G., T´ oth, G. (2004, June). Improving the crossing lemma by finding more crossings in sparse graphs. In Proceedings of the twentieth annual symposium on Computational geometry (pp. 68–75)

    work page 2004

  31. [31]

    S´ ark¨ ozy, A. (1977). Some remarks concerning irregularities of distribution of sequences of integers in arithmetic progressions. IV, Acta Math. Acad. Sci. Hungar. 30(1-2), 155–162

    work page 1977

  32. [32]

    Sokolovski˘ ı, A. V. (1982). On a theorem of A. S´ ark¨ ozy,Acta Arith. 41(1), 27–31

    work page 1982

  33. [33]

    Spencer, J. (1988). Coloring the projective plane. Discrete Mathematics, 73(1-2), 213–220

    work page 1988

  34. [34]

    Szemer´ edi, E., Trotter Jr, W. T. (1983). Extremal problems in discrete geometry. Combina- torica, 3(3), 381–392

    work page 1983

  35. [35]

    Sz˝ onyi, T. (1996). On the number of directions determined by a set of points in an affine Galois plane. Journal of Combinatorial Theory, Series A, 74 (1), 141–146. 14

    work page 1996