关于Lucas着色的理论
On the theory of Lucas coloring
AI总结：
该研究提出平面图的Lucas着色概念，证明4-正则图下其计数对应Khovanov-Lee复形的数值不变量，并给出交替符号矩阵推导、完美匹配计数及菱形铺砌求和公式等应用，关联经典Aztec钻石定理。
摘要：
本文提出了与平面图$g$相关的“Lucas着色（Lucas-Coloring）”概念。当$g$为4-正则图时，Lucas着色的计数具备一种有趣的解释：具体而言，它能给出投影等于$g$的任意链环图$D$的相关Khovanov-Lee复形的一个数值不变量。该复形位于Bar-Natan形式配边范畴$Cob^{3}_{/l}$的Karoubi包络中，而$Cob^{3}_{/l}$的Karoubi包络由Bar-Natan和Morrison提出，用于为Lee定理提供概念性证明。作为Lucas着色的一项应用，本文首先展示了如何将交替符号矩阵（Alternating Sign Matrices）作为Lucas着色的特例推导得到。其次，证明了Lucas着色上的某类统计量可计数$g$上一个典范定义图的完美匹配数。借助这一构造，本文推导出了一个求和公式：从正六边形的交替角处移除“最大阶梯形”后得到的区域的菱形铺砌数，可通过2的幂次表示。该公式与Elkies、Kuperberg、Larsen和Propp提出的著名的Aztec钻石定理（Aztec Diamond Theorem）相呼应，后者研究的是Aztec钻石的多米诺骨牌铺砌问题。
英文摘要：
In this paper, we introduce the notion of "$Lucas-Coloring$" associated with a planar graph $g$. When $g$ is a $4$-regular, the enumeration of $Lucas-Coloring$ has an interesting interpretation. Specifically, it yields a numerical invariant of the associated Khovanov-Lee complex of any link diagram $D$ whose projection is equal to $g$. This complex resides in the Karoubi envelope of Bar-Natan's formal cobordism category, $Cob^{3}_{/l}$ . The Karoubi envelope of $Cob^{3}_{/l}$ was introduced by Bar-Natan and Morrison to provide a conceptual proof of Lee's theorem. As an application of "Lucas-Coloring", we first show how the Alternating Sign Matrices can be retrieved as a special case of $Lucas-Coloring$. Next, we show a certain statistic on the $Lucas-Coloring$ enumerates the perfect matchings of a canonically defined graph on $g$. This construction allowed us to derive a summation formula of the enumeration of lozenge tilings of the region constructed out of a regular hexagon by removing the "maximal staircase" from its alternating corners in terms of powers of $2$. This formula is reminiscent of the celebrated Aztec Diamond Theorem of Elkies, Kuperberg, Larsen, and Propp, which concerns domino tilings of Aztec Diamonds.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
