REVIEW 5 minor 21 references
Combinatorial constructions of Schubert subspace codes
T0 review · 0 major / 5 minor · reviewed 2026-07-10 · grok-4.5
Pith's one-line read Optimal Schubert subspace codes exist when a partial spread is large enough to color a power of the q-Johnson graph, and field reduction from scattered spaces hits the same bound exactly.
desk verdict Solid combinatorial paper that settles the extremal size for Schubert subspace codes when t ≤ ℓ-1, with two clean constructions and an honest gap left open. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
Direct-sum maps φ that send each ℓ-space A ⊂ U to a (k−ℓ)-space φ(A) ⊂ V so that dim(A1 ∩ A2) + dim(φ(A1) ∩ φ(A2)) ≤ t; such maps exist precisely when the fibers of φ form independent sets of the power graph J_q(u,ℓ)^{k−t−1} and adjacent vertices receive pairwise disjoint images.
What would settle it
For concrete parameters where the asymptotic inequality of Theorem 3.9 fails (for example u=6, ℓ=3, k=5 and n=12), exhibit an optimal (ℓ,t)-intersecting set of direct-sum type, or prove that every map from the full Grassmannian of ℓ-spaces into the Grassmannian of (k−ℓ)-spaces in V violates the intersection bound.
Extended reading notes
Core claim
When t ≤ ℓ−1 the maximal size m_q(n,k,u,ℓ,t) equals A_q(u,ℓ,2(ℓ−t)) whenever a complement V of U admits a partial (k−ℓ)-spread whose cardinality is at least the chromatic number of the (k−t−1)-st power of the q-Johnson graph J_q(u,ℓ). Independently, the field reduction of any h-scattered F_q-subspace of F_{q^k}^r produces an (h,(h−1)k)-intersecting set of size exactly [u choose h]_q inside the Grassmannian of hk-spaces.
Load-bearing premise
The direct-sum optimality proofs need a partial spread in the complement that is large enough to color the relevant power of the q-Johnson graph; that size is guaranteed only asymptotically for large q under a dimensional inequality, or by classical spread bounds that leave a concrete gap with the necessary chromatic and clique conditions.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies Schubert subspace codes: constant-dimension codes whose codewords lie in a Schubert variety defined by a lower bound on intersection dimension with a fixed subspace U. For (ℓ,t)-intersecting sets with t ≤ ℓ−1 a counting argument yields the upper bound mq(n,k,u,ℓ,t) ≤ Aq(u,ℓ,2(ℓ−t)). The authors give two constructions that attain this bound in a range of parameters. The first uses a direct-sum decomposition Fnq = U ⊕ V, an optimal constant-dimension code in U, a partial (k−ℓ)-spread in V, and a coloring of the power Jq(u,ℓ)^{k−t−1}; necessary conditions via chromatic numbers and cliques are also derived. The second construction applies field reduction to evasive and h-scattered Fq-subspaces of Frqk, producing an (h,(h−1)k)-intersecting set of size exactly the Gaussian binomial [u choose h]q when the subspace is h-scattered, and recovering the earlier scattered-space construction of Alfarano–Rosenthal–Toesca as the case h=1.
Significance. The work supplies the first systematic combinatorial constructions of optimal Schubert subspace codes beyond the single previously known family. The direct-sum approach cleanly reduces optimality to classical objects (partial spreads, chromatic numbers of powers of q-Johnson graphs) and makes the resulting chromatic and clique obstructions explicit; the field-reduction approach links the problem to the well-studied geometry of scattered and evasive subspaces and yields an exact size formula. All arguments are elementary linear algebra and graph theory, fully written out, and free of circularity or fitted parameters. The remaining gap between sufficient and necessary conditions is correctly identified as an open problem rather than papered over. The contribution is solid and of clear interest to the combinatorial coding-theory community.
minor comments (5)
- In the statement of Theorem 3.5 and the surrounding discussion it would help the reader to recall explicitly that the induced subgraph Γ = Jq(u,ℓ)^{k−t−1}[A] may have chromatic number strictly smaller than that of the full power graph; Remark 3.6 already notes this, but a short forward pointer in the theorem statement would make the strongest form of the result easier to apply.
- Section 4, after Proposition 4.2: when h > 1 one has t = (h−1)k which typically exceeds ℓ−1 = h−1, so the counting bound of Proposition 2.5 does not apply. A single clarifying sentence at the beginning of the section would prevent a reader from expecting optimality claims that the authors correctly do not make (cf. Remark 4.7 and open problem (3)).
- Corollary 3.8: the hypothesis u ≤ n/2 is used only to guarantee that the full set of 1-dimensional subspaces of V is large enough; it would be slightly cleaner to replace it by the weaker (and more transparent) inequality [u choose 1]q ≤ [n−u choose 1]q.
- Example 3.21: the concrete numerical thresholds (n ≥ 16 even, n ≥ 17 odd, etc.) are useful; stating the precise Beutelspacher size used for each parity of n would make the verification fully self-contained.
- Minor typographical points: “Universit` a” and “Universit´e” appear with inconsistent accent encoding; “K¨ otter” should be “Kötter” throughout; the arXiv identifier of reference [8] is listed as 2602.10777 (future-dated) and may need updating once the preprint is public.
Circularity Check
No significant circularity: bounds and constructions are elementary self-contained combinatorial arguments; self-citations to prior author work supply only context and a recovered special case.
full rationale
The upper bound (Prop. 2.5) is a direct counting injection: map each codeword S to an ℓ-dimensional subspace of S ∩ U; the t ≤ ℓ−1 hypothesis forces injectivity and yields a constant-dimension code of distance 2(ℓ−t) inside U, so |S| ≤ A_q(u,ℓ,2(ℓ−t)). The direct-sum constructions (Thm. 3.5, Cor. 3.7–3.8, Thm. 3.9) start from an optimal code A in Gr_q(ℓ,u), colour the induced power of the q-Johnson graph, and assign elements of a partial (k−ℓ)-spread in a complementary space V; Lemma 3.1 decomposes intersections under direct sum, so the colouring and spread hypotheses guarantee the required intersection dimension ≤ t by elementary linear algebra. The field-reduction construction (Prop. 4.2, Thm. 4.4) likewise uses only the definition of h-scatteredness (Lemma 4.3) to produce a bijection between Λ_h,U and the Grassmannian of U, giving exact size [u choose h]_q. Necessary conditions (Cor. 3.15–3.16, Prop. 3.18–3.19) are ordinary graph-theoretic consequences of the same map φ. The sole self-citation to the authors’ earlier paper [1] is used for historical context, the definition of Schubert subspace codes, and recovery of the h=1 special case; it is not invoked as a uniqueness theorem or as a load-bearing premise for any new equality. No parameters are fitted, no ansatz is smuggled, and no claimed “prediction” reduces by construction to its own input. The acknowledged gap between sufficient and necessary conditions is stated as an open problem and does not create circularity.
Assumptions & free parameters
assumptions (3)
- standard math Beutelspacher’s lower bound on the size of a partial m-spread in F_q^n (Theorem 3.2).
- standard math Chromatic-number bounds for powers of q-Johnson graphs (Theorems 2.12–2.13, asymptotic Θ(q^{s max{k,n−k}})).
- domain assumption Existence of h-scattered F_q-subspaces of F_{q^k}^r of given dimension u (invoked for the field-reduction construction).
Cite this review
Pith. "Pith review of Combinatorial constructions of Schubert subspace codes." pith.science (2026). https://pith.science/paper/4W2VVPJB
@misc{pith2026260707479,
author = {Pith},
title = {Pith review of: Combinatorial constructions of Schubert subspace codes},
year = {2026},
howpublished = {\url{https://pith.science/paper/4W2VVPJB}},
note = {Machine review of arXiv:2607.07479}
}
abstract
We study Schubert subspace codes, which are constant-dimension subspace codes with prescribed intersection conditions with a fixed subspace. Our goal is to construct codes of maximum possible size in the extremal distance cases where a natural counting upper bound applies. We give two families of constructions. The first one uses a direct-sum decomposition of the ambient space, together with partial spreads and colorings of powers of $q$-Johnson graphs. For this construction, we also prove necessary conditions, which show how chromatic and clique obstructions arise. The second family is obtained by field reduction from evasive and scattered subspaces over extension fields. This gives codes whose size can be computed exactly in the scattered case and recovers the only previously known construction as a special case.
Reference graph
Works this paper leans on
-
[1]
G. N. Alfarano, J. Rosenthal, and B. Toesca. Schubert subspace codes. J. Algebra Appl. , 24(13n14):2541006, 2025
work page 2025
-
[2]
D. Bartoli, B. Csajb´ ok, G. Marino, and R. Trombetti. Evasive subspaces.J. Comb. Des. , 29(8):533–551, 2021
work page 2021
-
[3]
A. Beutelspacher. Partial spreads in finite projective spaces and partial designs. Math. Z. , 145(3):211–229, 1975
work page 1975
-
[4]
A. Blokhuis and M. Lavrauw. Scattered spaces with respect to a spread in PG(n, q). Geom. Dedicata, 81(1):231– 243, 2000
work page 2000
-
[5]
R. L. Brooks. On colouring the nodes of a network. Math. Proc. Camb. Philos. Soc. , 37(2):194–197, 1941
work page 1941
-
[6]
A. E. Brouwer, A. M. Cohen, and A. Neumaier. Distance-regular graphs. Springer, 1989
work page 1989
-
[7]
B. Csajb´ ok, G. Marino, O. Polverino, and F. Zullo. Generalising the scattered property of subspaces. Combi- natorica, 41(2):237–262, 2021
work page 2021
-
[8]
J. D’haeseleer, F. Pavese, P. Santonastaso, and V. Taranchuk. Chromatic number of Grassmann graphs and MRD codes. arXiv preprint arXiv:2602.10777 , 2026
Show all 21 references
-
[9]
D’haeseleer and V
J. D’haeseleer and V. Taranchuk. On the chromatic number of Grassmann graphs. Linear Algebra Its Appl. , 2026
2026
-
[10]
Etzion and N
T. Etzion and N. Silberstein. Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams. IEEE Trans. Inf. Theory , 55(7):2909–2919, 2009
2009
-
[11]
W. Fulton. Young tableaux: with applications to representation theory and geometry . Number 35 in London Mathematical Society Student Texts. Cambridge University Press, 1997
1997
-
[12]
S. R. Ghorpade and G. Lachaud. Higher weights of Grassmann codes. In Coding Theory, Cryptography and Related Areas: Proceedings of an International Conference on Coding Theory, Cryptography and Related Areas, held in Guanajuato, Mexico, in April 1998 , pages 122–131. Springer, 2000
1998
-
[13]
Gorla, F
E. Gorla, F. Manganiello, and J. Rosenthal. An algebraic approach for decoding spread codes. Adv. in Math. of Commun. , 6(4):443–466, 2012
2012
-
[14]
Heinlein, M
D. Heinlein, M. Kiermaier, S. Kurz, and A. Wassermann. Tables of subspace codes. arXiv preprint arXiv:1601.02864, 2016
2016 arXiv
-
[15]
Heinlein and S
D. Heinlein and S. Kurz. Coset construction for subspace codes. IEEE Trans. Inf. Theory , 63(12):7651–7660, 2017
2017
-
[16]
W. V. D. Hodge and D. Pedoe. Methods of algebraic geometry , volume 2. Cambridge University Press, 1947
1947
-
[17]
Horlemann-Trautmann and J
A.-L. Horlemann-Trautmann and J. Rosenthal. Constructions of constant dimension codes. Network Coding and Subspace Designs , pages 25–42, 2018
2018
-
[18]
Koetter and F
R. Koetter and F. R. Kschischang. Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory, 54(8):3579–3591, 2008
2008
-
[19]
S. Kurz. Constructions and bounds for subspace codes. arXiv preprint arXiv:2112.11766 , 2021
2021
-
[20]
Manganiello, E
F. Manganiello, E. Gorla, and J. Rosenthal. Spread codes and spread decoding in network coding. In IEEE Int. Symp. Inf. Theory - Proc. 2008 , pages 851–855, Toronto, Canada, 2008
2008
-
[21]
B. Segre. Teoria di Galois, fibrazioni proiettive e geometrie non desarguesiane. Ann. Mat. Pura Appl. , 64(1):1– 76, 1964
1964
Reviewed July 10, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.