Mathew, Martin

From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints

2024 · arXiv (Cornell University)

Counting distinct permutations with replacement, especially when involving multiple subwords, is a longstanding challenge in combinatorial analysis, with critical applications in cryptography, bioinformatics, and statistical modeling. This paper introduces a novel framework that presents closed-form …