6 citations · 14 across the 11 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2009★ 1 cited
Characteristic Points of Recursive Systems
Jason Bell, Stanley Burris, Karen Yeats
Characteristic points have been a primary tool in the study of a generating function defined by a single recursive equation. We investigate the proper way to adapt this tool when w…
math.CO2006
Sufficient Conditions for Labelled 0-1 Laws
Stanley Burris, Karen Yeats
If F(x) = e^G(x), where F(x) = \sum f(n)x^n and $G(x) = \sum g(n)x^n, with 0 \le g(n) = O(n^{theta n}/n!),theta in (0,1), and gcd(n : g(n) > 0)=1, then f(n) = o(f(n-1)). This gives…
math.CO2005★ 4 cited
Counting Rooted Trees: The Universal Law t(n) ~ C ρ^{-n} n^{-3/2}
Jason P. Bell, Stanley N. Burris, Karen A. Yeats
Combinatorial classes T that are recursively defined using combinations of the standard multiset, sequence, directed cycle and cycle constructions, and their restrictions, have gen…