Fibonacci numbers, consecutive patterns, and inverse peaks

DOI10.1016/J.AAM.2022.102406zbMATH Open1498.11060arXiv2109.14774OpenAlexW3202340942MaRDI QIDQ2168561FDOQ2168561

Authors: Justin M. Troyka, Yan Zhuang 

Publication date: 31 August 2022

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

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.

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

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

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)

Cites Work

• Title not available (Why is that?)
• Analytic combinatorics
• Title not available (Why is that?)
• Enumerative combinatorics. Volume 2.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumeration of permutations with prescribed up-down and inversion sequences
• Profile classes and partial well-order for permutations
• Grid classes and the Fibonacci dichotomy for restricted permutations
• Growth rates of permutation grid classes, tours on graphs, and the spectral radius
• Shuffle-compatible permutation statistics
• A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra

Cited In (2)

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

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)