Free rises, restricted partitions, and q-Fibonacci polynomials
From MaRDI portal
Publication:384775
DOI10.1007/S13370-011-0060-8zbMATH Open1276.05008OpenAlexW2044145846WikidataQ60692059 ScholiaQ60692059MaRDI QIDQ384775FDOQ384775
Authors: Toufik Mansour, Mark Shattuck 
Publication date: 28 November 2013
Published in: Afrika Matematika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13370-011-0060-8
Recommendations
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- Restricted permutations
- On \(abab\)-free and \(abba\)-free set partitions
- Pattern avoidance in set partitions.
- Title not available (Why is that?)
- On pattern-avoiding partitions
- Title not available (Why is that?)
- A new class of \(q\)-Fibonacci polynomials
- Records in set partitions
- Generating trees and the Catalan and Schröder numbers
- Title not available (Why is that?)
- A combinatorial interpretation of the generalized Fibonacci numbers
- Generating trees and forbidden subsequences
- A new statistic on linear and circular \(r\)-mino arrangements
- Set partition statistics and \(q\)-Fibonacci numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some generalized Fibonacci polynomials
- \(p,q\)-Stirling numbers and set partition statistics
- Avoidance of partitions of a three-element set
Cited In (6)
- Ascent sequences avoiding pairs of patterns
- Combinatorial generation via permutation languages. VI: Binary trees
- Set partition statistics and \(q\)-Fibonacci numbers
- \(Q\)-analogues of convolutions of Fibonacci numbers
- Permutation statistics and \(q\)-Fibonacci numbers
- Statistics on restricted Fibonacci words
Uses Software
This page was built for publication: Free rises, restricted partitions, and \(q\)-Fibonacci polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q384775)
