The sandglass conjecture beyond cancellative pairs
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:VAICBANIrecord.jsonopen to challenge →
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.