Duncan Adamson

collaborators

5 papers

math.CO2026

$2$ -word- $I ¨ $ -representable Graphs

Duncan Adamson, Amanita Dietz, Pamela Fleischmann +2

This paper investigates the new notion of $2$ -word- $I ¨ $ -repre\-sentable graphs: the nodes of the graph correspond to the letters of the two words and there exists an edge between t…

cs.DS2026

(Sets of ) Complement Scattered Factors

Duncan Adamson, Pamela Fleischmann, Annika Huch

Starting in the 1970s with the fundamental work of Imre Simon, \emph{scattered factors} (also known as subsequences or scattered subwords) have remained a consistently and heavily…

cs.FL2025

Tight Bounds for the Number of Absent Subsequences

Duncan Adamson, Pamela Fleischmann, Annika Huch +3

A {\em subsequence} of a word $w$ is a word $u$ that can be obtained by deleting some letters from $w$ while maintaining the relative order of the remaining letters, e.g., $\mathtt…

math.CO2025

Word Chain Generators for Prefix Normal Words

Duncan Adamson, Moritz Dudey, Pamela Fleischmann +1

In 2011, Fici and LiptÃ¡k introduced prefix normal words. A binary word is prefix normal if it has no factor (substring) that contains more occurrences of the letter 1 than the pre…

cs.FL2025

$k$ -Universality of Regular Languages Revisited

Duncan Adamson, Pamela Fleischmann, Annika Huch +2

A subsequence of a word $w$ is a word $u$ such that $u = w [i_{1}] w [i_{2}] \dots w [i_{k}]$ , for some set of indices $1 \leq i_{1} < i_{2} < \dots < i_{k} \leq ∣ w ∣$ . A word $w$ is \e…

2-word-I¨-representable Graphs

(Sets of ) Complement Scattered Factors

Tight Bounds for the Number of Absent Subsequences

Word Chain Generators for Prefix Normal Words

k-Universality of Regular Languages Revisited

$2$ -word- $I ¨ $ -representable Graphs

$k$ -Universality of Regular Languages Revisited