activity
19922010
most citedLongest increasing subsequences in pattern-restricted permutations

43 citations · 152 across the 27 of their papers we have counts for

collaborators

27 papers

math.PR2010★ 21 cited

There's plenty of time for evolution

Herbert S. Wilf, Warren J. Ewens

Objections to Darwinian evolution are often based on the time required to carry out the necessary mutations. Seemingly, exponential numbers of mutations are needed. We show that su…

math.CO2010★ 4 cited

How to lose as little as possible

Vittorio Addona, Stan Wagon, Herb Wilf

Suppose Alice has a coin with heads probability and Bob has one with heads probability . Now each of them will toss their coin times, and Alice will win iff she gets m…

math.CO2009★ 2 cited

The distribution of longest run lengths in integer compositions

Herbert S. Wilf

We find the generating function for , the number of compositions of into positive parts all of whose runs (contiguous blocks of constant parts) have lengths less…

math.CO2009

Counting nondecreasing integer sequences that lie below a barrier

Robin Pemantle, Herbert S. Wilf

Given a barrier , let be the number of nondecreasing integer sequences for which for all…

math.CO2008★ 7 cited

On a conjecture of Ira Gessel

Marko Petkovsek, Herbert S. Wilf

Let F(m; n1, n2) denote the number of lattice walks from (0,0) to (n1,n2), always staying in the first quadrant {(n_1,n_2); n1 >= 0, n2 >= 0} and having exactly m steps, each of wh…

math.CO2007

Left-to-right maxima in words and multiset permutations

Amy Myers, Herb Wilf

We extend classical theorems of Renyi by finding the distributions of the numbers of both weak and strong left-to-right maxima (a.k.a. outstanding elements) in words over a given a…