子立方体抑制
Subcube Stifling
AI总结:
介绍子立方体抑制数这一布尔函数新组合度量,证明其引出近似度合成定理,给出随机布尔函数、线性码指标函数的子立方体抑制数结果,探讨是否存在近似度为Θ(√μ(f))的布尔函数。
摘要:
我们引入子立方体抑制数,一种布尔函数的新组合度量。它是最大整数k,对于至多k个输入变量的集合S及赋值b∈{0,1}^S,能固定S外变量使S上函数为点指示函数。我们给出相关结果并探讨是否存在近似度为Θ(√μ(f))的布尔函数。
英文摘要:
We introduce the subcube stifling number, a new combinatorial measure of total Boolean functions. This measure is the largest integer $k$ such that, for every set $S$ of at most $k$ input variables and every assignment $b \in \{0,1\}^S$, there is a fixing of the variables outside $S$ under which the resulting function on the free variables $S$ is the point indicator $\mathbb{I}[x_S=b]$. Equivalently, for every small set of coordinates, the function can isolate any prescribed point of the corresponding Boolean cube by suitably fixing all remaining coordinates. This measure is inspired by the stifling number of Chattopadhyay et al.~(ITCS'23); whereas their measure asks for restrictions realizing every constant function, ours asks for restrictions realizing every point indicator. Our results are as follows. 1) We show that the subcube stifling number gives rise to an approximate-degree composition theorem. In particular, if a Boolean function $f$ has approximate degree $O(\sqrt{μ(f)})$, then for every Boolean function $g$, approximate degree composes tightly. This motivates the study of the subcube stifling number, and in particular the search for functions whose approximate degree is $O(\sqrt{μ(f)})$. 2) We show that a random Boolean function on $n$ input bits has subcube stifling number $Θ(\log(n))$ with high probability. 3) We show that indicators of linear codes over $\mathbb{F}_2$ whose minimum distance and dual distance are both linear have high subcube stifling number. 4) We prove that the functions arising from this linear-code construction do not have approximate degree $O(\sqrt{μ(f)})$; in fact, they have approximate degree $Ω(μ(f))$. The main question left open is whether there exists a Boolean function $f$ with approximate degree $Θ(\sqrt{μ(f)})$. A positive answer would yield new instances of tight approximate-degree composition.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。