Permutations with exactly one copy of a decreasing pattern of length k

DOI10.1007/S00026-021-00549-0MaRDI QIDQ6357409arXivFDO

Authors Miklós Bóna, Alexander Burstein

Publication date 1 January 2021

Published in arXiv

Full work available at URL https://doi.org/10.1007/S00026-021-00549-0

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

arXiv classification

math.CO

Abstract: We construct an injection from the set of permutations of length $n$ that contain exactly one copy of the decreasing pattern of length $k$ to the set of permutations of length $n+2$ that avoid that pattern. We then prove that the generating function counting the former is not rational, and in the case when $k$ is even and $kgeq4$, it is not even algebraic. We extend our injection and our nonrationality result to a larger class of patterns.

This page was built for publication: Permutations with exactly one copy of a decreasing pattern of length k

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6357409)