Skip to main content
David Galvin's user avatar
David Galvin's user avatar
David Galvin's user avatar
David Galvin
  • Member for 12 years, 9 months
  • Last seen more than 4 years ago
awarded
awarded
Loading…
awarded
Loading…
accepted
comment
Asymptotics of sum involving Stirling numbers
Thank you, this is really nice!
comment
Asymptotics of sum involving Stirling numbers
@RichardStanley I have corrected the sum --- the power of $\beta$ should have been $j$ rather than $n$.
revised
Asymptotics of sum involving Stirling numbers
Corrected typo in summation --- power of $\beta$ should have been $j$, not $n$.
Loading…
comment
Asymptotics of sum involving Stirling numbers
Yes, my sum has a falling rather than a rising power. But as observed in a comment in the earlier question, when the argument of the Pochhammer symbol is constant (not depending on n), there's not any difference in difficulty between falling and rising power.
asked
Loading…
awarded
awarded
awarded
awarded
comment
Independent sets of subsets
There is a very nice recent survey of progress on these kinds of problems, by Griggs and Li, at link.springer.com/chapter/10.1007%2F978-3-319-24298-9_14. Thm 1.2 covers your updated question.
awarded
awarded
comment
Name for a class of graphs
Thanks! It seems that I am working exactly with chordal graphs.