Fibonacci numbers, reduced decompositions, and 321/3412 pattern classes

DOI10.1007/s00026-010-0051-8zbMath1233.05008OpenAlexW2166128394WikidataQ60691902 ScholiaQ60691902MaRDI QIDQ659574

Daniel Daly

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-010-0051-8

zbMATH Keywords

combinatoricsFibonacci numberspermutation patternsreduced decompositions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (1)

On Schubert varieties of complexity one

Cites Work

• Unnamed Item
• Restricted 3412-avoiding involutions, continued fractions, and Chebyshev polynomials
• Some combinatorial properties of Schubert polynomials
• Reduced decompositions with one repetition and permutation pattern avoidance
• Pattern avoidance and the Bruhat order.
• Reduced decompositions and permutation patterns
• Combinatorics of Coxeter Groups
• How often are two permutations comparable?

This page was built for publication: Fibonacci numbers, reduced decompositions, and 321/3412 pattern classes