A connection between unbordered partial words and sparse rulers

DOI10.37236/13806MaRDI QIDQ6841452zbMATH OpenFDO

Authors Aleksi Saarela, Aleksi Vanhatalo

Publication date 20 March 2026

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/13806

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites work

• A generalization of Thue freeness for partial words
• A Note on Restricted Difference Bases
• Avoiding overlaps in pictures
• Combinatorics on partial word borders
• Counting bordered partial words by critical positions
• Eine Extremalaufgabe aus der Graphentheorie.
• How Many Holes Can an Unbordered Partial Word Contain?
• scientific article; zbMATH DE number 3052436 (Why is no real title available?)
• Improved lower bound for difference bases
• In search of maximum non-overlapping codes
• Non-expandable non-overlapping sets of pictures
• Non-overlapping matrices
• Non-overlapping matrices via Dyck words
• On the Representation of 1, 2, …, n by Differences
• Overlap-freeness in infinite partial words
• Partial words and a theorem of Fine and Wilf
• Regular languages of partial words
• Restorations of punctured languages and similarity of languages
• Square-free partial words

This page was built for publication: A connection between unbordered partial words and sparse rulers

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