activity
19982002
most citedIterating random functions on a finite set

9 citations · 9 across the 1 of their papers we have counts for

collaborators

9 papers

math.CO20029 cited

Iterating random functions on a finite set

W. M. Y. Goh, P. Hitczenko, E. Schmutz

Let f_1,f_2,..., be functions chosen independently and uniformly from the set of all functions from a set of cardinality n into itself. Let g_t be the composition of the first t fu…

math.CO2001

Expected number of distinct part sizes in a random integer composition

Pawel Hitczenko, Gilbert Stengle

The asymptotics, as , for the expected number of distinct part sizes in a random composition of an integer n is obtained.

math.CO2001

Random partitions with non negative rth differences

Rod Canfield, Sylvie Corteel, Pawel Hitczenko

Let be the set of partitions of n with non negative rth differences. Let be a partition chosen uniformly at random among the set . Let be a positive rth…

math.CA2001

Stability properties for a compactly supported prescale function

V. Dobric, R. F. Gundy, P. Hitczenko

We show that if is a continuous, minimally supported prescale function, then its translates are linearly independent on any set of positive measure in the unit interval. This g…

math.CA2001

Characterizations of orthonormal scale functions: a probabilistic approach

V. Dobric, R. F. Gundy, P. Hitczenko

The construction of a multiresolution analysis starts with specification of a scale function. The Fourier transform of this function is defined by an infinite product. The converge…

math.CO2001

S-partitions

William M. Y. Goh, Pawel Hitczenko, Ali Shokoufandeh

This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form for some integer k. Such partitions have potential applicati…