Abstract

In (Hazewinkel in Adv. Math. 164:283–300, 2001, and CWI preprint, 2001) it has been proved that the ring of quasisymmetric functions over the integers is free polynomial. This is a matter that has been of great interest since 1972; for instance because of the role this statement plays in a classification theory for noncommutative formal groups that has been in development since then, see (Ditters in Invent. Math. 17:1–20, 1972; in Scholtens’ Thesis, Free Univ. of Amsterdam, 1996) and the references in the latter. Meanwhile quasisymmetric functions have found many more applications (see Gel’fand et al. in Adv. Math. 112:218–348, 1995). However, the proofs of the author in the aforementioned papers do not give explicit polynomial generators for QSymm over the integers. In this note I give a (really quite simple) set of polynomial generators for QSymm over the integers.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call