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 26437
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
2
votes
2
answers
350
views
$(q, t)$-binomial coefficients
The $q$-binomial coefficients ${n + k \choose n}_q$ can be written as a sum
$${n + k \choose n}_q = \sum_{\lambda \subset (n^k)} q^{|\lambda|}\qquad (1)$$
where $(n^k) = (n, n, ..., n)$ is a partiti …
- 247
6
votes
Viennot-type geometric description for dual RSK correspondence?
As far as I know, the Viennot's construction only works for RS algorithm taking permutations as input. For matrices there's a generalised version called matrix-ball construction, which can be found in …
- 247
1
vote
1
answer
257
views
Name for series $\sum f_n x^n / (n! (n+k)!)$
Let $(f_n)_{n\ge0}$ be a real sequence. Then $\sum f_n {x^n \over n!}$ is called the exponential generating function of $(f_n)$.
Let $k\ge0$ be a nonnegative integer. If we add another factorial $(n+ …
- 247