REVIEW
The sandglass conjecture beyond cancellative pairs
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
The sandglass conjecture beyond cancellative pairs
classification
math.CO
keywords
pairscancellativeconjecturerecoveringsandglassupperbarrierbest
read the original abstract
The sandglass conjecture, posed by Simonyi, states that if a pair $(A, B)$ of families of subsets of $[n]$ is recovering then $|A| |B| \leq 2^n$. We improve the best known upper bound to $|A| |B| \leq 2.2543^n$. To do this we overcome a significant barrier by exponentially separating the upper bounds on recovering pairs from cancellative pairs, a related notion.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.