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 6107
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
1
vote
The first eigenvalue of a graph - what does it reflect?
I am not at all an expert on this, but I believe that the largest eigenvalue plays a role in several graph processes that people working in "network science" are interested in. A google search for "la …
- 3,202
1
vote
Accepted
Generating function for $t$-residues of partitions using Heisenberg + $\hat{sl_t}$ represent...
Denote by $\tilde{\mathcal F}$ the Fock space representation of $\widehat{sl}_t$. In fact it is even a $\widehat{gl}_t$-module, and as such irreducible. Now \begin{equation}\widehat{gl}_t= \widehat{sl …
- 3,202