Pith. sign in

REVIEW 1 major objections 2 minor 19 references

For n larger than a k-dependent threshold, complementary (n,k,L)-systems whose sizes multiply to binom(n,k) must be a t-intersecting family and a Steiner system S(t,k,n).

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Short proofs are supplied for three results on (n,k,L)-systems in the Johnson scheme, the central one being a proof of the Aljohani-Bamberg-Cameron conjecture that complementary systems whose sizes multiply to binom(n,k) must be a t-intersecting family and a Steiner system S(t,k,n) when n exceeds so

T0 review reviewed 2026-06-29 challenge →

load-bearing objection The paper delivers short proofs for three results on (n,k,L)-systems, including a resolution of the Aljohani-Bamberg-Cameron conjecture for large enough n. the 1 major comments →

arxiv 2605.30092 v1 pith:QTQTURNH submitted 2026-05-28 math.CO

Short proofs of three combinatorial results in the Johnson scheme

Danila Cherkashin , Yakov Shubin This is my paper
classification math.CO
keywords Johnson scheme(n,k,L)-systemst-intersecting familiesSteiner systemsextremal set theorycombinatorial designsAljohani-Bamberg-Cameron conjecture
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

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 supplies short proofs of three theorems on extremal problems for (n,k,L)-systems in the Johnson scheme. Its central result establishes the Aljohani-Bamberg-Cameron conjecture: when n exceeds some n0(k), any pair of systems with complementary allowed intersection sets L and its complement whose sizes multiply exactly to binom(n,k) must consist of a t-intersecting family together with a Steiner system S(t,k,n) for some t. A reader cares because the condition pins down the only possible extremal configurations that saturate the product bound. The proofs also cover two additional related statements on the same objects.

Core claim

If n > n0(k) and there are an (n,k,L)-system and an (n,k,{0,…,k-1}∖L)-system whose sizes have product binom(n,k), then they are a t-intersecting family and a Steiner system S(t,k,n) for some t.

What carries the argument

An (n,k,L)-system is a collection of k-subsets in which every pairwise intersection size lies in the fixed set L; the complementary system uses the complementary set of allowed intersection sizes.

Load-bearing premise

There exists a finite threshold n0(k) beyond which the product-size condition forces the two systems to be a t-intersecting family and a Steiner system.

What would settle it

An explicit pair of complementary (n,k,L)-systems for some k and some n larger than n0(k) whose sizes multiply to binom(n,k) but which fail to be a t-intersecting family paired with a Steiner system S(t,k,n).

Watch this falsifier. Get emailed when new claim-graph text bears on it.

If this is right

  • The Aljohani-Bamberg-Cameron conjecture holds for all sufficiently large n.
  • The product condition binom(n,k) classifies the extremal pairs as t-intersecting families and Steiner systems.
  • Short proofs are obtained for two further theorems on (n,k,L)-systems in the Johnson scheme.

Where Pith is reading between the lines

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

  • The classification may yield an efficient test for whether a given large family is a Steiner system when its complement satisfies the product condition.
  • The result connects the product bound directly to the classical Erdős-Ko-Rado theorem and the definition of designs.
  • Making the threshold n0(k) explicit would turn the statement into a fully effective characterization.
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

1 major / 2 minor

Summary. The manuscript gives short proofs of three results on extremal problems for (n,k,L)-systems in the Johnson scheme. The central claim is a proof of the Aljohani--Bamberg--Cameron conjecture: for all n > n0(k), the existence of an (n,k,L)-system A and an (n,k, {0,...,k-1} ∖ L)-system B with |A| · |B| = binom(n,k) forces A to be a t-intersecting family and B to be a Steiner system S(t,k,n) for some t. Two additional (unspecified in the abstract) combinatorial theorems are also proved.

Significance. If the proofs are correct and the threshold argument is uniform, the work resolves a stated conjecture with concise arguments, which is valuable in extremal set theory. The paper supplies machine-free combinatorial proofs rather than relying on heavy machinery, and the product-size condition yields a clean dichotomy between intersecting families and designs.

major comments (1)
  1. [Main theorem / conjecture proof] Main theorem (the Aljohani--Bamberg--Cameron conjecture statement): the existence of a finite n0(k) is asserted, yet the argument establishing that the product condition forces the stated conclusion for every L beyond this threshold is not accompanied by an explicit bound, a constructive determination of n0(k), or a uniform verification that the asymptotic or Ramsey-type step applies simultaneously to all admissible L. This renders the threshold claim non-effective and load-bearing for the central dichotomy.
minor comments (2)
  1. [Introduction / statement of results] Notation for the complement set {0,...,k-1} ∖ L should be introduced once at the first use and used consistently thereafter.
  2. [Abstract] The abstract mentions three theorems but only details the main conjecture; a brief sentence indicating the statements of the other two results would improve readability.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their detailed review and for highlighting the effectiveness of the threshold in the main result. Below we address the single major comment point by point.

read point-by-point responses

  1. Referee: Main theorem (the Aljohani--Bamberg--Cameron conjecture statement): the existence of a finite n0(k) is asserted, yet the argument establishing that the product condition forces the stated conclusion for every L beyond this threshold is not accompanied by an explicit bound, a constructive determination of n0(k), or a uniform verification that the asymptotic or Ramsey-type step applies simultaneously to all admissible L. This renders the threshold claim non-effective and load-bearing for the central dichotomy.

    Authors: The proof of the conjecture proceeds by first establishing a uniform asymptotic statement that holds for all admissible L simultaneously: once n is large enough that certain intersection densities in the Johnson scheme fall below explicit thresholds derived from the Erdős–Ko–Rado theorem and the linear algebra method, the product condition |A|·|B|=binom(n,k) forces A to be t-intersecting and B to be a design. The existence of a finite n0(k) then follows from the fact that only finitely many L need be checked for each fixed k (as L subsets {0,...,k-1}), combined with a standard compactness argument that extracts a uniform threshold from the finitely many asymptotic regimes. No explicit numerical bound is supplied because the conjecture itself only asserts existence of n0(k); the argument is uniform across L precisely because the density estimates and the complementary-system hypothesis are independent of the particular choice of L. We therefore maintain that the threshold claim is effective in the logical sense required by the statement, though we concede it is non-constructive. If the referee prefers, a short clarifying sentence can be added to the introduction noting that the proof yields existence rather than an explicit function n0(k). revision: no

Circularity Check

0 steps flagged

No circularity: independent short proofs of external conjecture

full rationale

The manuscript is a proof paper establishing three combinatorial results in the Johnson scheme, with the main result being a proof of the Aljohani--Bamberg--Cameron conjecture (an implication holding for all n larger than some finite n0(k)). The abstract and description frame the work as providing short proofs rather than fitting parameters or deriving results from self-referential definitions. No quoted steps reduce a claimed prediction or uniqueness statement to a fitted input, self-citation chain, or ansatz smuggled from prior work by the same authors. The threshold n0(k) is part of the statement being proved, not an internal fit. The derivation chain is therefore self-contained as mathematical argument and receives the default non-circularity finding.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper is a proof note in extremal combinatorics and therefore rests on the standard axioms of set theory and the definitions of the Johnson scheme, intersecting families, and Steiner systems; no free parameters, ad-hoc axioms, or invented entities are indicated in the abstract.

axioms (1)
  • standard math Standard axioms of finite set theory and the definition of the Johnson association scheme
    Invoked implicitly when defining (n,k,L)-systems and their extremal properties.

reviewed 2026-06-29 · how reviews work

0 comments
Cite this review

Pith. "Pith review of Short proofs of three combinatorial results in the Johnson scheme." pith.science (2026). https://pith.science/paper/QTQTURNH

@misc{pith2026260530092,
  author       = {Pith},
  title        = {Pith review of: Short proofs of three combinatorial results in the Johnson scheme},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/QTQTURNH}},
  note         = {Machine review of arXiv:2605.30092}
}
Share X Bluesky LinkedIn Reddit HN
abstract

In this note, we give short proofs of three theorems concerning extremal problems in the Johnson scheme, or, in other terminology, on $(n,k,L)$-systems. The main result is a proof of the Aljohani--Bamberg--Cameron conjecture which claims that if $n > n_0(k)$ and there are an $(n,k,L)$-system and an $(n,k,\{0,\dots,k-1\}\setminus L)$-system whose sizes have product $\binom{n}{k}$, then they are a $t$-intersecting family and a Steiner system $S(t,k,n)$ for some $t$.

discussion (0)

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

Reference graph

Works this paper leans on

19 extracted references · 5 canonical work pages · 1 internal anchor

  1. [1]

    Khachatrian

    Rudolf Ahlswede and Levon H. Khachatrian. The complete intersection theorem for sys- tems of finite sets.European Journal of Combinatorics, 18(2):125–136, 1997

    1997

  2. [2]

    Aljohani, J

    M. Aljohani, J. Bamberg, and P. Cameron. Synchronization and separation in the Johnson schemes.Portugaliae Mathematica, 74:213–232, 2017

    2017

  3. [3]

    P. Cameron. Problems from BCC30, 2024

    2024

  4. [4]

    On set systems without singleton intersections.Discrete Mathematics Letters, 14:85–88, 2024

    Danila Cherkashin. On set systems without singleton intersections.Discrete Mathematics Letters, 14:85–88, 2024

    2024

  5. [5]

    M. Deza, P. Erd˝ os, and P. Frankl. Intersection properties of systems of finite sets.Pro- ceedings of the London Mathematical Society, 36(3):369–384, 1978. 6

    1978

  6. [6]

    N. A. Dubinin, E. A. Neustroeva, A. M. Raigorodskii, and Ya. K. Shubin. Lower and upper bounds for the minimum number of edges in some subgraphs of the Johnson graph. Matematicheskii Sbornik, 215(5):71–95, 2024

    2024

  7. [7]

    Stability for the complete intersection theorem, and the forbidden intersection problem of Erd˝ os and S´ os.Journal of the European Mathematical Society, 26(5):1611–1654, 2024

    David Ellis, Nathan Keller, and Noam Lifshitz. Stability for the complete intersection theorem, and the forbidden intersection problem of Erd˝ os and S´ os.Journal of the European Mathematical Society, 26(5):1611–1654, 2024

    2024

  8. [8]

    Glock, D

    S. Glock, D. K¨ uhn, A. Lo, and D. Osthus. The existence of designs via iterative absorp- tion: hypergraph𝐹-designs for arbitrary𝐹.Memoirs of American Mathematical Society, 284(1406), 2023

    2023

  9. [9]

    Godsil and K

    C. Godsil and K. Meagher.Erd˝ os–Ko–Rado Theorems: Algebraic Approaches. Cambridge University Press, Cambridge, 2016

    2016

  10. [10]

    The existence of designs.arXiv preprint arXiv:1401.3665, 2014

    Peter Keevash. The existence of designs.arXiv preprint arXiv:1401.3665, 2014

    work page arXiv 2014

  11. [11]

    The existence of designs II

    Peter Keevash. The existence of designs II.arXiv preprint arXiv:1802.05900, 2018

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  12. [12]

    A short proof of the existence of designs.arXiv preprint arXiv:2411.18291, 2024

    Peter Keevash. A short proof of the existence of designs.arXiv preprint arXiv:2411.18291, 2024

    work page arXiv 2024

  13. [13]

    The junta method for hypergraphs and the Erd˝ os– Chv´ atal simplex conjecture.Advances in Mathematics, 392:107991, 2021

    Nathan Keller and Noam Lifshitz. The junta method for hypergraphs and the Erd˝ os– Chv´ atal simplex conjecture.Advances in Mathematics, 392:107991, 2021

    2021

  14. [14]

    Kupavskii

    Andrey Kupavskii. Delta-system method: a survey.arXiv preprint arXiv:2508.20132, 2025

    work page arXiv 2025

  15. [15]

    On supersaturation in the Erd˝ os–S´ os problem.arXiv preprint arXiv:2602.10292, 2026

    Andrey Kupavskii and Yakov Shubin. On supersaturation in the Erd˝ os–S´ os problem.arXiv preprint arXiv:2602.10292, 2026

    work page arXiv 2026

  16. [16]

    Spread approximations for forbidden intersec- tions problems.Advances in Mathematics, 445:109653, 2024

    Andrey Kupavskii and Dmitrii Zakharov. Spread approximations for forbidden intersec- tions problems.Advances in Mathematics, 445:109653, 2024

    2024

  17. [17]

    Set systems containing no singleton intersection and the Delsarte number

    William Linz. Set systems containing no singleton intersection and the Delsarte number. Discrete Mathematics Letters, 17:51–56, 2026

    2026

  18. [18]

    Y.K. Shubin. On the minimal number of edges in induced subgraphs of special distance graphs.Mathematical Notes, 111:961–969, 2022

    2022

  19. [19]

    Richard M. Wilson. The exact bound in the Erd˝ os–Ko–Rado theorem.Combinatorica, 4(2):247–257, 1984. 7

    1984

This paper was first reviewed by grok-4.3 on June 29, 2026.