Statistics on Almost-Fibonacci Pattern-Avoiding Permutations
| Autor: | Lynch, Brody, Qin, Yihan |
|---|---|
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | Minnesota Journal of Undergraduate Mathematics, 7 (2022) |
| Druh dokumentu: | Working Paper |
| Popis: | We prove that $|Av_n(231,312,1432)|$, $|Av_n(312,321,1342)|$ $|Av_n(231,312,4321,21543)|$, and $ |Av_n(321,231,4123,21534)|$, are all equal to $F_{n+1} - 1$ where $F_n$ is the $n$-th Fibonacci number using the convention $F_0 = F_1 = 1$ and $Av_n(S)$ is the set of all permutations of length $n$ that avoid all of the patterns in the set $S$. To do this, we characterize the structures of the permutations in these sets in terms of Fibonacci permutations. Then, we further quantify the structures using statistics such as inversion number and a statistic that measures the length of Fibonacci subsequences. Finally, we encode these statistics in generating functions written in terms of the generating function for Fibonacci permutations. We use these generating functions to find analogs about recurrence relation and addition formulae of Fibonacci identities. Comment: 17 Pages, 5 figures, to be published in Minnesota Journal of Undergraduate Mathematics |
| Databáze: | arXiv |
| Externí odkaz: |
|