Pith. sign in

REVIEW 2 major objections 1 minor 12 references

A note on piercing discrete rectangles

T0 review · 2 major / 1 minor · reviewed 2026-07-13 · grok-4.5

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

Pith's one-line read Axis-parallel rectangles satisfying a discrete (p,2) condition can be pierced by O((p log log p)^2) points of a given set P, and by 4 points when p=2.

desk verdict Abstract claims a clean O((p log log p)^2) piercing bound for discrete rectangles under the (p,2) condition, but the supplied body is wholly unrelated AI-music/cortical-map text with zero proofs. read the letter →

arxiv 2604.04024 v2 pith:LH5RWJDY submitted 2026-04-05 math.CO

Wei Rao This is my paper · ORCID
classification math.CO MSC 52A3505D1052C10
keywords discreteHellytheorempiercingnumbersaxis-parallelrectangles(pq)theoremscombinatorialgeometryHelly-type
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 sharpens a discrete Helly-type theorem for axis-parallel rectangles in the plane. Given any point set P and any finite family of such rectangles that each contain at least one point of P, the hypothesis that every p of the rectangles contains a pair whose intersection also meets P already guarantees a piercing set of size O((p log log p)^2) drawn from P. When p equals 2 the same hypothesis yields a piercing set of size at most 4. The result improves earlier (p,q) bounds that were either restricted to larger q or carried substantially worse dependence on p, and shows that the classical continuous Helly number for rectangles can be replaced by a quantitatively controlled discrete piercing number under a weak pairwise condition.

What carries the argument

The discrete (p,2)-piercing condition for axis-parallel rectangles: every p-member subfamily contains a pair whose intersection still meets the ground set P, which is shown to force a small piercing subset of P.

What would settle it

An explicit family of axis-parallel rectangles and a finite point set P that satisfy the (p,2) condition yet require more than C(p log log p)^2 points of P to pierce all rectangles, for arbitrarily large p and any fixed constant C.

Watch

Extended reading notes

Core claim

For every integer p≥2, every set P of points in the plane, and every finite family of axis-parallel rectangles each meeting P, the combinatorial condition that among any p rectangles some two intersect in a point of P implies the existence of a subset S of P with |S|=O((p log log p)^2) that intersects every rectangle; when p=2 one may take |S|≤4.

Load-bearing premise

The argument relies on a combinatorial reduction that converts the (p,2) intersection hypothesis into an O((p log log p)^2) piercing set; if that reduction fails, the quantitative bound collapses.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 1 minor

Summary. The manuscript claims an improved discrete (p,2)-Helly-type piercing bound for axis-parallel rectangles in the plane: for any p ≥ 2, any point set P ⊆ ℝ^{2} and any finite family of axis-parallel rectangles each containing a point of P, the condition that every p rectangles contain two whose intersection meets P implies the existence of a piercing set S ⊆ P of size O((p log log p)^{2}); when p = 2 the bound improves to |S| ≤ 4. The abstract situates the result as a sharpening of Halman’s discrete Helly theorem and of subsequent (p,q) extensions by Edwards–Soberón and by Gangopadhyay–Polyanskii–author.

Significance. If the stated bound is correct it would be a concrete quantitative improvement for the planar (p,2) case of discrete piercing of axis-parallel rectangles, reducing the dependence on p relative to the general (p,q) theorems already in the literature. The special case |S| ≤ 4 for p = 2 is particularly clean. However, the supplied manuscript body contains none of the combinatorial arguments, so the claimed improvement cannot yet be credited as established.

major comments (2)
  1. The body of the manuscript (the only full-text material provided) consists entirely of unrelated material on TRIBE v∈ cortical surface maps, AI-generated music prompts T1–T5, and commercial music design. It contains no definitions, lemmas, proofs, or intermediate bounds for the discrete Helly-type claim. Consequently the central O((p log log p)^{2}) statement and the |S| ≤ 4 claim for p = 2 rest on an entirely absent combinatorial reduction; the load-bearing argument cannot be inspected or verified.
  2. Because no proof text is present, it is impossible to determine the origin of the log-log factor, the precise combinatorial tools employed (interval graphs, Davenport–Schinzel sequences, recursive projection piercing, etc.), or whether the reduction from the (p,2) condition to a piercing set of the claimed size is valid. The abstract alone is insufficient to support the result.
minor comments (1)
  1. The abstract is well-written and correctly situates the claimed result relative to Halman, Edwards–Soberón and the recent (p,q) work, but this does not compensate for the missing body.

Circularity Check

0 steps flagged · score 0.0 of 10

No derivation chain present in body; abstract combinatorial claim has zero text to inspect for circularity

full rationale

The supplied full manuscript body consists exclusively of garbled text on TRIBE v1 cortical surface predictions, AI-generated music prompts (T1–T5), Wubble tracks, and commercial music design discussion. It contains none of the definitions, lemmas, projections, interval graphs, Davenport–Schinzel sequences, recursive piercing arguments, or any other combinatorial steps that would be required to derive the claimed O((p log log p)^2) piercing bound (or the |S|≤4 case). Because no derivation chain exists in the provided text, no self-definitional step, fitted-input-as-prediction, load-bearing self-citation, uniqueness import, ansatz smuggling, or renaming of a known result can be exhibited by quotation. Circularity analysis therefore returns the empty finding: score 0 with no steps. (The mismatch between abstract and body is a completeness failure, not a circularity reduction.)

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

The claim is a pure existence bound in discrete geometry. It inherits the standard axioms of Euclidean plane geometry and the definition of axis-parallel rectangles; it also relies on the earlier discrete Helly theorems of Halman and the (p,q) extensions cited in the abstract. No free parameters or invented geometric objects are introduced in the abstract. Because the proof is absent, any additional combinatorial lemmas used as black boxes cannot be audited.

assumptions (2)
  • standard math Axis-parallel rectangles are products of intervals; intersection and containment are defined in the usual Euclidean way.
    Background geometry assumed throughout the statement.
  • domain assumption Halman’s discrete Helly theorem for axis-parallel boxes and the subsequent (p,q) extensions of Edwards–Soberón and Gangopadhyay–Polyanskii–Rao hold as stated.
    The abstract explicitly builds on these results; the new bound is presented as an improvement inside that framework.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A note on piercing discrete rectangles." pith.science (2026). https://pith.science/paper/LH5RWJDY

@misc{pith2026260404024,
  author       = {Pith},
  title        = {Pith review of: A note on piercing discrete rectangles},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/LH5RWJDY}},
  note         = {Machine review of arXiv:2604.04024}
}
abstract

In 2008, Halman proved a discrete Helly-type theorem for axis-parallel boxes in $\mathbb R^d$. Very recently, this result was extended to the $(p,q)$ setting with $p \geq q \geq d+1$ by Edwards and Sober\'on, and subsequently to the case $p \geq q \geq 2$ by Gangopadhyay, Polyanskii, and the author of this paper. In this paper, we obtain improved bounds for the $(p,q)$ problem in the case $q=2$ and $d=2$. More precisely, our main result asserts that for any integer $p \geq 2$, any set $P \subseteq \mathbb R^2$, and any finite family $\mathcal B$ of axis-parallel rectangles in $\mathbb R^2$ such that every rectangle contains a point of $P$, if among every $p$ rectangles there exist two whose intersection contains a point of $P$, then there exists a subset $S \subseteq P$ of size at most $O\!\bigl( (p \log \log p)^2 \bigr)$ such that every rectangle contains a point of $S$. Moreover, when $p=2$, the size of $S$ can be bounded by $4$.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

12 extracted references · 1 linked inside Pith

  1. [1]

    Piercing convex sets and the H adwiger- D ebrunner (p, q) -problem

    Noga Alon and Daniel J Kleitman. Piercing convex sets and the H adwiger- D ebrunner (p, q) -problem. Advances in Mathematics , 96(1):103--112, 1992

    1992

  2. [2]

    Fractional covers and matchings in families of weighted d -intervals

    Ron Aharoni, Tom \'a s Kaiser, and Shira Zerbib. Fractional covers and matchings in families of weighted d -intervals. Combinatorica , 37(4):555--572, 2017

    2017

  3. [3]

    Helly-type problems

    Imre B \'a r \'a ny and Gil Kalai. Helly-type problems. Bulletin of the American Mathematical Society , 59(4):471--502, 2022

    2022

  4. [4]

    Extensions of discrete H elly theorems for boxes

    Timothy Edwards and Pablo Sober \'o n. Extensions of discrete H elly theorems for boxes. SIAM Journal on Discrete Mathematics , 39(2):1349--1362, 2025. Available at https://arxiv.org/abs/2404.14308

    arXiv 2025

  5. [5]

    New H elly-type results for discrete boxes: Q uantitative colorful and (p, q) -variants

    Rahul Gangopadhyay, Alexander Polyanskii, and Wei Rao. New H elly-type results for discrete boxes: Q uantitative colorful and (p, q) -variants. arXiv preprint arXiv:2509.13115 , 2025

    arXiv 2025

  6. [6]

    Discrete and lexicographic H elly-type theorems

    Nir Halman. Discrete and lexicographic H elly-type theorems. Discrete & Computational Geometry , 39:690--719, 2008

    2008

  7. [7]

    U ber M engen konvexer K \

    Ed Helly. \"U ber M engen konvexer K \"o rper mit gemeinschaftlichen P unkte. Jahresbericht der Deutschen Mathematiker-Vereinigung , 32:175--176, 1923

    1923

  8. [8]

    Transversals of d -intervals

    Tom \'a s Kaiser. Transversals of d -intervals. Discrete & Computational Geometry , 18(2):195--203, 1997

    1997

Show all 12 references
  1. [9]

    A simple proof of KKMS theorem

    Hidetoshi Komiya. A simple proof of KKMS theorem. Economic Theory , pages 463--466, 1994

    1994

  2. [10]

    Tight lower bounds for the size of epsilon-nets

    J \'a nos Pach and G \'a bor Tardos. Tight lower bounds for the size of epsilon-nets. In Proceedings of the twenty-seventh annual symposium on Computational geometry , pages 458--463, 2011

    2011

  3. [11]

    On a Problem of Formal Logic

    Frank Plumpton Ramsey. On a Problem of Formal Logic . Proceedings of the London Mathematical Society , 2(1):264--286, 1930

    1930

  4. [12]

    Lower bounds for piercing and coloring boxes

    Istv \'a n Tomon. Lower bounds for piercing and coloring boxes. Advances in Mathematics , 435:109360, 2023

    2023

Pith tools

Reviewed July 13, 2026 · model on record in the stance chip above.