Sperner's lemma
Uitgelicht
|
26,94 |
Naar shop
|
|
26,94 |
Naar shop
|
|
116,00 |
Naar shop
|
Beschrijving
Bol
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, Sperner's lemma is a combinatorial analog of the Brouwer fixed point theorem. Sperner's lemma states that every Sperner coloring of a triangulation of an n-dimensional simplex contains a cell colored with a complete set of colors. The initial result of this kind was proved by Emanuel Sperner, in relation with proofs of invariance of domain. Sperner colorings have been used for effective computation of fixed points, in root-finding algorithms, and are applied in fair division algorithms.
Beschrijving
(2)
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, Sperner's lemma is a combinatorial analog of the Brouwer fixed point theorem. Sperner's lemma states that every Sperner coloring of a triangulation of an n-dimensional simplex contains a cell colored with a complete set of colors. The initial result of this kind was proved by Emanuel Sperner, in relation with proofs of invariance of domain. Sperner colorings have been used for effective computation of fixed points, in root-finding algorithms, and are applied in fair division algorithms.
AmazonPagina's: 72, Paperback, Betascript Publishers
Productspecificaties
Prijshistorie
* Prijshistorie bevat geen data van Amazon, Amazon Marketplace.
Prijzen voor het laatst bijgewerkt op:
Gerelateerde producten
