Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with co.combinatorics
Search options not deleted
user 80903
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
0
votes
1
answer
161
views
Asymptotics of certain sum with alternating sign (inclusion exclusion principle)
I'm aware of the replies to this question, but I was not able to apply the suggested methods in my case.
I would like to compute the asymptotics of the resulting sum $S$ when computing the number of p …
CommunityBot
- 1
1
vote
Asymptotics of certain sum with alternating sign (inclusion exclusion principle)
The result is effectively derived in the reference for above. I overlooked this at first.
- 285