Counting distinct adjacent r-tuples in words.

DOI10.61091/ARS158-10MaRDI QIDQ6550677zbMATH OpenFDO

Authors Aubrey Blecher, Arnold Knopfmacher

Publication date 5 June 2024

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

generating functionStirling numbers of the second kindrestricted growth functionsset partitions of \(n\) into \(j\) blocks

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18)

Recommendations

• Distinct \(r\)-tuples in integer partitions
• Counting occurrences for a finite set of words
• Restricted words by adjacencies
• Generalizations of the Goulden–Jackson cluster method
• Counting occurrences of a pattern of length three with at most two distinct letters in a \(k\)-ary word

This page was built for publication: Counting distinct adjacent \(r\)-tuples in words.

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