activity
20012007
most citedIterating random functions on a finite set

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

collaborators

6 papers

math.CO2007

Polynomials associated with Partitions: Polynomials associated with Partitions: Their Asymptotics and Zeros

Robert P. Boyer, William M. Y. Goh

Let be the number of partitions of an integer . For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polyno…

math.CO2007

Partition Polynomials: Asymptotics and Zeros

Robert P. Boyer, William M. Y. Goh

Let be the partition polynomial where is the number of partitions of with parts. We emphasize the computational experiments usin…

math.CO2004

On the Zero Attractor of the Euler Polynomials

William M. Y. Goh, Robert Boyer

We study the limiting behavior of the zeros of the Euler polynomials. When linearly scaled, they approach a definite curve in the complex plane related to the Szego curve which gov…

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

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…

math.CO2001★ 1 cited

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…