When computing the asymptotics of a series, a common idea is to find a generating function, then use singularity analysis to get asymptotics for your series.
Sage actually has methods that do this built-in (see here and here) but the latter (which returns an asymptotic series) requires us to input a list of dominant singularities by hand. (It also doesn't work with inputs coming from the symbolic ring, but that's a separate issue, which I might try to fix at some point).
Since in simple cases we can tell where the singularities are "at a glance" by checking for zeros in the denominator, under radicals, and inside logs, it seems like we would be able to algorithmically find the singularities by (for instance) going through the expression tree and solving for $0$ anytime we see a log, a denominator, or a fractional power.
Has anybody implemented this? Or has there been discussion about it? If not, do you know if any of sage's interfaces provide this functionality?
Thanks in advance!
