Advertisement

Lattice Embedding of Direction-Preserving Correspondence over Integrally Convex Set

(Extended Abstract)
  • Xi Chen
  • Xiaotie Deng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4041)

Abstract

consider the relationship of two fixed point theorems for direction-preserving discrete correspondences. We show that, for any space of no more than three dimensions, the fixed point theorem [4] of Iimura, Murota and Tamura, on integrally convex sets can be derived from Chen and Deng’s fixed point theorem [2] on lattices by extending every direction-preserving discrete correspondence over an integrally convex set to one over a lattice. We present a counter example for the four dimensional space. Related algorithmic results are also presented for finding a fixed point of direction-preserving correspondences on integrally convex sets, for spaces of all dimensions.

Keywords

Time Complexity Point Theorem Fixed Point Theorem Test Point Point Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chen, X., Deng, X.: Lattice Embedding of Direction-Preserving Correspondence Over Integrally Convex Set (Full version) (manuscript), available at: http://www.cs.cityu.edu.hk/~deng/
  2. 2.
    Chen, X., Deng, X.: On algorithms for discrete and approximate brouwer fixed points. In: STOC 2005, pp. 323–330 (2005)Google Scholar
  3. 3.
    Crescenzi, P., Silvestri, R.: Sperner’s lemma and robust machines. Comput. Complexity 2(7), 163–173 (1998)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Iimura, T.: A discrete fixed point theorem and its applications. J. of Mathematical Economics 7(39), 725–742 (2003)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Papadimitriou, C., Hirsch, M.D., Vavasis, S.: Exponential lower bounds for finding brouwer fixed points. J. Complexity (5), 379–416 (1989)Google Scholar
  6. 6.
    Murota, K., Iimura, T., Tamura, A.: Discrete fixed point theorem reconsidered. J. of Mathematical Economics (to appear)Google Scholar
  7. 7.
    Santha, M., Friedl, K., Ivanyos, G., Verhoeven, F.: On the black-box complexity of sperner’s lemma. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 245–257. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Talman, D., Laan, G., Yang, Z.: Solving discrete zero point problems. In: Tinbergen Institute Discussion Papers (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xi Chen
    • 1
  • Xiaotie Deng
    • 2
  1. 1.Department of Computer ScienceTsinghua UniversityBeijingP.R. China
  2. 2.Department of Computer ScienceCity University of Hong KongHong Kong SAR

Personalised recommendations