Short, bijective proofs of identities for multisets of `hook pairs' (arm-leg pairs) of the cells of certain diagrams are given. These hook pair identities were originally foun...
We prove that the minimal length of a word Sn having the property that it contains exactly Fm+2 distinct subwords of length m for 1 ≤ m ≤ n is Fn + Fn+2. Here Fn is the nth Fi...
In this paper we study sequential dynamical systems (SDS) over words. Our main result is the classification of SDS over words for fixed graphY and family of local maps (Fvi ) by m...