Subsequence frequency in binary words

DOI10.1016/j.disc.2024.113928arXiv2306.07870OpenAlexW4391922018MaRDI QIDQ6204345

Anurag Singh, Krishna Menon

Publication date: 27 March 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2306.07870

zbMATH Keywords

pattern avoidancebinary wordsWilf equivalencesubsequence frequency

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• Unnamed Item
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• Pattern frequency sequences and internal zeros
• Counting occurrences of 132 in a permutation
• String overlaps, pattern matching, and nontransitive games
• Subsequence numbers and logarithmic concavity
• The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size!
• Permutations with one or two 132-subsequences
• Reconstruction from subsequences.
• Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three
• Strings with maximally many distinct subsequences and substrings
• The number of permutations containing exactly one increasing subsequence of length three
• Length-four pattern avoidance in inversion sequences
• Pattern avoidance of \([4,k\)-pairs in circular permutations]
• On the maximum number of distinct factors of a binary string
• Algorithms for subsequence combinatorics
• Algorithms for the Longest Common Subsequence Problem
• Restricted Grassmannian permutations

This page was built for publication: Subsequence frequency in binary words