论文信息 - A new cubical h-vector

A new cubical h-vector

Abstract A new definition of an h -vector for cubical polytopes (and complexes) is introduced. It has many properties in common with the well-known h -vector for simplicial polytopes. In particular, it is symmetric, nonnegative and easily computable from a shelling of the polytope. Lower or upper bounds on its components imply corresponding bounds on the face numbers.

Ron M. Adin | R. Adin

[1] Clara Chan. Plane Trees and H-Vectors of Shellable Cubical Complexes , 1991, SIAM J. Discret. Math..

[2] P. McMullen. The maximum numbers of faces of a convex polytope , 1970 .

[3] Richard P. Stanley,et al. Generalized $H$-Vectors, Intersection Cohomology of Toric Varieties, and Related Results , 1987 .

[4] P. McMullen. The numbers of faces of simplicial polytopes , 1971 .

[5] William Jockusch. The lower and upper bound problems for cubical polytopes , 1993, Discret. Comput. Geom..

[6] R. Stanley. The number of faces of a simplicial convex polytope , 1980 .

[7] Carl W. Lee,et al. A Proof of the Sufficiency of McMullen's Conditions for f-Vectors of Simplicial Convex Polytopes , 1981, J. Comb. Theory A.

[8] R. Stanley. What Is Enumerative Combinatorics , 1986 .

[9] P. Mani,et al. Shellable Decompositions of Cells and Spheres. , 1971 .

[10] Gerd Blind,et al. Gaps in the numbers of vertices of cubical polytopes, I , 1994, Discret. Comput. Geom..

[11] R. Blind,et al. Convex polytopes without triangular faces , 1990 .