AI 中文总结
该研究在非均匀AC⁰中证明k-OV、k-XOR和k-SUM的细粒度下界，给出着色子图同构到三者的零深度投影，获不同深度下的无条件下界，分析上下界差距并提出奇k到偶k的黑盒提升方法。
AI 中文摘要
我们在非均匀AC⁰中证明了k-OV、k-XOR和k-SUM的下界，追踪电路规模指数随k的缩放情况，且未使用任何运行时间假设。我们的框架在维度、行数或位宽为O(k log n)时，给出从着色子图同构到这三个目标的零深度投影，不增加深度或规模，且保留门的方向。对于每个固定深度和足够大的固定k，我们得到k-OV的无条件下界为n^Ω(k)，k-XOR和k-SUM的无条件下界为(n/k)^Ω(k)，其绝对指数速率常数与k和深度均无关，而阈值可能依赖于(d,k)。对于增长的k = n^(o(1))，对于每个固定深度d，我们得到无条件下界为n^Ω_d(min{√k, log n})，这在深度为2时对于两种顶部门方向（即顶部合取和顶部析取）均加强为n^Ω(k)。假设对Li-Razborov-Rossman源下界的模式均匀加强，相同的投影在深度为3时对于两种方向以及每个固定深度d≥4，均完成子多项式前沿的n^Ω_d(k)下界。上述所有直接k-XOR下界均针对奇数k；通过黑盒奇到偶提升，可通过提供的可容许参数分解传递任何此类下界。k-SUM投影适用于两种奇偶性。在我们投影所用的位宽m = Θ(k log(en/k))处，大小为(n/k)^O(k)的块进位Σ₃上界，与顶部析取深度3下界(n/k)^Ω(k)的固定k特化在指数常数上匹配。剩余的上界与下界差距涉及深度2、顶部合取深度3以及其他宽度 regime。
英文摘要
We prove lower bounds for $k$-OV, $k$-XOR, and $k$-SUM in nonuniform $\mathrm{AC}^0$, tracking how the circuit-size exponent scales with $k$ and using no running-time hypothesis. Our framework gives depth-zero projections from colored subgraph isomorphism to the three targets at dimension, row count, or bit width $O(k \log n)$, without increasing depth or size, and preserving gate orientation. For every fixed depth and sufficiently large fixed $k$, we obtain unconditional bounds $n^{Ω(k)}$ for $k$-OV and $(n/k)^{Ω(k)}$ for $k$-XOR and $k$-SUM, with an absolute exponent-rate constant independent of both $k$ and the depth. For growing $k = n^{o(1)}$ and every fixed depth $d$, we obtain the unconditional floor $n^{Ω_d(\min\{\sqrt{k},\log n\})}$. This strengthens to $n^{Ω(k)}$ at depth two for both top-gate orientations, and at depth three for top-disjunction (OR-AND-OR) circuits, with no restriction on fan-in or polarity. The depth-three argument rests on a minterm bound for a single CNF: a fixed CNF is very unlikely to become true for the first time exactly when a randomly planted copy is completed. Assuming a pattern-uniform strengthening of the Li-Razborov-Rossman source lower bound, the same projections complete the $k = n^{o(1)}$ frontier with $n^{Ω_d(k)}$ for the missing top-conjunction depth-three orientation and for every fixed depth $d \geq 4$. The framework is modular in the source bound, so improved source bounds pass directly to all three targets. All direct $k$-XOR bounds concern odd $k$; a black-box lift covers even $k$, and the $k$-SUM projection works for both parities. At the bit width $m = Θ(k \log(\mathrm{e}n/k))$ used by our projection, a block-carry $Σ_3$ upper bound of size $(n/k)^{O(k)}$ matches the depth-three lower bound up to constants in the exponent. Gaps remain at depth two and for top-conjunction depth three.
CommentsThis version adds an unconditional depth-three lower bound for top-disjunction (OR-AND-OR) circuits with an exponent linear in growing k; adds worked toy instances that display the projection to each of the three targets; and revises the presentation throughout, correcting typos, simplifying overloaded notations and terminologies, and adding pointers to the formal definitions and statements
