Displaying 161 – 180 of 2013

Showing per page

A partition of the Catalan numbers and enumeration of genealogical trees

Rainer Schimming (1996)

Discussiones Mathematicae Graph Theory

A special relational structure, called genealogical tree, is introduced; its social interpretation and geometrical realizations are discussed. The numbers C n , k of all abstract genealogical trees with exactly n+1 nodes and k leaves is found by means of enumeration of code words. For each n, the C n , k form a partition of the n-th Catalan numer Cₙ, that means C n , 1 + C n , 2 + . . . + C n , n = C .

A q-analogue of complete monotonicity

Anna Kula (2008)

Colloquium Mathematicae

The aim of this paper is to give a q-analogue for complete monotonicity. We apply a classical characterization of Hausdorff moment sequences in terms of positive definiteness and complete monotonicity, adapted to the q-situation. The method due to Maserick and Szafraniec that does not need moments turns out to be useful. A definition of a q-moment sequence appears as a by-product.

Currently displaying 161 – 180 of 2013