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

Martin Mathew, Javier Noda

Counting distinct permutations with replacement, especially when involving multiple subwords, is a longstanding challenge in combinatorial analysis, with critical applications in c…