Mean and variance of the longest alternating subsequence in a random separable permutation

DOI10.1016/J.JCTA.2025.106157MaRDI QIDQ6859814zbMATH OpenFDO

Authors Ross G. Pinsky

Publication date 11 February 2026

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTA.2025.106157

zbMATH Keywords

longest alternating subsequencepattern avoiding permutationseparable permutation

Mathematics Subject Classification ID

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

Cites work

• A singular mathematical promenade
• Analytic combinatorics
• Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
• Combinatorics of permutations
• scientific article; zbMATH DE number 3722110 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• Longest alternating subsequences in pattern-restricted permutations
• Longest alternating subsequences of permutations
• Pattern matching for permutations

This page was built for publication: Mean and variance of the longest alternating subsequence in a random separable permutation

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