1
$\begingroup$

This is just a stupid question about a good terminology. I'm interested in sequences $a_n$ with a growth that can be bounded by an arbitrarily small positive power of $n!$, i.e. for every $\epsilon > 0$ there should be a constant $c$ with $|a_n| \le c (n!)^{\epsilon}$. I wanted to call this growth "sub-factorial" but then I learned that there is already a "sub-factorial" $!n$. Any good suggestions?

$\endgroup$
4
  • 2
    $\begingroup$ Terminology or notation? For the latter, $\log(1+|a_n|)=o(n\log n)$. For the former, I do not know. $\endgroup$
    – Did
    Jun 14, 2011 at 17:42
  • $\begingroup$ It might help to take logarithms of both sides before looking for a name. Gerhard "Ask Me About System Design" Paseman, 2011.06.14 $\endgroup$ Jun 14, 2011 at 17:44
  • $\begingroup$ @Didier: thanks, I was mainly interested in terminology, so something like $1+|a_n|$ is of $n\log(n)$ growth does not seem to be less clumsy... $\endgroup$ Jun 14, 2011 at 17:59
  • $\begingroup$ @Gerhard: thanks for the comment, maybe I don't get it but I don't see how the estimate of Didier suggest a better name for the type of growth. $\endgroup$ Jun 14, 2011 at 18:00

1 Answer 1

1
$\begingroup$

In the need of a name, I would also go for "sub-factorial growth". In this case I see no danger of confusion; "sub-linear" and "sub-exponential growth" are already used in analogous meaning (even if not completely standard). Also note that in your condition you can replace $n!$ with $n^n$ (which unfortunately didn't give me better hints) .

$\endgroup$
2
  • 1
    $\begingroup$ I would have suggested log factorial or asymptotically log factorial to place some emphasis on the small exponent, but I am not thrilled with either of these choices. Gerhard "Ask Me About System Design" Paseman, 2011.06.14 $\endgroup$ Jun 14, 2011 at 18:15
  • 1
    $\begingroup$ Dear Pietro, dear Gerhard: well, thanks for the suggestions. It seems that there is no optimal solution. So I guess I will stick to the "sub-factorial" then :) $\endgroup$ Jun 14, 2011 at 18:26

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.