Combinatorics of normal sequences of braids

Many natural counting problems arise in connection with the normal form of braids–and seem to have never been considered so far. Here we solve some of them by analysing the normality condition in terms of the associated permutations, their descents and the corresponding partitions. A number of different induction schemes appear in that framework.