The two-way rewriting in action: removing the mystery of Euler-Glaisher's map (Q882113)

In a previous paper [Discrete Math. 285, No.~1--3, 151--166 (2004; Zbl 1044.05010)], the author introduced a method to establish explicit bijections between combinatorial objects of two different types, by using certain rewriting techniques (called two-directional). In the present paper, he uses this two-way rewriting technique to explain the reason why bijections similar to the one given by Euler for his celebrated ``odd-distinct'' partition theorem, and later generalized by Glaisher (1883), seem to be ubiquitous. He does this by defining certain rewriting maps \(\mathcal K_{\tau}\). Euler's bijection is based on the expression of a number in its binary representation. Glaisher generalized this by using any base \(m\), when the number of repeated parts is bounded by \(m-1\). The author exploits the ``mixed radix'' system where the numerical base may vary according to some weight function \(\tau\), to define a generalized Euler-Glaisher mapping \(\mathcal E_{\tau}\). He then shows that \(\mathcal E_{\tau}\) coincides with \(\mathcal K_{\tau}\) on many partitions of interest.