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 40349
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
1
vote
Evaluation of a complete homogeneous symmetric polynomial related to Stirling number of 2nd ...
Consider the fact that
$$
\prod_{i=1}^k \frac{1}{1-x_i t} = \sum_j h_j(x_1,\dots,x_k) t^j
$$
Writing $h_j = h_{j+k-k}$ we get from your first fact:
$$
\prod_{i=1}^k \frac{1}{1- i t} = \sum_j S(j+k,k) …
- 273