Intersections in pairs of words

MaRDI QIDQ6943838zbMATH OpenFDO

Authors Aubrey Blecher, Arnold Knopfmacher

Publication date 12 August 2025

Published in Integers (Search for Journal in Brave)

Full work available at URL https://math.colgate.edu/~integers/y107/y107.pdf

zbMATH Keywords

generating functionsnon-intersecting words

Mathematics Subject Classification ID

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

Review text

The paper deals with the generating functions for pairs of non-intersecting words. The following are given:\N\N\(\bullet\) the generating function tracking all pairs of non-intersecting words over the alphabet [\(k\)],\N\N\(\bullet\) the generating function for the number of repeats of letters in the second of a pair of words over the alphabet [\(k\)],\N\N\(\bullet\) the generating function tracking all pairs of non-intersecting weakly decreasing words over the alphabet [\(k\)],\N\N\(\bullet\) the generating function tracking all pairs of weakly decreasing words over the alphabet [\(k\)].

Cites work

• Bargraphs of combinations with repetition
• Enumeration and asymptotics of restricted compositions having the same number of parts
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• On the probability that certain compositions have the same number of parts
• Shedding light on words

This page was built for publication: Intersections in pairs of words

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