Most principal permutation classes, and t-stack sortable permutations, have nonrational generating functions

MaRDI QIDQ6621165FDOQ6621165

Authors: Miklós Bóna 

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Recommendations

• Supercritical sequences, and the nonrationality of most principal permutation classes
• Subclasses of the separable permutations
• Rationality for subclasses of 321-avoiding permutations
• Simple permutations and pattern restricted permutations
• Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Analytic combinatorics
• Combinatorics of permutations
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Permutation classes
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• On the positivity set of a linear recurrence sequence
• The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
• A survey of stack sortable permutations

This page was built for publication: Most principal permutation classes, and \(t\)-stack sortable permutations, have nonrational generating functions

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