Most principal permutation classes have nonrational generating functions
From MaRDI portal
Publication:6313009
arXiv1901.08506MaRDI QIDQ6313009FDOQ6313009
Authors: Miklós Bóna
Publication date: 24 January 2019
Abstract: We prove that for any fixed , and for most permutation patterns , the number of -avoiding permutations of length that consist of skew blocks is a monotone decreasing function of . We then show that this implies that for most patterns , the generating function of the sequence of the numbers of -avoiding permutations is not rational. Placing our results in a broader context, we show that for rational power series and with nonnegative real coefficients, the relation is supercritical, while for most permutation patterns , the corresponding relation is not supercritical.
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Combinatorial identities, bijective combinatorics (05A19) Combinatorial inequalities (05A20)
This page was built for publication: Most principal permutation classes have nonrational generating functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6313009)