LRL. Bruce Richmond
L. Bruce Richmond
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
L. Bruce Richmond has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Edward A. Bender
Department of Mathematics University of California San Diego La Jolla 92091 CA
5 shared publications - E. Rodney Canfield
Department of Computer Science University of Georgia 30602 Athens GA USA
3 shared publications - Herbert S. Wilf
University of Pennsylvania
2 shared publications - Adri B. Olde Daalhuis
University of Edinburgh
1 shared publication - Andrew Granville
Départment de mathématiques et statistique, Université de Montréal
1 shared publication - Atefeh Mashatan
University of Waterloo
1 shared publication
Latest Publications
- Open Access
Natural exact covering systems and the reversion of the Möbius series
We prove that the number of natural exact covering systems of cardinality $k$ is equal to the coefficient of $x^k$ in the reversion of the power series $\sum_{k \ge 1} \mu (k) x^k$, where $\mu(k)$ is the usual number-theoretic M\"obius function. Using this result, we deduce an asymptotic expression for the number of such systems.Open AccessNatural exact covering systems and the reversion of the Möbius series
We prove that the number of natural exact covering systems of cardinality $k$ is equal to the coefficient of $x^k$ in the reversion of the power series $\sum_{k \ge 1} \mu (k) x^k$, where $\mu(k)$ is the usual number-theoretic M\"obius function. Using this result, we deduce an asymptotic expression for the number of such systems. - Open Access
- 5 January 2010
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 17 (1) , R1
Asymptotics of Some Convolutional Recurrences
We study the asymptotic behavior of the terms in sequences satisfying recurrences of the form $a_n = a_{n-1} + \sum_{k=d}^{n-d} f(n,k) a_k a_{n-k}$ where, very roughly speaking, $f(n,k)$ behaves like a product of reciprocals of binomial coefficients. Some examples of such sequences from map enumerations, Airy constants, and Painlevé I equations are discussed in detail.- 5 January 2010
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 17 (1) , R1
Open AccessAsymptotics of Some Convolutional Recurrences
We study the asymptotic behavior of the terms in sequences satisfying recurrences of the form $a_n = a_{n-1} + \sum_{k=d}^{n-d} f(n,k) a_k a_{n-k}$ where, very roughly speaking, $f(n,k)$ behaves like a product of reciprocals of binomial coefficients. Some examples of such sequences from map enumerations, Airy constants, and Painlevé I equations are discussed in detail. - Open Access
- 1 January 2008
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 15 (1) , R21
Coefficients of Functional Compositions Often Grow Smoothly
The coefficients of a power series $A(x)$ are smooth if $a_{n-1}/a_n$ approaches a limit. If $A(x)=F(G(x))$ and $f_n^{1/n}$ approaches a limit, then the coefficients of $A(x)$ are often smooth. We use this to show that the coefficients of the exponential generating function for graphs embeddable on a given surface are smooth, settling a problem of McDiarmid.- 1 January 2008
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 15 (1) , R21
Open AccessCoefficients of Functional Compositions Often Grow Smoothly
The coefficients of a power series $A(x)$ are smooth if $a_{n-1}/a_n$ approaches a limit. If $A(x)=F(G(x))$ and $f_n^{1/n}$ approaches a limit, then the coefficients of $A(x)$ are often smooth. We use this to show that the coefficients of the exponential generating function for graphs embeddable on a given surface are smooth, settling a problem of McDiarmid. - Open Access
A Discontinuity in the Distribution of Fixed Point Sums
The quantity $f(n,r)$, defined as the number of permutations of the set $[n]=\{1,2,... n\}$ whose fixed points sum to $r$, shows a sharp discontinuity in the neighborhood of $r=n$. We explain this discontinuity and study the possible existence of other discontinuities in $f(n,r)$ for permutations. We generalize our results to other families of structures that exhibit the same kind of discontinuities, by studying $f(n,r)$ when ``fixed points'' is replaced by ``components of size 1'' in a suitable graph of the structure. Among the objects considered are permutations, all functions and set partitions.Open AccessA Discontinuity in the Distribution of Fixed Point Sums
The quantity $f(n,r)$, defined as the number of permutations of the set $[n]=\{1,2,... n\}$ whose fixed points sum to $r$, shows a sharp discontinuity in the neighborhood of $r=n$. We explain this discontinuity and study the possible existence of other discontinuities in $f(n,r)$ for permutations. We generalize our results to other families of structures that exhibit the same kind of discontinuities, by studying $f(n,r)$ when ``fixed points'' is replaced by ``components of size 1'' in a suitable graph of the structure. Among the objects considered are permutations, all functions and set partitions. - Open Access
- 6 January 2003
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 10 (1) , R15
A Discontinuity in the Distribution of Fixed Point Sums
The quantity $f(n,r)$, defined as the number of permutations of the set $[n]=\{1,2,\dots n\}$ whose fixed points sum to $r$, shows a sharp discontinuity in the neighborhood of $r=n$. We explain this discontinuity and study the possible existence of other discontinuities in $f(n,r)$ for permutations. We generalize our results to other families of structures that exhibit the same kind of discontinuities, by studying $f(n,r)$ when "fixed points" is replaced by "components of size 1" in a suitable graph of the structure. Among the objects considered are permutations, all functions and set partitions.- 6 January 2003
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 10 (1) , R15
Open AccessA Discontinuity in the Distribution of Fixed Point Sums
The quantity $f(n,r)$, defined as the number of permutations of the set $[n]=\{1,2,\dots n\}$ whose fixed points sum to $r$, shows a sharp discontinuity in the neighborhood of $r=n$. We explain this discontinuity and study the possible existence of other discontinuities in $f(n,r)$ for permutations. We generalize our results to other families of structures that exhibit the same kind of discontinuities, by studying $f(n,r)$ when "fixed points" is replaced by "components of size 1" in a suitable graph of the structure. Among the objects considered are permutations, all functions and set partitions.