Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A bijection between maximal chains in Fibonacci posets

From MaRDI portal
Publication:1356041
Jump to:navigation, search

DOI10.1006/JCTA.1997.2764zbMath0879.05003OpenAlexW1996432250MaRDI QIDQ1356041

Kathleen M. O'Hara, Darla Kremer

Publication date: 12 January 1998

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/45f672af03798e98aed5ef65e5762f1aef0b4a3e


zbMATH Keywords

tableauxFibonacci latticesFibonacci posets


Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10) Combinatorics of partially ordered sets (06A07)


Related Items (1)

The automorphism group of the Fibonacci poset: A ``not too difficult problem of Stanley from 1988




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Tableaux and rank-selection in Fibonacci lattices
  • Further combinatorial properties of two Fibonacci lattices
  • Duality of graded graphs
  • Schensted algorithms for dual graded graphs
  • Differential Posets




This page was built for publication: A bijection between maximal chains in Fibonacci posets

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1356041&oldid=13493723"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 14:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki