2 problems

Matching

Additive-combinatorial formulation of the exactly- $N$ conjecture
Let $\rho^{\angle}_3(N)$ denote the maximum density of a three-variable corner-free subset in the additive-combinatorial setting used by the paper. Corner-free density conjecture.…
openadditive-combinatorics corner-free-sets
07
Subexponential NOF communication complexity conjecture for exactly- $N$
In the three-player number-on-forehead (NOF) model, let the exactly- $N$ problem be the task of determining whether the sum of the players' hidden inputs equals $N$ . Its communicati…
openadditive-combinatorics communication-complexity corner-free-sets
07

Additive-combinatorial formulation of the exactly-NNN conjecture