Supercritical sequences, and the nonrationality of most principal permutation classes

DOI10.1016/j.ejc.2019.103020zbMath1428.05004OpenAlexW2974146121WikidataQ127196112 ScholiaQ127196112MaRDI QIDQ2011140

Miklós Bóna

Publication date: 28 November 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2019.103020

zbMATH Keywords

generating functionpermutation patterns

Mathematics Subject Classification ID

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

Related Items

Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization, Pattern avoiding permutations with a unique longest increasing subsequence, Bounded affine permutations I. Pattern avoidance and enumeration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Words in linear groups, random walks, automata and P-recursiveness
• Excluded permutation matrices and the Stanley-Wilf conjecture
• On the positivity set of a linear recurrence sequence
• Combinatorics of Permutations
• Permutation classes
• Permutation patterns are hard to count
• The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent