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 113397
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
7
votes
2
answers
288
views
Signs of Kravchuk matrix asymptotically produce a large circular region with hyperbolic sink...
The Kravchuk matrix of dimension $n+1$ is such that its entries satisfy $$K_{i,j}^{(n+1)}=[x^i](1+x)^{n-j}(1-x)^j\quad\forall0\le i,j\le n.$$ It enjoys properties such as involution and has various ex …
- 1,459