10 problems

Let $s_n((3,2,1),r)$ denote the number of permutations of length $n$ containing exactly $r$ occurrences of the pattern $(3,2,1)$, and let … For each $r$, let $P_r$ and $Q_r$ denote…

The 321 four-occurrence generating-function conjecture.

Let $f_n^k(\sigma)$ denote the number of permutations of length $n$ associated with a pattern $\sigma\in S_3$ and fixed by the $k$th iterate of the fundamental bijection. Power-of-…

Eventual constancy conjecture. For each $\sigma\in\{213,132\}$ and $k\geq1$, $f_n^k(\sigma)$ is eventually constant as $n$ becomes large. The paper conjectures that for $n\geq8$ th…

Let $t_n^k(\tau)$ denote the number of permutations of length $n$ avoiding the pattern $\tau$ that are fixed by the $k$th iterate of the fundamental bijection. For $ngeq2$, the con…

Let $C_n(231,1432: 231)$ be the set of permutations in $S_n$ that avoid the chain $(231,1432: 231)$, and let $c_n(231,1432: 231)$ denote its cardinality. Thus, the permutation avoi…

Let $f_{n,d}^{(2)}(123)$ denote the number of permutations of size $n$ that avoid the pattern $123$ and have stabilized interval parameter $d$. Write $n=2m+r$ with $r\in\{0,1\}$ an…

Let $C(n)$ denote the number of permutations $csigma$ of $[n]$ such that $cgcd(j,csigma(j))=1$ for every $jcin[n]$. After defining constants $c_k$ for the corresponding restriction…

For a finite set $S$ of pinnacle values, let … Write $S=\{s_1,\dots,s_p\}$ with $n\geq s_p$, define … and set … Define abstract expressions by $E_1=x_{1,3}+x_{1,1}$,…

For $n\geq 1$, let $AV_n(23\text{-}1\text{-}4)$ be the permutations of length $n$ avoiding the generalized pattern $23\text{-}1\text{-}4$, and let $k$ be the number of right-to-lef…