An (almost) optimal answer to a question by Wilf

2004/04/08 by Micah Coleman, Coleman, Micah
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems #math.CO

paper · pdf · doi:10.48550/arxiv.math/0404181

arxiv created 2004/04/08 · openalex publication_date 2004/04/08 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation grows to infinity.

Related

• A Combinatorial Proof for 132-Avoiding Permutations with a Unique Longest Increasing Subsequence
• Permutations Almost Avoiding Monotone Distant Patterns
• Increasing and Decreasing Subsequences of Permutations and Their Variants
• On the growth rate of the Stanley-Wilf limit of blockable permutations
• Shape-Wilf-ordering of permutations of length 3