Jump to content

Discrete fixed-point theorem

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Erel Segal (talk | contribs) at 13:55, 9 March 2020 (Created page with 'In discrete mathematics, a '''discrete fixed-point theorem''' is a fixed-point theorem for functions defined on finite sets, typically subsets of the int...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In discrete mathematics, a discrete fixed-point theorem is a fixed-point theorem for functions defined on finite sets, typically subsets of the integer grid.

Discrete fixed-point theorems were developed by Iimura,[1] Murota and Tamura[2], Yang,[3] Chen and Deng,[4] and others.

References

  1. ^ Iimura, Takuya (2003-09-01). "A discrete fixed point theorem and its applications". Journal of Mathematical Economics. 39 (7): 725–742. doi:10.1016/S0304-4068(03)00007-7. ISSN 0304-4068.
  2. ^ Iimura, Takuya; Murota, Kazuo; Tamura, Akihisa (2005-12-01). "Discrete fixed point theorem reconsidered". Journal of Mathematical Economics. 41 (8): 1030–1036. doi:10.1016/j.jmateco.2005.03.001. ISSN 0304-4068.
  3. ^ Yang, Zaifu (2009-12-01) [2004 (FBA working paper no. 210, Yokohama National University)]. "Discrete fixed point analysis and its applications". Journal of Fixed Point Theory and Applications. 6 (2): 351–371. doi:10.1007/s11784-009-0130-9. ISSN 1661-7746.
  4. ^ Chen, Xi; Deng, Xiaotie (2006). Chen, Danny Z.; Lee, D. T. (eds.). "A Simplicial Approach for Discrete Fixed Point Theorems". Computing and Combinatorics. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer: 3–12. doi:10.1007/11809678_3. ISBN 978-3-540-36926-4.