The powers-of-sets containment conjecture

Let dd be a positive integer and let δ>0\delta>0. For a finite set, density means cardinality divided by the cardinality of the ambient set. The notation [n]d[n]^d denotes the dd-fold Cartesian product of [n][n], and P([n]d)\mathcal{P}([n]^d) denotes its power set. The powers-of-sets containment conjecture. For nn sufficiently large depending only on dd and δ\delta, every subset AP([n]d)\mathcal{A}\subseteq\mathcal{P}([n]^d) of density at least δ\delta contains distinct subsets A,B[n]dA,B\subseteq[n]^d such that ABA\subset B and

BA=SdB\setminus A=S^d

for some subset S[n]S\subset[n]. This is the opposite-end specialization of the preceding conjecture when k=2k=2; the source presents it as a remaining conjecture, so its general status is open.

Sources & referencesView supporting material

Primary source

Thomas Karam, “Unions of intervals in codes based on powers of sets”, arXiv:2408.15144 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.