Further combinatorial properties of two Fibonacci lattices
For each positive integer r, two lattices Fib(r) and Z(r) were defined earlier. In this article their investigation is continued. A bijection \(\psi\) : Fib(r)\(\to Z(r)\) is shown to preserve many properties of the lattice, though \(\psi\) is not an isomorphism. It is shown that for any fixed \(n\geq 1\), \[ \sum_{x_ 1\leq x_ 2\leq...\leq x_ n}q^{\rho (x_ n)}=\prod^{n}_{i=1}(1-rq-((i-1)r+1)q^ 2)^{-1}, \] where the sum ranges over all n-element multichains in Fib(r) or in Z(r) and \(\rho\) denotes the rank. Some additional properties of Fib(r) and Z(r) related to the counting of chains are developed.
- Log-concavity and combinatorial properties of Fibonacci lattices
- Duality of graded graphs
- A bijection between maximal chains in Fibonacci posets
- The automorphism group of the Fibonacci poset: A ``not too difficult problem of Stanley from 1988
- The Martin boundary of the Young-Fibonacci lattice
- A bijection between intervals in the Fibonacci posets
- Combinatorial properties of Fibonacci arrays
- Signed differential posets and sign-imbalance
- 6. Fibonacci lattices have minimal dispersion on the two-dimensional torus
- scientific article; zbMATH DE number 4218566 (Why is no real title available?)
- scientific article; zbMATH DE number 3924848 (Why is no real title available?)
- Algebras Associated to the Young-Fibonacci Lattice
- scientific article; zbMATH DE number 1488857 (Why is no real title available?)
- Odd and even Fibonacci lattices arising from a Garside monoid
- Tableaux and rank-selection in Fibonacci lattices
This page was built for publication: Further combinatorial properties of two Fibonacci lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753816)