Herbert S. Wilf
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Herbert S. Wilf has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Doron Zeilberger
Temple University 19122 Philadelphia PA
3 shared publications - E. Rodney Canfield
Department of Computer Science University of Georgia 30602 Athens GA USA
3 shared publications - A. J. Hildebrand
University of Illinois Urbana 61801 IL
2 shared publications - Amy N. Myers
Bryn Mawr College in Bryn Mawr
2 shared publications - Edward A. Bender
Department of Mathematics University of California San Diego La Jolla 92091 CA
2 shared publications - Emeric Deutsch
Polytechnic Institute of New York University, Brooklyn, USA
2 shared publications
Latest Publications
- 5 August 2011
- Published by Springer Nature
- p. 39-46
On the Growth of Restricted Integer Partition Functions
- 5 August 2011
- Published by Springer Nature
- p. 39-46
On the Growth of Restricted Integer Partition Functions
- Open Access
- 2 January 2011
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 18 (2) , P23
The Distribution of Run Lengths in Integer Compositions
We find explicitly the generating function for the number of compositions of $n$ that avoid all words on a given list of forbidden subwords, in the case where the forbidden words are pairwise letter-disjoint. From this we get the gf for compositions of $n$ with no $k$ consecutive parts equal, as well as the number with $m$ parts and no consecutive $k$ parts being equal, which generalizes corresponding results for Carlitz compositions.- 2 January 2011
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 18 (2) , P23
Open AccessThe Distribution of Run Lengths in Integer Compositions
We find explicitly the generating function for the number of compositions of $n$ that avoid all words on a given list of forbidden subwords, in the case where the forbidden words are pairwise letter-disjoint. From this we get the gf for compositions of $n$ with no $k$ consecutive parts equal, as well as the number with $m$ parts and no consecutive $k$ parts being equal, which generalizes corresponding results for Carlitz compositions. - 13 December 2010
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 107 (52) , 22454-22456
There’s plenty of time for evolution
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 such estimates ignore the effects of natural selection, and that the numbers of necessary mutations are thereby reduced to about K log L , rather than K L , where L is the length of the genomic “word,” and K is the number of possible “letters” that can occupy any position in the word. The required theory makes contact with the theory of radix-exchange sorting in theoretical computer science, and the asymptotic analysis of certain sums that occur there.
- 13 December 2010
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 107 (52) , 22454-22456
There’s plenty of time for evolution
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 such estimates ignore the effects of natural selection, and that the numbers of necessary mutations are thereby reduced to about K log L , rather than K L , where L is the length of the genomic “word,” and K is the number of possible “letters” that can occupy any position in the word. The required theory makes contact with the theory of radix-exchange sorting in theoretical computer science, and the asymptotic analysis of certain sums that occur there.
- Open Access
There's plenty of time for evolution
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 such estimates ignore the effects of natural selection, and that the numbers of necessary mutations are thereby reduced to about $K\log{L}$, rather than $K^L$, where $L$ is the length of the genomic "word", and $K$ is the number of possible "letters" that can occupy any position in the word. The required theory makes contact with the theory of radix-exchange sorting in theoretical computer science, and the asymptotic analysis of certain sums that occur there.Open AccessThere's plenty of time for evolution
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 such estimates ignore the effects of natural selection, and that the numbers of necessary mutations are thereby reduced to about $K\log{L}$, rather than $K^L$, where $L$ is the length of the genomic "word", and $K$ is the number of possible "letters" that can occupy any position in the word. The required theory makes contact with the theory of radix-exchange sorting in theoretical computer science, and the asymptotic analysis of certain sums that occur there. - Open Access
How to lose as little as possible
Suppose Alice has a coin with heads probability $q$ and Bob has one with heads probability $p>q$. Now each of them will toss their coin $n$ times, and Alice will win iff she gets more heads than Bob does. Evidently the game favors Bob, but for the given $p,q$, what is the choice of $n$ that maximizes Alice's chances of winning? The problem of determining the optimal $N$ first appeared in \cite{wa}. We show that there is an essentially unique value $N(q,p)$ of $n$ that maximizes the probability $f(n)$ that the weak coin will win, and it satisfies $\frac{1}{2(p-q)}-\frac12\le N(q,p)\le \frac{\max{(1-p,q)}}{p-q}$. The analysis uses the multivariate form of Zeilberger's algorithm to find an indicator function $J_n(q,p)$ such that $J>0$ iff $n<N(q,p)$ followed by a close study of this function, which is a linear combination of two Legendre polynomials. An integration-based algorithm is given for computing $N(q,p)$.Open AccessHow to lose as little as possible
Suppose Alice has a coin with heads probability $q$ and Bob has one with heads probability $p>q$. Now each of them will toss their coin $n$ times, and Alice will win iff she gets more heads than Bob does. Evidently the game favors Bob, but for the given $p,q$, what is the choice of $n$ that maximizes Alice's chances of winning? The problem of determining the optimal $N$ first appeared in \cite{wa}. We show that there is an essentially unique value $N(q,p)$ of $n$ that maximizes the probability $f(n)$ that the weak coin will win, and it satisfies $\frac{1}{2(p-q)}-\frac12\le N(q,p)\le \frac{\max{(1-p,q)}}{p-q}$. The analysis uses the multivariate form of Zeilberger's algorithm to find an indicator function $J_n(q,p)$ such that $J>0$ iff $n<N(q,p)$ followed by a close study of this function, which is a linear combination of two Legendre polynomials. An integration-based algorithm is given for computing $N(q,p)$. - Open Access
Counting nondecreasing integer sequences that lie below a barrier
Given a barrier $0 \leq b_0 \leq b_1 \leq ...$, let $f(n)$ be the number of nondecreasing integer sequences $0 \leq a_0 \leq a_1 \leq ... \leq a_n$ for which $a_j \leq b_j$ for all $0 \leq j \leq n$. Known formul\ae for $f(n)$ include an $n \times n$ determinant whose entries are binomial coefficients (Kreweras, 1965) and, in the special case of $b_j = rj+s$, a short explicit formula (Proctor, 1988, p.320). A relatively easy bivariate recursion, decomposing all sequences according to $n$ and $a_n$, leads to a bivariate generating function, then a univariate generating function, then a linear recursion for $\{f(n) \}$. Moreover, the coefficients of the bivariate generating function have a probabilistic interpretation, leading to an analytic inequality which is an identity for certain values of its argument.Open AccessCounting nondecreasing integer sequences that lie below a barrier
Given a barrier $0 \leq b_0 \leq b_1 \leq ...$, let $f(n)$ be the number of nondecreasing integer sequences $0 \leq a_0 \leq a_1 \leq ... \leq a_n$ for which $a_j \leq b_j$ for all $0 \leq j \leq n$. Known formul\ae for $f(n)$ include an $n \times n$ determinant whose entries are binomial coefficients (Kreweras, 1965) and, in the special case of $b_j = rj+s$, a short explicit formula (Proctor, 1988, p.320). A relatively easy bivariate recursion, decomposing all sequences according to $n$ and $a_n$, leads to a bivariate generating function, then a univariate generating function, then a linear recursion for $\{f(n) \}$. Moreover, the coefficients of the bivariate generating function have a probabilistic interpretation, leading to an analytic inequality which is an identity for certain values of its argument. - 14 August 2008
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 166 (1) , 167-183
Left-to-right maxima in words and multiset permutations
- 14 August 2008
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 166 (1) , 167-183
Left-to-right maxima in words and multiset permutations
- 1 May 2008
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 115 (5) , 447-451
Extreme Palindromes
(2008). Extreme Palindromes. The American Mathematical Monthly: Vol. 115, No. 5, pp. 447-451.
- 1 May 2008
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 115 (5) , 447-451
Extreme Palindromes
(2008). Extreme Palindromes. The American Mathematical Monthly: Vol. 115, No. 5, pp. 447-451.
- 1 December 2007
- Published by Springer Nature in Annals of Combinatorics
- Vol. 11 (3-4) , 375-386
The Joint Distribution of Descent and Major Index over Restricted Sets of Permutations
- 1 December 2007
- Published by Springer Nature in Annals of Combinatorics
- Vol. 11 (3-4) , 375-386
The Joint Distribution of Descent and Major Index over Restricted Sets of Permutations
- 3 July 2007
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 104 (27) , 11189-11191
Computing the distribution of the maximum in balls-and-boxes problems with application to clusters of disease cases
We present a rapid method for the exact calculation of the cumulative distribution function of the maximum of multinomially distributed random variables. The method runs in time O(mn) , where m is the desired maximum and n is the number of variables. We apply the method to the analysis of two situations in which an apparent clustering of cases of a disease in some locality has raised epidemiological concerns, and these concerns have been discussed in the recent literature. We conclude that one of these clusters may be explained on purely random grounds, namely the leukemia cluster in Niles, IL, in 1956–1960; whereas the other, a leukemia cluster in Fallon, NV, in 1999–2001, may not.
- 3 July 2007
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 104 (27) , 11189-11191
Computing the distribution of the maximum in balls-and-boxes problems with application to clusters of disease cases
We present a rapid method for the exact calculation of the cumulative distribution function of the maximum of multinomially distributed random variables. The method runs in time O(mn) , where m is the desired maximum and n is the number of variables. We apply the method to the analysis of two situations in which an apparent clustering of cases of a disease in some locality has raised epidemiological concerns, and these concerns have been discussed in the recent literature. We conclude that one of these clusters may be explained on purely random grounds, namely the leukemia cluster in Niles, IL, in 1956–1960; whereas the other, a leukemia cluster in Fallon, NV, in 1999–2001, may not.