in seminal paper, gessel-reutenauer construct a truly remarkable bijection between words in the free monoid over an infinite alphabet and multisets of primitive necklaces. using this bijection gessel-reutenauer derive a variety of beautiful symmetric function identities with deep implications in permutation enumeration. in this talk we review the gessel-reutenauer results, derive some applications and state some challenging combinatorial problems.