Fibonacci numbers, consecutive patterns, and inverse peaks

DOI10.1016/J.AAM.2022.102406MaRDI QIDQ2168561zbMATH OpenOpenAlexFDO

Authors Justin M. Troyka, Yan Zhuang

Publication date 31 August 2022

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2109.14774

zbMATH Keywords

permutationsFibonacci numberspeaksconsecutive patterns

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Formal languages and automata (68Q45) Exact enumeration problems, generating functions (05A15) Symmetric functions and generalizations (05E05) Combinatorial identities, bijective combinatorics (05A19) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Abstract: We give multiple proofs of two formulas concerning the enumeration of permutations avoiding a monotone consecutive pattern with a certain value for the inverse peak number or inverse left peak number statistic. The enumeration in both cases is given by a sequence related to Fibonacci numbers. We also show that there is exactly one permutation whose inverse peak number is zero among all permutations with any fixed descent composition, and we give a few elementary consequences of this fact. Our proofs involve generating functions, symmetric functions, regular expressions, and monomino-domino tilings.

Recommendations

• From Fibonacci to Catalan permutations
• Scientific article; zbMATH DE number 2108134
• Inversion polynomials for permutations avoiding consecutive patterns
• Lucas permutations and some notes on Fibonacci permutations
• Fibonacci numbers, reduced decompositions, and 321/3412 pattern classes

Cites work

• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 1975686 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 3895079 (Why is no real title available?)
• A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
• Analytic combinatorics
• Enumeration of permutations with prescribed up-down and inversion sequences
• Enumerative combinatorics. Volume 2.
• Grid classes and the Fibonacci dichotomy for restricted permutations
• Growth rates of permutation grid classes, tours on graphs, and the spectral radius
• Profile classes and partial well-order for permutations
• Shuffle-compatible permutation statistics

Cited in

(2)

• A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
• Two-sided permutation statistics via symmetric functions

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Fibonacci numbers, consecutive patterns, and inverse peaks

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