Pith. sign in

REVIEW 1 major objections 3 minor 2 cited by

A short proof of the existence of designs

T0 review · 1 major / 3 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read The paper gives a fourth, much shorter proof that every divisible complete r-uniform hypergraph has a decomposition into q-cliques for large n, with a logarithmic bound on the threshold.

desk verdict Clean short proof of design existence, but a real gap in Lemma 6.3(4) when q−r > r; worth refereeing with that point in mind. read the letter →

arxiv 2411.18291 v1 pith:V37BVJLN submitted 2024-11-27 math.CO

Peter Keevash This is my paper · ORCID
classification math.CO MSC 05B0505C6505D40
keywords designtheorySteinersystemshypergraphdecompositionsabsorptionmethodcliqueexchangerandomgreedyalgorithmnibbleexistenceconjecture
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 claims a new proof of a classical existence theorem: for every $q>r\ge 1$, once $n$ is large enough, the complete $r$-graph $K_r^n$ can be partitioned into copies of $K_q^r$, which is the same as a Steiner system (a set of $q$-subsets containing every $r$-subset exactly once), whenever the necessary divisibility conditions hold. The proof is intended to be self-contained and much shorter than the three earlier proofs, and it improves the quantitative threshold to $\log n_0 = O(k^2 q^{r+1}\log q)$, where $k=\binom{q}{r}$. The main novelty is a small clique-exchange gadget that makes the absorber, the traditionally hard ingredient, easy to build through a few randomized cleaning steps. If the proof is right, the existence of Steiner systems gets a fourth independent route with the best known bound on $n_0$.

What carries the argument

The load-bearing object is the clique-exchange configuration $\Omega$ of Lemma 3.1: an $r$-graph made by gluing copies of a $p$-blowup of $K_q^r$, with two $K_q^r$-decompositions $\Upsilon^+$ and $\Upsilon^-$ and designated cliques $\hat{Q}^+$ and $\hat{Q}_e$ such that each $\hat{Q}_e$ meets $\hat{Q}^+$ in exactly one edge $e$. Its decisive property (ii) is that any edge of $\Omega$ touching the union $F$ of the designated cliques is contained in $\hat{Q}^+$ or in one $\hat{Q}_e$; this admissibility is exactly what lets the random-greedy splitting, elimination, and further-elimination steps run. The two decompositions come from Vandermonde matrices over $\mathbb{F}_p$, which give a unique clique through each edge. Applying the gadget repeatedly converts a signed collection of cliques with arbitrary multiplicities into one with controlled edge multiplicities, and the absorber sets $A=\bigcup \mathcal{Q}^-$ equal to the negative cliques produced by this process.

What would settle it

Enumerate the gadget produced by the gluing in Lemma 3.1 for $q=3,r=2$ with $p=3$ and check property (ii) edge by edge: if any edge $e'$ of $\Omega$ meets the union $F$ of the designated cliques in a set not contained in $V(\hat{Q}^+)$ or in some $V(\hat{Q}_e)$, the absorber construction cannot be run. This is a finite computation, so it settles the structural premise independently of the rest of the proof.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.1: for all $q>r\ge 1$, $K_r^n$ has a $K_q^r$-decomposition whenever $K_r^n$ is $K_q^r$-divisible, provided $n\ge n_0(q,r)$. The proof organizes the decomposition into five steps: reserve, absorber, regularity boost, nibble, and cover, and its contribution is a considerably simpler construction of the absorber. The absorber is built from a new configuration $\Omega$ with two $K_q^r$-decompositions, which is used to transform an integral decomposition of a sparse divisible leave $L\subseteq R$ into a signed decomposition whose positive and negative cliques are separated. The same construction supports the regularity boost and the cover step, and the quantitative section shows $\log n_0 = O(k^2 q^{r+1}\log q)$.

Load-bearing premise

The proof hinges on one structural property of its small building block: any edge of the block that touches the central designated cliques must be wholly contained in one of those cliques, since otherwise the random-greedy filling steps could get stuck.

Editorial extensions

If this is right

  • The existence conjecture for Steiner systems holds for every $q>r\ge 1$ with a threshold satisfying $\log n_0 = O(k^2 q^{r+1}\log q)$, so the qualitative theorem now comes with an explicit, though large, bound.
  • The proof's five-step skeleton transfers to the more general decomposition problems the author sketches, such as replacing the host $K_r^n$ by a typical $r$-multigraph and the guest $K_q^r$ by a general $r$-graph.
  • Because the absorber is edge-disjoint from the reserve and absorbs every $K_q^r$-divisible subgraph of the reserve, divisibility alone remains sufficient for the final decomposition.
  • The paper's Remark 7.1 shows the usual degree-divisibility conditions are equivalent to $K_q^r$-divisibility, so the statement of Theorem 1.1 matches the classical formulation of Steiner system existence.
  • The clique-removal analysis proves a stronger nibble bound, with a leave of boundedness exponent $-\varepsilon/3k$, than standard semi-random arguments, and this is what allows the sparse reserve to cover the leftover edges.

Reading between the lines

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

  • Beyond the paper, the fixed finite size of the clique-exchange gadget suggests the absorber construction should work for any host hypergraph that is pseudorandom enough to support the random-greedy steps, so the same proof may give $F$-design decompositions in typical graphs, not only in $K_r^n$.
  • The quantitative bottleneck is the gadget size $|\Omega|\le 3(2q)^r k^2$; if a smaller or more efficient gadget can be built, the threshold bound $\log n_0$ would improve directly, since the paper's remaining inequalities are weaker.
  • A direct check of Lemma 3.1 for small parameters, say $q=3,r=2$, would independently confirm the structural premise of the whole absorber, because the construction is explicit enough to be computer-verified.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

1 major / 3 minor

Summary. The paper gives a new proof of Theorem 1.1, the existence of K_q^r-decompositions of K_r^n under the necessary divisibility condition, with a claimed bound log n0 = O(k^2 q^{r+1} log q). The proof follows the absorption framework: it reserves a sparse random subgraph, constructs an omni-absorber via a new clique-exchange gadget Ω, boosts regularity of the remaining graph, covers the leave by the reserve, and decomposes the absorber plus leave. Most of the paper is devoted to proving the auxiliary lemmas in a self-contained way, including Chernoff/Freedman concentration, local decoders, random greedy extension processes, the integral absorber via coloured random permutations, and the clique removal process for the nibble step.

Significance. If correct, this would be a fourth and substantially shorter proof of the existence conjecture, with the best explicit bound on n0, and it would make the whole argument self-contained rather than relying on previous iterative-absorption papers. The paper is well structured and gives full proofs of the supporting tools, and the parameter bookkeeping is explicit. However, the proof of Lemma 6.3(4) has a load-bearing gap that is not merely cosmetic; until that lemma is repaired, the integral absorber Lemma 6.1 and hence the main theorem are not established by the text.

major comments (1)
  1. [§6.3, proof of Lemma 6.3(4)] The second-moment estimate in the proof of Lemma 6.3(4) is not justified as written. The proof splits pairs of extensions according to s = |V(Qhat')∩F| and treats only the cases s < r and s = r. But in the configuration Ω of Lemma 3.1, when q > 2r there are retained plus cliques Qhat' = Mw with w = (1,0,...,0) in the same Ω0-copy as a designated minus clique Qhat_e; these satisfy |V(Qhat')∩V(Qhat_e)| = q−r > r, hence |V(Qhat')∩F| > r. For such a clique, two extensions that agree on F share C(q−r,r) edges of the colour copy, so the probability that both are monochromatic in the same colour is about n^{−α(2k−C(q−r,r))}, not n^{−2kα}; this introduces a factor n^{α C(q−r,r)} into EX². The claimed bound EX² ≤ (1+8|Ω|n^{−0.1α})(EX)² is therefore unsupported, and Chebyshev no longer gives the polynomial concentration on which the subsequent union bound and the '20qα^{−1} disjoint colour sets' amplification depend. A similar, milder discrepancy already appears in the s = r case, where the shared edge contributes a factor n^α. Since Lemma 6.3(4) is the step in §6.5 that replaces arbitrary rainbow cliques by monochromatic unsaturated cliques, the proof of Lemma 6.1, and hence of the absorber Lemma 2.2 and Theorem 1.1, is incomplete as written. A repair would require either a different Ω construction avoiding cliques with large intersection with F, or a genuinely different second-moment argument.
minor comments (3)
  1. [§3.3] In the definitions of Υ±_0, the parameter vector should be u ∈ F_p^r, since M is a q×r matrix; the text writes u ∈ F_p^q in two places.
  2. [Abstract] The abstract contains the typo 's horter' instead of 'shorter'.
  3. [§6.3, proof of Lemma 6.3(4)] The quantity M is introduced as 'there are M < 2|Ω|/k such Qhat''; it would be clearer to define M explicitly as the number of non-special cliques Qhat' in Υ±, since the second-moment product is taken over this set.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the proof is self-contained and reduces Theorem 1.1 to independently established probabilistic and algebraic lemmas.

full rationale

The paper's derivation chain is not circular. Theorem 1.1 is proved from Lemmas 2.1–2.5, and each of those lemmas is proved in later sections from stated concentration inequalities, typicality estimates, and explicit constructions. The absorber construction does rely on the clique-exchange configuration Omega, but the existence and admissibility of Omega are proved from scratch in Lemma 3.1 by an explicit blow-up and gluing argument, not imported as an unproved assumption or as a renamed version of the theorem. The integral absorber uses methodology adapted from the author's prior paper [6] and states this explicitly, but the needed result, Lemma 6.1, is proved in the present paper with full details. Similarly, Wilson's local decoder is cited but also proved in Section 7. The paper does cite earlier existence proofs for context, but its central claim does not reduce to those citations; it presents independent, self-contained arguments. The skeptical concern about Lemma 6.3(4) is a potential mathematical gap or error in the second-moment estimate, not a circular relationship between input and output, so it does not affect the circularity score.

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

The proof is fully self-contained. The only background used is standard combinatorics and probability; the constants rho, alpha and n0 are chosen symbolically to satisfy inequalities, not fitted to data. No new entities are postulated; the absorber and clique exchanges are explicitly constructed.

assumptions (4)
  • standard math Bertrand's postulate: for every integer q >= 2 there is a prime p with q <= p <= 2q.
    Used in Lemma 3.1 to choose p in [q,2q] for the blow-up construction of Omega.
  • standard math Standard Chernoff bounds and Freedman's martingale concentration inequality.
    Used throughout; the paper includes a proof of the needed Chernoff-type bounds in Section 8 via Lemma 8.2.
  • standard math Linear algebra over Z and over Gamma = Z/NZ, including the fact that a chain of subgroups in Gamma^K has length at most N|K|.
    Used in Lemma 6.2 to bound the size of the generating set G by the subgroup chain length.
  • standard math Wilson's characterization of K_q^r-divisibility by degree divisibility conditions.
    Proved in Remark 7.1 following Wilson [7] and used to connect the decomposition statement to the classical Steiner system formulation.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A short proof of the existence of designs." pith.science (2026). https://pith.science/paper/V37BVJLN

@misc{pith2026241118291,
  author       = {Pith},
  title        = {Pith review of: A short proof of the existence of designs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/V37BVJLN}},
  note         = {Machine review of arXiv:2411.18291}
}
read the original abstract

We give a new proof of the existence of designs, which is much shorter and gives better bounds.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Erd\H{o}s meets Nash-Williams

    math.CO 2025-07 conditional novelty 8.0 of 10

    Every sufficiently large triangle-divisible graph with minimum degree at least (7+√21)/14 + epsilon has a triangle decomposition with arbitrarily large girth.

  2. A congruence obstruction to Roman's bound for Zarankiewicz numbers

    math.CO 2026-08 conditional novelty 7.0 of 10

    A congruence argument shows Roman's bound is not tight on a long interval below the design threshold, with exact values in a special case.

Reference graph

Works this paper leans on

7 extracted references · 4 canonical work pages · cited by 2 Pith papers

  1. [1]

    A natural barrier in random greedy hypergraph matching

    P. Bennett and T. Bohman, A natural barrier in random greedy h ypergraph matching, arXiv:1210.3581, Com- bin. Probab. Comput. 28:816–825 (2019)

    work page Pith review arXiv 2019

  2. [2]

    Delcourt and L

    M. Delcourt and L. Postle, Refined absorption: a new proof of th e existence conjecture, arXiv:2402.17855

    arXiv

  3. [3]

    D. A. Freedman, On tail probabilities for martingales, Ann. Probab. 3:100–118 (1975)

    work page 1975

  4. [4]

    Glock, D

    S. Glock, D. K¨ uhn, A. Lo and D. Osthus, The existence of design s via iterative absorption: hypergraph F -designs for arbitrary F , arXiv:1611.06827 and arXiv:1706.01800, Mem. Amer. Math. Soc. 284 (2023)

    arXiv 2023

  5. [5]

    Keevash, The existence of designs, arXiv:1401.3665

    P. Keevash, The existence of designs, arXiv:1401.3665

    arXiv

  6. [6]

    The existence of subspace designs

    P. Keevash, A. Sah and M. Sawhney, The existence of subspace designs, arXiv:2212.00870

    work page Pith review arXiv

  7. [7]

    R. M. Wilson, The necessary conditions for t-designs are sufficien t for something, Utilitas Math. 4:207–215 (1973). 17

    work page 1973

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.