由Garside幺半群产生的奇、偶Fibonacci格
Odd and even Fibonacci lattices arising from a Garside monoid
摘要:
我们研究两个家庭的格的元素的数量是由偶数(分别奇数)的位置在斐波那契序列。偶数Fibonacci格是Garside幺半群的简单元素按左整除性偏序的格,奇数Fibonacci格是偶数中的阶理想。我们给出了一个组合证明的格属性,依赖于描述的话Garside元素的施罗德树,并在递归描述的甚至斐波纳契格。这将产生一个显式公式来计算晶格中的会合和连接。作为一个副产品,我们还得到了Garside元素的字数由一个小Schröder数给出。
英文摘要:
We study two families of lattices whose number of elements are given by the numbers in even (respectively odd) positions in the Fibonacci sequence. The even Fibonacci lattice arises as the lattice of simple elements of a Garside monoid partially ordered by left-divisibility, and the odd Fibonacci lattice is an order ideal in the even one. We give a combinatorial proof of the lattice property, relying on a description of words for the Garside element in terms of Schröder trees, and on a recursive description of the even Fibonacci lattice. This yields an explicit formula to calculate meets and joins in the lattice. As a byproduct we also obtain that the number of words for the Garside element is given by a little Schröder number.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。