Hausdorff moment problem for combinatorial numbers of Brown and Tutte: exact solution

Abstract

We investigate the combinatorial sequences A(M, n) introduced by W. G. Brown (1964) and W. T. Tutte (1980) appearing in enumeration of convex polyhedra. Their formula is A(M, n) = 2 (2M+3)!(M+2)! M!\,(4n+2M+1)!n! (3n + 2M + 3)! with n, M =0, 1, 2, …, and we conceive it as Hausdorff moments, where M is a parameter and n enumerates the moments. We solve exactly the corresponding Hausdorff moment problem: A(M, n) = ∫0R xn WM(x) d x on the natural support (0, R), R = 44/33, using the method of inverse Mellin transform. We provide explicitly the weight functions WM(x) in terms of the Meijer G-functions G4, 44, 0, or equivalently, the generalized hypergeometric functions 3F2 (for M=0, 1) and 4F3 (for M ≥ 2). For M = 0, 1, we prove that WM(x) are non-negative and normalizable, thus they are probability distributions. For M ≥ 2, WM(x) are signed functions vanishing on the extremities of the support. By rephrasing this problem entirely in terms of Meijer G representations we reveal an integral relation which directly furnishes WM(x) based on ordinary generating function of A(M, n) as an input. All the results are studied analytically as well as graphically.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…