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 27069
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
3
votes
1
answer
219
views
Sum over integer compositions of $m$ with $n$ parts of a fixed monomial in the parts
Is there an explicit formula for the following quantity?
$$f_m(a_1,\ldots,a_n):=\sum_{\substack{k_1+\ldots+k_n=m \\ k_1,\ldots,k_n\in \mathbb{N}}} k_1^{a_1}\ldots k_n^{a_n}\ ,\hspace{1cm} m,a_1,\ldot …
- 34.3k