诺林反极着色猜想的链级博苏克 - 乌拉姆障碍证明
A Chain-Level Borsuk--Ulam Obstruction Proof of Norine's Antipodal-Coloring Conjecture
浏览论文内容
中文总结 AI 辅助
研究\(n\geq2\)时\(n\)维超立方体红 - 蓝边着色中连接顶点与其对映点的单色路径问题，通过构造特定链映射并利用链级博苏克 - 乌拉姆障碍予以证明。
中文摘要 AI 辅助
我们证明了诺林猜想：对于\(n\geq2\)的\(n\)维超立方体\(Q_n\)的每一种红 - 蓝边着色，其中对映边具有相反颜色，都包含一条连接某个顶点与其对映点的单色路径。从一个假设的反例出发，我们构造了一个从立方体边界的胞腔链到低一维球面上细分不变多面体链的反极等变、增广保持链映射。一个纯代数的链级博苏克 - 乌拉姆障碍排除了这个映射。
英文摘要
We prove Norine's conjecture: every red--blue edge-coloring of the \(n\)-dimensional hypercube \(Q_n\), \(n\geq2\), in which antipodal edges have opposite colors contains a monochromatic path joining some vertex to its antipode. From a hypothetical counterexample we construct an antipodally equivariant, augmentation-preserving chain map from the cellular chains of the cubical boundary of a cube to subdivision-invariant polyhedral chains on a sphere of one lower dimension. A purely algebraic chain-level Borsuk--Ulam obstruction rules out this map.
