A simplicial approach for discrete fixed point theorems

Xi Chen; Xiaotie Deng

doi:10.1007/11809678_3

A simplicial approach for discrete fixed point theorems

Xi Chen
, Xiaotie Deng

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

3 Citations (Scopus)

Abstract

We present a new discrete fixed point theorem based on a novel definition of direction-preserving maps over simplicial structures. We show that the result is more general and simpler than the two recent discrete fixed point theorems by deriving both of them from ours. The simplicial approach applied in the development of the new theorem reveals a clear structural comparison with the classical approach for the continuous case. © Springer-Verlag Berlin Heidelberg 2006.

Original language	English
Title of host publication	Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings
Publisher	Springer Verlag
Pages	3-12
Volume	4112 LNCS
ISBN (Print)	3540369252, 9783540369257
DOIs	https://doi.org/10.1007/11809678_3
Publication status	Published - 2006
Event	12th Annual International Conference on Computing and Combinatorics, COCOON 2006 - Taipei, Taiwan, China Duration: 15 Aug 2006 → 18 Aug 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4112 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	12th Annual International Conference on Computing and Combinatorics, COCOON 2006
Place	Taiwan, China
City	Taipei
Period	15/08/06 → 18/08/06

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Funding

Work supported by an SRG grant (No. 7001838) of City University of Hong Kong.

Access Output

10.1007/11809678_3

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Chen, X., & Deng, X. (2006). A simplicial approach for discrete fixed point theorems. In Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings (Vol. 4112 LNCS, pp. 3-12). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4112 LNCS). Springer Verlag. https://doi.org/10.1007/11809678_3

@inproceedings{6aa5f3c71b9241f1adf56082ac92d6a8,

title = "A simplicial approach for discrete fixed point theorems",

abstract = "We present a new discrete fixed point theorem based on a novel definition of direction-preserving maps over simplicial structures. We show that the result is more general and simpler than the two recent discrete fixed point theorems by deriving both of them from ours. The simplicial approach applied in the development of the new theorem reveals a clear structural comparison with the classical approach for the continuous case. {\textcopyright} Springer-Verlag Berlin Heidelberg 2006.",

author = "Xi Chen and Xiaotie Deng",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].; 12th Annual International Conference on Computing and Combinatorics, COCOON 2006 ; Conference date: 15-08-2006 Through 18-08-2006",

year = "2006",

doi = "10.1007/11809678\_3",

language = "English",

isbn = "3540369252",

volume = "4112 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "3--12",

booktitle = "Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings",

address = "Germany",

}

Chen, X & Deng, X 2006, A simplicial approach for discrete fixed point theorems. in Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. vol. 4112 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4112 LNCS, Springer Verlag, pp. 3-12, 12th Annual International Conference on Computing and Combinatorics, COCOON 2006, Taipei, Taiwan, China, 15/08/06. https://doi.org/10.1007/11809678_3

A simplicial approach for discrete fixed point theorems. / Chen, Xi; Deng, Xiaotie.
Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. Vol. 4112 LNCS Springer Verlag, 2006. p. 3-12 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4112 LNCS).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - A simplicial approach for discrete fixed point theorems

AU - Chen, Xi

AU - Deng, Xiaotie

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2006

Y1 - 2006

N2 - We present a new discrete fixed point theorem based on a novel definition of direction-preserving maps over simplicial structures. We show that the result is more general and simpler than the two recent discrete fixed point theorems by deriving both of them from ours. The simplicial approach applied in the development of the new theorem reveals a clear structural comparison with the classical approach for the continuous case. © Springer-Verlag Berlin Heidelberg 2006.

AB - We present a new discrete fixed point theorem based on a novel definition of direction-preserving maps over simplicial structures. We show that the result is more general and simpler than the two recent discrete fixed point theorems by deriving both of them from ours. The simplicial approach applied in the development of the new theorem reveals a clear structural comparison with the classical approach for the continuous case. © Springer-Verlag Berlin Heidelberg 2006.

UR - https://www.scopus.com/pages/publications/33749565606

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-33749565606&origin=recordpage

U2 - 10.1007/11809678_3

DO - 10.1007/11809678_3

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 3540369252

SN - 9783540369257

VL - 4112 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 3

EP - 12

BT - Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings

PB - Springer Verlag

T2 - 12th Annual International Conference on Computing and Combinatorics, COCOON 2006

Y2 - 15 August 2006 through 18 August 2006

ER -

Chen X, Deng X. A simplicial approach for discrete fixed point theorems. In Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. Vol. 4112 LNCS. Springer Verlag. 2006. p. 3-12. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11809678_3

A simplicial approach for discrete fixed point theorems

Abstract

Publication series

Conference

Bibliographical note

Funding

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this