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 reference-request
Search options not deleted
user 23980
This tag is used if a reference is needed in a paper or textbook on a specific result.
10
votes
2
answers
5k
views
Cohen-Lenstra Heuristics reference
I am looking for good references (preferably, books) on Cohen-Lenstra Heuristics (on Real Quadratic fields) which explain in detail the reasons behind its fundamental assumption (higher the cardinalit …
- 1,305
3
votes
0
answers
268
views
A generalization of Rogers-Ramanujan identity
The generalized Rogers-Ramanujan identity has the following form
$$\sum_{k_1\geq\cdots\geq k_r\geq 0}\frac{x^{k_1^2+\cdots +k_r^2+k_i+\cdots +k_r}}{(x)_{k_1-k_2}\cdots (x)_{k_{r-1}-k_r}(x)_{k_r}}=\pr …
- 1,305
2
votes
Proofs by Schubert calculus and combinatorics
Unimodality of partitions inside a box of size $m\times n$ (i.e. partitions with number of parts at most $m$ and size of the largest part at most $n$) follows from applying Hard Lefschetz Theorem to t …
- 1,305
2
votes
0
answers
88
views
Rank-unimodality and Sperner property of higher dimensional partitions
I did a google-search but have not been able to find much reference on this problem. So I am asking it here hoping to get some information.
Consider the set of all 4-dimensional Ferrer's diagram cont …
- 1,305
0
votes
2
answers
94
views
Isometric path cover number of the 2 dimensional grid graph
I am looking for a proof of the fact that at least $2n/3$ isometric paths (i.e. shortest paths between the end points) are required to cover the vertices of the $n\times n$ grid graph (i.e. Cartesian …
- 1,305