Average-case deterministic query complexity of boolean functions with fixed weight

We study the $\mathit{\text{average-case}}\mathit{\text{deterministic}}\mathit{\text{query}}\mathit{\text{complexity}}$ of boolean functions under a $\mathit{\text{uniform}}\mathit{\text{input}}\mathit{\text{distribution}}$, denoted by ${\mathrm{D}}_{\mathrm{a}\mathrm{v}\mathrm{e}}(f)$, the minimum average depth of zero-error decision trees that compute a boolean function $f$. This measure has found several applications across diverse fields, yet its understanding is limited. We study boolean functions with fixed weight, where weight is defined as the number of inputs on which the output is $1$. We prove ${\mathrm{D}}_{\mathrm{a}\mathrm{v}\mathrm{e}}(f)\le \max \{\log \frac{\mathrm{w}\mathrm{t}(f)}{\log n}+O(\log \log \frac{\mathrm{w}\mathrm{t}(f)}{\log n}),O(1)\}$ for every $n$-variable boolean function $f$, where $\mathrm{w}\mathrm{t}(f)$ denotes the weight. For any $4\log n\le m(n)\le 2^{n-1}$, we prove the upper bound is tight up to an additive logarithmic term for almost all $n$-variable boolean functions with fixed weight $\mathrm{w}\mathrm{t}(f)=m(n)$. Håstad’s switching lemma or Rossman’s switching lemma [Comput. Complexity Conf. 137, 2019] implies ${\mathrm{D}}_{\mathrm{a}\mathrm{v}\mathrm{e}}(f)\le n(1-\frac{1}{O(w)})$ or ${\mathrm{D}}_{\mathrm{a}\mathrm{v}\mathrm{e}}(f)\le n(1-\frac{1}{O(\log s)})$ for CNF/DNF formulas of width $w$ or size $s$, respectively. We show there exists a DNF formula of width $w$ and size $\lceil 2^w\mathrm{/}w\rceil$ such that ${\mathrm{D}}_{\mathrm{a}\mathrm{v}\mathrm{e}}(f)=n(1-\frac{\log n}{\mathrm{\Theta }(w)})$ for any $w\ge 2\log n$.