We study several questions related to squares, runs, and primitivity in partial words:
- Bounds on the number of primitively-rooted square and run occurrences in a partial word;
- Algorithms for finding all primitively-rooted square and run occurrences in a partial word;
- Square occurrences, distinct squares, and square positions in a partial word.
Keywords: Combinatorics on words; Partial words; Squares; Runs; Primitivity.




