The discrepancy of greater-than

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

Srikanth Srinivasan , Amir Yehudayoff This is my paper · ORCID

classification cs.CCmath.CO

keywords discrepancygreater-thanfraclowermatrixordertermstimes

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

abstract

The discrepancy of the $n \times n$ greater-than matrix is shown to be $\frac{\pi}{2 \ln n}$ up to lower order terms.

Forward citations

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

Equality is Far Weaker than Constant-Cost Communication
cs.CC 2025-07 conditional novelty 7.0 of 10

There is a communication problem with constant randomized cost that requires Ω(√n) deterministic queries to an Equality oracle, so constant-cost randomness cannot be efficiently derandomized by equality checks.
Block structure in boolean matrices of bounded factorization norm
math.CA 2025-07 conditional novelty 6.0 of 10

A boolean matrix with gamma-2 norm at most lambda contains a blocky submatrix that covers at least a 1/2^{2^{O(lambda)}} fraction of its 1-entries.