Tableaux and rank-selection in Fibonacci lattices

DOI10.1006/EUJC.1993.0073MaRDI QIDQ674628zbMATH OpenOpenAlexFDO

Authors Rowan Kemp

Publication date 4 August 1997

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.1993.0073

zbMATH Keywords

tableauxFibonacci latticesbox-tableauxenumeration of maximal chains[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Jordan-H%EF%BF%BD%EF%BF%BDlder+sequences&go=Go Jordan-H��lder sequences]rank-selected subposets

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Combinatorics of partially ordered sets (06A07)

Recommendations

• Further combinatorial properties of two Fibonacci lattices
• Some statistics for Fibonacci tableaux
• \(k\)-ribbon Fibonacci tableaux
• On the rank polynomial of the lattice of order ideals of fences and crowns

Cited in

(7)

• \(k\)-ribbon Fibonacci tableaux
• Odd and even Fibonacci lattices arising from a Garside monoid
• Further combinatorial properties of two Fibonacci lattices
• Some statistics for Fibonacci tableaux
• A bijection between maximal chains in Fibonacci posets
• The automorphism group of the Fibonacci poset: A ``not too difficult problem of Stanley from 1988
• Trace map for an \(n\)-ternary Fibonacci lattice

This page was built for publication: Tableaux and rank-selection in Fibonacci lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674628)