number-theory / Number Theory
Let $k\geq 3$ and $f_k(N)$ be the maximum of $\sum_{n\in A}\frac{1}{n}$ over all $A\subseteq\{1,\ldots,N\}$ containing no $k$ subsets with the same pairwise least common multiple. Estimate $f_k(N)$. The claimed answer: $f_k(N)=(\log N)^{\gamma_k+o(1)}$, where $\gamma_k$ is a weighted generalization of the Tang-Zhang sunflower capacity.
Temporal state
No reconciled state yet.
Append-only history
Identifies the exponent as a variational sunflower-capacity constant, sharpening the Tang-Zhang bounds; the value of that constant itself remains open, as does site acceptance
Research memory
Let $k\geq 3$ and $f_k(N)$ be the maximum of $\sum_{n\in A}\frac{1}{n}$ over all $A\subseteq\{1,\ldots,N\}$ containing no $k$ subsets with the same pairwise least common multiple. Estimate $f_k(N)$. The claimed answer: $f_k(N)=(\log N)^{\gamma_k+o(1)}$, where $\gamma_k$ is a weighted generalization of the Tang-Zhang sunflower capacity.
Identifies the exponent as a variational sunflower-capacity constant, sharpening the Tang-Zhang bounds; the value of that constant itself remains open, as does site acceptance
Evidence graph
No public relationships recorded yet.