TOPICS
Search

Sandglass Conjecture


The sandglass conjecture asserts that every recovering pair (A,B) of families of subsets of an n-element set satisfies

 |A||B|<=2^n.

The power sets of two complementary subsets give equality. Costa (2026) improved the known upper bound to (2.23949)^n, but the conjectured bound remains open.


See also

Power Set, Recovering Pair

Explore with Wolfram|Alpha

References

Costa, S. "An Improved Upper Bound for Recovering Pairs." 2 Oct 2026. https://arxiv.org/abs/2610.03851.

Cite this as:

Weisstein, Eric W. "Sandglass Conjecture." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/SandglassConjecture.html

Subject classifications