Logo

Login | Create Account

Geometric Realization of Simplicial Complexes

Ossona de Mendez, Patrice (1999) Geometric Realization of Simplicial Complexes. [Conference Paper]

Full text not available from this repository.

Abstract

We show that an abstract simplicial complex \Delta may be realized on a grid of \mathbb{R}^{d-1}, where d = dim P(\Delta) is the order dimension (Dushnik-Miller dimension) of the face poset of \Delta.

Item Type:Conference Paper
Classifications:Z Theory > Z.250 Geometry
ID Code:360
Deposited By:Maciejak, Agnes
Deposited On:23 Nov 2004
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=1731&spage=323

Repository Staff Only: item control page

References

1. L. Barany, R. Howe, and H. Scarf, The complex of maximal lattice free simplices, Mathematical Programming 66 (Ser. A) (1994), 273-281.

2. D. Bayer, I. Peeva, and B. Sturmfels, Monomial resolutions, AMS electronic preprint #199610-14-012, 1996, (a.k.a. alg-geom/9610012).

3. G. Brightwell and W. T. Trotter, The order dimension of convex polytopes, SIAM Journal of Discrete Mathematics 6 (1993), 230-245.

4. G. Brightwell and W. T. Trotter, The order dimension of planar maps, SIAM Journal of Discrete Mathematics 10 (1997), no. 4, 515-528.

5. H. de Fraysseix and P. Ossona de Medez, On topological aspects of orientations, Proc. of the Fifth Czech-Slovak Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Discrete Math., (to appear).

6. H. de Fraysseix and P. Ossona de Medez, Regular orientations, arboricity and augmentation, DIMACS International Workshop, Graph Drawing 94, Lecture Notes in Computer Science, vol. 894, 1995, pp. 111-118.

7. H. de Fraysseix, P. Ossona de Medez, and P. Rosenstiehl, On triangle contact graphs, Combinatorics, Probability and Computing 3 (1994), 233-246.

8. H. de Fraysseix, J. Pach, and R. Pollack, Small sets supporting Fary embeddings of planar graphs, Twentieth Annual ACM Symposium on Theory of Computing, 1988, pp. 426-433.

9. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid, Combinatorica 10 (1990), 41-51.

10. B. Dushnik, Concerning a certain set of arrangements, Proceedings of the AMS, vol. 1, 1950, pp. 788-796.

11. B. Dushnik and E. W. Miller, Partially ordered sets, Amer. J. Math. 63 (1941), 600-610.

12. T. Hibi, Algebraic combinatorics, Carlslaw Publications, 1992.

13. G. Kant, Algorithms for drawing planar graphs, Ph. D. thesis, Utrecht University, Utrecht, 1993.

14. H. Scarf, The computation of economic equilibria, Cowles foundation monograph, vol. 24, Yale University Press, 1973.

15. W. Schnyder, Planar graphs and poset dimension, Order 5 (1989), 323-343.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.