Long increasing subsequences and non-algebraicity

DOI10.46298/DMTCS.12539zbMATH Open1547.05006MaRDI QIDQ6606910FDOQ6606910

Authors: Miklós Bóna 

Publication date: 17 September 2024

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

zbMATH Keywords

permutationsgenerating functionspatternsnon-algebraicity

Mathematics Subject Classification ID

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

Cites Work

• Restricted permutations
• Asymptotic values for degrees associated with strips of Young diagrams
• Permutation classes
• Sur les séries de Taylor n'ayant que des singularites algebrico- logarithmiques sur leur cercle de convergence
• Wilf-equivalence for singleton classes
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• The permutations \(123p_4\dots p_m\) and \(321p_4\dots p_m\) are Wilf-equivalent
• Juxtaposing Catalan permutation classes with monotone ones
• Notes on the binomial transform. Theory and table with appendix on Stirling transform
• Supercritical sequences, and the nonrationality of most principal permutation classes
• Permutations avoiding sets of patterns with long monotone subsequences
• Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization

This page was built for publication: Long increasing subsequences and non-algebraicity

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