Tikhon

October 22, 2025

Michaël, the papers you consider in the proof are not mustard watch ones. If a paper builds on a combination of $k$ classical papers, then it should be called a "mustard_{k-1} ... mustard_1 watch paper" where $(mustard_i)_{i<ω}$ is a sequence of randomly chosen objects. (Let $mustard_0 := watch$ for the sake of uniformity.)

Michaël

May 15, 2025

Following discussions with Guillermo, we may have a proof for a statement that would contradict your Fact. *Fact'.* For every $n$ classical papers, there are $O(2^n)$ mustard watch papers. *Proof.* For any finite set $X$ of classical papers and any subset $Y \subseteq X$, a mustard watch paper can be obtained by combining the papers in $Y$. Moreover, two different subsets lead to two different mustard watch papers. Hence, the number of mustard watch papers obtained from a set of size $n$ is the number of subsets of this set, that is, $2^n$.

Guillermo

May 13, 2025

Define “classical” :D