arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1208.3517math.RA
收藏

并分配格的协调化

Coordinatization of join-distributive lattices

Gábor Czédli

摘要:

并分配格是有限的、交半分配的、半模格。它们与Dilworth在1940年提出的格相同,此后又发现或重新发现了许多不同的定义和等价概念。设L是长为n的并分配格,k表示L的并不可约元集的宽度.由于P. H。Edelman和R.E.贾米森,从组合数学翻译到格理论,说L可以由作用于集合{1,.,n}。我们在格理论中证明了一个类似的结果:存在作用于{1,...,n},使得L的元素由{0,.,n},并且排列确定允许哪些k元组。由于并分配格的概念等价于反矩阵和凸几何的概念,我们的结果为这些组合结构提供了一个坐标化。

英文摘要:

Join-distributive lattices are finite, meet-semidistributive, and semimodular lattices. They are the same as Dilworth's lattices in 1940, and many alternative definitions and equivalent concepts have been discovered or rediscovered since then. Let L be a join-distributive lattice of length n and let k denote the width of the set of join-irreducible elements of L. A result of P.H. Edelman and R.E. Jamison, translated from Combinatorics to Lattice Theory, says that L can be described by k-1 permutations acting on the set {1,...,n}. We prove a similar result within Lattice Theory: there exist k-1 permutations acting on {1,...,n} such that the elements of L are coordinatized by k-tuples over {0,...,n}, and the permutations determine which k-tuples are allowed. Since the concept of join-distributive lattices is equivalent to that of antimatroids and convex geometries, our result offers a coordinatization for these combinatorial structures.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑