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 35416
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
11
votes
A sum involving derivatives of Vandermonde
Here is a direct way to obtain Denis Serre's formula:
Just note that $x_i^k\frac{\partial^k}{\partial x_i^k}$ multiplies a monomial in the determinant by $\frac{r!}{(r-k)!}$ where $r$ is the power of …
- 13k
13
votes
Branching rule from symmetric group $S_{2n}$ to hyperoctahedral group $H_n$
This is an answer to the second question: I ran an experiment with $S_6$ (which was the best guess due to the famous "oddness" of 6). There are two subgroups in $S_6$ isomorphic to this involution cen …
- 13k
47
votes
Accepted
Roots of permutations
$\DeclareMathOperator{\GL}{GL}
\DeclareMathOperator{\SL}{SL}$
The maximum of the function counting square roots is attained at $x_0=1$ and this statement generalises quite well.
Let $s(\chi)$ denote …
- 13k