垂直和与2-和格数的指数下界
Exponential lower bounds of lattice counts by vertical sum and 2-sum
摘要:
本文研究了在某些格族中寻找未标号$n$ -元格个数的下界问题。我们证明了,如果该族在垂直和下是闭的,则指数下界可以由其个数已知的小格的垂直和得到。我们证明了这种方法,建立模格的数量至少是$2.2726^n$为$n$足够大。我们还提出了一个类似的方法来寻找某些族中垂直不可分解格个数的下界。为此,我们定义了一种新的和,垂直2-和,它结合格在两个共同的元素。作为应用,我们证明了当$n$足够大时,垂直不可分解的模格和半模格的个数至少为$2.1562^n$和$2.6797^n$.
英文摘要:
We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of small lattices whose numbers are known. We demonstrate this approach by establishing that the number of modular lattices is at least $2.2726^n$ for $n$ large enough. We also present an analogous method for finding lower bounds on the number of vertically indecomposable lattices in some family. For this purpose we define a new kind of sum, the vertical 2-sum, which combines lattices at two common elements. As an application we prove that the numbers of vertically indecomposable modular and semimodular lattices are at least $2.1562^n$ and $2.6797^n$ for $n$ large enough.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。