Cyclic permutations avoiding pairs of patterns of length three
From MaRDI portal
Abstract: We complete the enumeration of cyclic permutations avoiding two patterns of length three each by providing explicit formulas for all but one of the pairs for which no such formulas were known. The pair proves to be the most difficult of these pairs. We also prove a lower bound for the growth rate of the number of cyclic permutations that avoid a single pattern , where is an element of a certain infinite family of patterns.
This page was built for publication: Cyclic permutations avoiding pairs of patterns of length three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6301543)
