Fibonacci numbers, consecutive patterns, and inverse peaks

Justin M. Troyka, Yan Zhuang

Published 2021-09-30, updated 2023-01-11Version 2

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.