P. Hitczenko

activity

19982002

most citedIterating random functions on a finite set

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

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2002★ 9 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 $n \to \infty$ , 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 $P_{r} (n)$ be the set of partitions of n with non negative rth differences. Let $λ$ be a partition chosen uniformly at random among the set $P_{r} (n)$ . Let $d (λ)$ be a positive rth…

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 $2^{k} - 1$ for some integer k. Such partitions have potential applicati…

math.CO2001

Average number of distinct part sizes in a random Carlitz composition

William M. Y. Goh, Pawel Hitczenko

A composition of an integer is called Carlitz if adjacent parts are different. Several characteristics of random Carlitz compsitions have been studied recently by Knopfmacher and P…