Rank of incidence matrices over integers modulo a prime power

Zeev Dvir

arxiv: 2604.25822 · v1 · submitted 2026-04-28 · 🧮 math.CO

Rank of incidence matrices over integers modulo a prime power

Zeev Dvir This is my paper

Pith reviewed 2026-05-07 15:46 UTC · model grok-4.3

classification 🧮 math.CO

keywords incidence matrixF_p-rankpoints and hyperplanesZ/p^k Zfinite ringslinear dependenciescombinatorial geometry

0 comments

The pith

An improved upper bound holds for the F_p-rank of the point-hyperplane incidence matrix in (Z/p^k Z)^n when k is large.

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

The paper sets out to establish a new upper bound on the F_p-rank of the incidence matrix for points and hyperplanes inside the module (Z/p^k Z)^n. This matrix encodes the containment relations between points and hyperplanes, and its rank over F_p reflects the maximum number of linearly independent such relations. A sympathetic reader cares because lower ranks correspond to more dependencies, which can simplify proofs in combinatorial geometry and linear algebra over finite rings. The improvement over earlier work occurs specifically when the exponent k becomes large, due to the richer algebraic structure of the ring at higher powers of p.

Core claim

We prove an upper bound on the F_p-rank of the incidence matrix of points and hyperplanes in (Z/p^k Z)^n, improving a recent bound of Laba and Trainer when k is large.

What carries the argument

The incidence matrix of points versus hyperplanes in the n-dimensional free module over the ring Z/p^k Z, considered as a matrix over the field F_p; the key mechanism is the detection of extra F_p-linear relations induced by the ring operations when k grows.

If this is right

The F_p-dimension of the space spanned by the incidence vectors is smaller than previously estimated once k exceeds a threshold depending on n and p.
Tighter control is obtained over the kernel of the incidence map when working over F_p.
Combinatorial applications that depend on this rank, such as bounding sets with restricted incidences, inherit the improvement for large k.

Where Pith is reading between the lines

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

The same extra-dependency phenomenon might produce analogous rank improvements for incidence matrices involving other submodules or varieties inside the same ring.
Computational checks on small parameters could reveal the precise growth rate of the rank as a function of k and suggest whether the bound is asymptotically tight.
Such rank reductions may have consequences for algebraic coding theory when the underlying alphabet is Z/p^k Z rather than a field.

Load-bearing premise

The incidence relation in (Z/p^k Z)^n admits additional linear dependencies over F_p precisely when k is sufficiently large, extracted from the ring structure.

What would settle it

Explicit computation of the exact F_p-rank for small fixed values of n and p with increasing k, to verify whether the new upper bound holds and is strictly smaller than the prior bound for large k.

read the original abstract

In this note we prove an upper bound on the $\mathbb F_p$-rank of the incidence matrix of points and hyperplanes in $(\mathbb Z/p^k \mathbb Z)^n$, improving a recent bound of Laba and Trainer when $k$ is large.

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.

Desk Editor's Note private letter to a colleague

Short note tightens the F_p-rank upper bound for point-hyperplane incidence matrices over Z/p^k Z when k is large, by exhibiting extra kernel vectors from the nilpotent ring structure.

read the letter

The core takeaway is that this note delivers a strictly better upper bound than Laba-Trainer once k exceeds a threshold depending on n and p. It does so by using the nilpotency in Z/p^k Z to produce additional F_p-linear dependencies among the incidence vectors, then exhibiting an explicit spanning set for the row space whose size matches the claimed expression. That construction is the actual advance, and the stress-test confirms it is written out without circular steps or unverified lifts. The paper therefore improves the state of the record in a concrete, checkable way for the large-k regime. The argument stays within combinatorial linear algebra over rings and does not claim broader consequences. The main limitation is that the improvement is conditional on k being large enough; for smaller k the bound reverts to the earlier one, so the result is incremental rather than uniform. The note is short and focused, with no applications or tightness examples supplied, which is reasonable for this format but leaves open whether the new bound is close to optimal. The citation pattern is clean, referencing the prior work directly and building on it without self-referential fitting. This is the kind of targeted refinement that specialists in incidence geometry or rank problems over finite rings would want to know about. A reader already working on bounds for matrices over Z/p^k Z or similar p-adic settings will get immediate value from the improved estimate and the explicit spanning set. It is not a foundational paper, but the derivation is self-contained and the improvement is genuine. I would send it to referees rather than desk-reject; the claim is modest but the evidence supplied in the manuscript appears sufficient to merit a careful check.

Referee Report

0 major / 3 minor

Summary. The manuscript proves an upper bound on the F_p-rank of the incidence matrix of points and hyperplanes in (Z/p^k Z)^n. This bound improves upon the recent result of Laba and Trainer when k is sufficiently large, by exhibiting a spanning set for the row space that incorporates additional F_p-linear dependencies arising from the nilpotent structure of Z/p^k Z.

Significance. If the derivation holds, the work sharpens the understanding of ranks of incidence matrices over finite rings by making the improvement explicit and constructive for large k. The approach of extracting extra kernel vectors directly from the ring structure offers a concrete advance over prior bounds and may inform related questions in combinatorial number theory or coding theory over Z/p^k Z.

minor comments (3)

[Abstract] The abstract asserts an improvement for large k but does not state the precise form of the new upper bound or the explicit threshold on k in terms of n and p; adding these would allow immediate comparison with the Laba-Trainer result.
[Introduction] Section 2 or the introduction would benefit from a short paragraph recalling the Laba-Trainer bound and indicating exactly which new dependencies appear only for k larger than the threshold.
[Preliminaries] The notation for the incidence matrix and the precise definition of the row space should be fixed early (e.g., before the main theorem) to avoid any ambiguity when the spanning-set argument is presented.

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 correctly summarizes the main result: an improved upper bound on the F_p-rank of the point-hyperplane incidence matrix over (Z/p^k Z)^n that becomes effective for sufficiently large k, obtained by constructing an explicit spanning set that incorporates extra linear dependencies arising from the nilpotent elements of the ring.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper derives an upper bound on the F_p-rank by explicitly constructing a spanning set for the row space of the incidence matrix, using additional linear dependencies that arise from the nilpotent elements in Z/p^k Z precisely when k is large enough relative to n and p. This construction is presented as a direct combinatorial argument extracted from the ring structure and does not reduce to any fitted parameter, self-referential definition, or load-bearing self-citation. The improvement over the Laba-Trainer bound is obtained by counting the extra kernel vectors that appear only for large k, with the derivation remaining self-contained against external benchmarks and without renaming known results or smuggling ansatzes.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The claim rests on the standard definition of incidence in the ring Z/p^k Z together with the definition of matrix rank over the field F_p; no free parameters or new entities are introduced.

axioms (2)

domain assumption Incidence is defined by the natural containment relation in (Z/p^k Z)^n
The matrix entries are 1 precisely when a point satisfies the linear equation defining a hyperplane.
standard math Rank is the dimension of the column space over the field F_p
The paper works throughout with linear algebra over F_p.

pith-pipeline@v0.9.0 · 5315 in / 1387 out tokens · 48350 ms · 2026-05-07T15:46:10.500273+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

2 extracted references · 2 canonical work pages

[1]

Thep-adic Kakeya conjecture.Journal of the American Mathe- matical Society, 37(1):69–80, 2024

[Ars24] Bodan Arsovski. Thep-adic Kakeya conjecture.Journal of the American Mathe- matical Society, 37(1):69–80, 2024. [DD21] Manik Dhar and Zeev Dvir. Proof of the Kakeya set conjecture over rings of integers modulo square-freeN.Combinatorial Theory, 1, 2021. Article #4. [Dha23] Manik Dhar.Beyond the Polynomial Method: Kakeya Sets Over Finite Rings and H...

work page 2024
[2]

Article 2

Combinatorics, January 2024. Article 2. 4 [LT25] Izabella Laba and Charlotte Trainor. Generalized polynomials and hyper- plane functions in (Z/p kZ)n.Combinatorial Theory, 5(1), 2025. Article #17; arXiv:2403.05719. 5

work page arXiv 2024

[1] [1]

Thep-adic Kakeya conjecture.Journal of the American Mathe- matical Society, 37(1):69–80, 2024

[Ars24] Bodan Arsovski. Thep-adic Kakeya conjecture.Journal of the American Mathe- matical Society, 37(1):69–80, 2024. [DD21] Manik Dhar and Zeev Dvir. Proof of the Kakeya set conjecture over rings of integers modulo square-freeN.Combinatorial Theory, 1, 2021. Article #4. [Dha23] Manik Dhar.Beyond the Polynomial Method: Kakeya Sets Over Finite Rings and H...

work page 2024

[2] [2]

Article 2

Combinatorics, January 2024. Article 2. 4 [LT25] Izabella Laba and Charlotte Trainor. Generalized polynomials and hyper- plane functions in (Z/p kZ)n.Combinatorial Theory, 5(1), 2025. Article #17; arXiv:2403.05719. 5

work page arXiv 2024