Explicit polynomial generators for the ring of quasi-symmetric functions over the integers

Details Explicit polynomial generators for the ring of quasi-symmetric functions over the integers Explicit polynomial generators for the ring of quasi-symmetric functions over the integers

2004-10-16

arxiv.org/abs/math/0410366v1

Mathematics

Combinatorics

7 pages. Submitted to CR Acad. Sci. Paris

Scientific paper

In [5, 6] it has been proved that the ring of quasisymmetric functions over the integers is free polynomial, see also [4]. 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 [2] and [9] and the references in the latter. Meanwhile quasisymmetric functions have found many more aplications, [3]. However, the proofs in [5, 6] 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.

Affiliated with

Also associated with

No associations

Rating

Explicit polynomial generators for the ring of quasi-symmetric functions over the integers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Explicit polynomial generators for the ring of quasi-symmetric functions over the integers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Explicit polynomial generators for the ring of quasi-symmetric functions over the integers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-486711