Some results on digital segments and balanced words (Q6639744)

The main result of the paper is a formula for the number of balanced words with a given number of occurrences of each symbol. A recursive one has been known since 2010 [\textit{N. Bedaride} et al., Discrete Math. Theor. Comput. Sci. 12, No. 3, 41--62 (2010; Zbl 1280.68145)], but here the authors give a more or less closed expression: it contains double sums of functions computed explicitly depending on the relations among parameters.