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 fixed-point-theorems
Search options not deleted
user 8628
A fixed-point theorem is a result saying that a function $F$ will have at least one fixed point (a point $x$ for which $F(x) = x$), under some conditions on $F$ that can be stated in general terms.
5
votes
1
answer
367
views
Connected vertex-transitive graph with the fixed-point property
Many connected vertex-transitive graphs $G=(V,E)$ have the property that some of their automorphisms other than the identity have fixed points. To point out two simple examples:
If $G = K_3$ then the …
- 48.9k
3
votes
Knaster Tarski theorem, example needed
In computer science, it is used in the field of denotational semantics and abstract interpretation, where the existence of fixed points can be exploited to guarantee well-defined semantics for a recur …
- 48.9k
2
votes
Knaster Tarski theorem, example needed
In this graph-theoretical post you find a very nice application of Knaster-Tarski to a generalization of Hall's Marriage Theorem.
- 48.9k