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 75293
This tag is used if a reference is needed in a paper or textbook on a specific result.
7
votes
3
answers
894
views
A definition of the fractional derivative
I was investigating the idea of fractional derivatives and devised the following definition. WHich definition is it equivalent to and can I have a reference for it?
$$\frac{d^n}{dx^n}f(x) = \lim_{h \ …
- 1,129
5
votes
0
answers
304
views
Generalization of Sprague-Grundy Theorem
In my research on Combinatorial Game Theory, I used a certain theorem that is essentially a generalization of the Sprague-Grundy theorem. Because the result hinges too much on the work of others to be …
- 1,129
3
votes
1
answer
335
views
Minimal Birthdays
In combinatorial game theory: The birthday of a game is defined recursively as 1 plus the maximal birthday of its options, with the zero game having birthday 0.
Suppose we define the quasi-birthday o …
- 1,129
1
vote
A definition of the fractional derivative
I believe my way corresponds to the Grunwald-Letnikov definition. Here is a nice article explaining the motivation behind fractional derivatives: http://www3.nd.edu/~msen/Teaching/UnderRes/FracCalc.pd …
- 1,129
0
votes
1
answer
386
views
Forbidden Tripartite Graphs
I was looking at extremal graph theory. I have understood the proofs of upper bounds for the Zarankiewicz problem which basically states: What can you say about the edges of a graph with $n$ vertices …
- 1,129