组合几何的Whitney数与高权Dowling格
Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices
摘要:
研究了第一类组合几何的Whitney数。本文的第一部分是关于嵌套原子格的默比乌斯函数的一般结果,推广了组合学中的一些经典定理。然后,我们专门我们的结果限制几何,即,到由一组投影点$A \subseteq X$生成的$\mathbb{F}_q$ -线性空间的子空间格的子格$\mathcal{L}(A)$,比如$X$。在这种情况下,我们引入子空间分布的概念,并表明,后者的部分知识相当于部分知识的惠特尼数的$\mathcal{L}(A)$。这改进了Dowling的一个经典结果。我们的结果最有趣的应用是在更高权重的道林格(HWDLs)的理论中,我们投票的第二部分,也是最实质性的部分。这些组合几何是由道林在1971年与编码理论的基本问题有关时提出的,并由扎斯拉夫斯基、博宁、孔、布里尼和游戏等进一步研究。到目前为止,人们对这些晶格仍然知之甚少。特别是,计算它们的惠特尼数的技术还没有被发现。在本文中,我们提出了HWDL的理论,计算其惠特尼数的新的无限族的参数。此外,我们表明,第二惠特尼数的HWDL是多项式的基础字段大小$q$,其系数的表达式涉及伯努利数。这揭示了组合学、编码理论和数论之间的新联系。我们还研究了HWDL的惠特尼数的渐近场大小的增长,在某些情况下,给出了上限和精确的估计。同时,我们得到了关于纠错码密度函数的新结果。
英文摘要:
We study the Whitney numbers of the first kind of combinatorial geometries. The first part of the paper is devoted to general results relating the Möbius functions of nested atomistic lattices, extending some classical theorems in combinatorics. We then specialize our results to restriction geometries, i.e., to sublattices $\mathcal{L}(A)$ of the lattice of subspaces of an $\mathbb{F}_q$-linear space, say $X$, generated by a set of projective points $A \subseteq X$. In this context, we introduce the notion of subspace distribution, and show that partial knowledge of the latter is equivalent to partial knowledge of the Whitney numbers of $\mathcal{L}(A)$. This refines a classical result by Dowling. The most interesting applications of our results are to be seen in the theory of higher-weight Dowling lattices (HWDLs), to which we dovote the second and most substantive part of the paper. These combinatorial geometries were introduced by Dowling in 1971 in connection with fundamental problems in coding theory, and further studied, among others, by Zaslavsky, Bonin, Kung, Brini, and Games. To date, still very little is known about these lattices. In particular, the techniques to compute their Whitney numbers have not been discovered yet. In this paper, we bring forward the theory of HWDLs, computing their Whitney numbers for new infinite families of parameters. Moreover, we show that the second Whitney numbers of HWDLs are polynomials in the underlying field size $q$, whose coefficients are expressions involving the Bernoulli numbers. This reveals a new link between combinatorics, coding theory, and number theory. We also study the asymptotics of the Whitney numbers of HWDLs as the field size grows, giving upper bounds and exact estimates in some cases. In passing, we obtain new results on the density functions of error-correcting codes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。