We show that many well-known counting coefficients in combinatorics are Hamburger moment sequences in certain unified approaches and that Hamburger moment sequences are infinitely convex. We introduce the concept of t...We show that many well-known counting coefficients in combinatorics are Hamburger moment sequences in certain unified approaches and that Hamburger moment sequences are infinitely convex. We introduce the concept of the q-Hamburger moment sequence of polynomials and present some examples of such sequences of polynomials. We also suggest some problems and conjectures.展开更多
基金Supported by the National Natural Science Foundation of China(Grant No.11371078)
文摘We show that many well-known counting coefficients in combinatorics are Hamburger moment sequences in certain unified approaches and that Hamburger moment sequences are infinitely convex. We introduce the concept of the q-Hamburger moment sequence of polynomials and present some examples of such sequences of polynomials. We also suggest some problems and conjectures.
