Digital Convexity and Combinatorics on Words

An upward (resp. downward) digitally convex word is a binary word that best approximates from below (resp. from above) an upward (resp. downward) convex curve in the plane. We study these words from the combinatorial point of view, formalizing their geometric properties and highlighting connections with Christoffel words and finite Sturmian words. In particular, we study from the combinatorial perspective the operations of inflation and deflation on digitally convex words.