G-R-sequences and incidence coalgebras of posets of full binomial type (Q1117229)

A family of polynomial sequences, called G-R sequences, is introduced. It is shown that every G-R sequence introduces a structure of graded coalgebra and conversely for a given graded coalgebra it is shown how to construct the unique G-R sequence. Further, a connection between G-R sequences and posets of full binomial type is investigated. Finally, all G-R sequences \(p_ n(x)\) for which \(p_{n+1}\) is divisible by \(p_ n\) are characterized by means of roots of unity and linearly recursive sequences.