• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Decompositions of simplicial balls and spheres with knots consisting of few edges (2000)

by M Hachimori, G Ziegler
Venue:Math. Z
Add To MetaCart

Tools

Sorted by:
Results 1 - 7 of 7

Small examples of nonconstructible simplicial balls and spheres

by Frank H. Lutz - SIAM J. Discrete Math , 2004
"... We construct non-constructible simplicial d-spheres with d + 10 vertices and non-constructible, non-realizable simplicial d-balls with d + 9 vertices for d≥3. 1 ..."
Abstract - Cited by 8 (4 self) - Add to MetaCart
We construct non-constructible simplicial d-spheres with d + 10 vertices and non-constructible, non-realizable simplicial d-balls with d + 9 vertices for d≥3. 1

One-point suspensions and wreath products of polytopes and spheres

by Michael Joswig, Frank, H. Lutz
"... Abstract. It is known that the suspension of a simplicial complex can be realized with only one additional point. Suitable iterations of this construction generate highly symmetric simplicial complexes with various interesting combinatorial and topological properties. In particular, infinitely many ..."
Abstract - Cited by 7 (2 self) - Add to MetaCart
Abstract. It is known that the suspension of a simplicial complex can be realized with only one additional point. Suitable iterations of this construction generate highly symmetric simplicial complexes with various interesting combinatorial and topological properties. In particular, infinitely many non-PL spheres as well as contractible simplicial complexes with a vertex-transitive group of automorphisms can be obtained in this way. 1.

Non-constructible complexes and the bridge index

by Richard Ehrenborg, Masahiro Hachimori , 1999
"... We show that if a 3-dimensional polytopal complex has a knot in its 1-skeleton, where the bridge index of the knot is larger than the number of edges of the knot, then the complex is not constructible, and hence, not shellable. As an application we settle a conjecture of Hetyei concerning the shella ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
We show that if a 3-dimensional polytopal complex has a knot in its 1-skeleton, where the bridge index of the knot is larger than the number of edges of the knot, then the complex is not constructible, and hence, not shellable. As an application we settle a conjecture of Hetyei concerning the shellability of cubical barycentric subdivisions of 3-spheres. We also obtain similar bounds concluding that a 3-sphere or 3-ball is non-shellable or not vertex decomposable. These two last bounds are sharp.

Polytope Skeletons And Paths

by Gil Kalai - Handbook of Discrete and Computational Geometry (Second Edition ), chapter 20
"... INTRODUCTION The k-dimensional skeleton of a d-polytope P is the set of all faces of the polytope of dimension at most k. The 1-skeleton of P is called the graph of P and denoted by G(P ). G(P ) can be regarded as an abstract graph whose vertices are the vertices of P , with two vertices adjacent i ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
INTRODUCTION The k-dimensional skeleton of a d-polytope P is the set of all faces of the polytope of dimension at most k. The 1-skeleton of P is called the graph of P and denoted by G(P ). G(P ) can be regarded as an abstract graph whose vertices are the vertices of P , with two vertices adjacent if they form the endpoints of an edge of P . In this chapter, we will describe results and problems concerning graphs and skeletons of polytopes. In Section 17.1 we briefly describe the situation for 3polytopes. In Section 17.2 we consider general properties of polytopal graphs--- subgraphs and induced subgraphs, connectivity and separation, expansion, and other properties. In Section 17.3 we discuss problems related to diameters of polytopal graphs in connection with the simplex algorithm and t

Higher minors and Van Kampen’s obstruction

by Eran Nevo - Math. Scand
"... We generalize the notion of graph minors to all (finite) simplicial complexes. For every two simplicial complexes H and K and every nonnegative integer m, we prove that if H is a minor of K then the non vanishing of Van Kampen’s obstruction in dimension m (a characteristic class indicating non embed ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
We generalize the notion of graph minors to all (finite) simplicial complexes. For every two simplicial complexes H and K and every nonnegative integer m, we prove that if H is a minor of K then the non vanishing of Van Kampen’s obstruction in dimension m (a characteristic class indicating non embeddability in the (m − 1)-sphere) for H implies its non vanishing for K. As a corollary, based on results by Van Kampen [20] and Flores [5], if K has the d-skeleton of the (2d+2)simplex as a minor, then K is not embeddable in the 2d-sphere. We answer affirmatively a problem asked by Dey et. al. [3] concerning topology-preserving edge contractions, and conclude from it the validity of the generalized lower bound inequalities for a special class of triangulated spheres. 1

Counterexamples in discrete geometry

by Huntington Tracy Hall
"... by ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found

VERTEX COLORINGS OF SIMPLICIAL COMPLEXES

by Natalia Dobrinskaya, Jesper M. Møller, Dietrich Notbohm
"... 1.1. Notation and the basic definition 2 2. Davis–Januszkiewicz spaces 3 3. The Stanley–Reisner face algebra 4 ..."
Abstract - Add to MetaCart
1.1. Notation and the basic definition 2 2. Davis–Januszkiewicz spaces 3 3. The Stanley–Reisner face algebra 4
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University