Convex polytopes, Coxeter orbifolds and torus actions
Convex polytopes, Coxeter orbifolds and torus actions
复制标题
DOI:
10.1215/s0012-7094-91-06217-4
复制
发表时间:
1991-03
影响因子:
2.5
通讯作者:
Michael W. Davis;T. Januszkiewicz
中科院分区:
文献类型:
--
作者:
Michael W. Davis;T. Januszkiewicz
0. Introduction. An n-dimensional convex polytope is simple if the number of codimension-one faces meeting at each vertex is n. In this paper we investigate certain group actions on manifolds, which have a simple convex polytope as orbit space. Let P" denote such a simple polytope. We have two situations in mind. (1) The group is Z, M" is n-dimensional and (2) The group is T", M is 2n-dimensional and M2"/T" P". Up to an automorphism of the group, the action is required to be locally isomorphic to the standard representation of Z. on in the second case. In the first case, we call M a "small cover" of P"; in the second, it is a "toric manifold" over P. First examples are provided by the natural actions of Z. and T" on RP" and CP", respectively. In both cases the orbit space is an n-simplex. Associated to a small cover of P", there is a homomorphism 2" Z’ Z, where m is the number of codimension-one faces of P". The homomorphism 2 specifies an isotropy subgroup for each codimension-one face. We call it a "characteristic function" of the small cover. Similarly, the characteristic function ofa toric manifold over pn is a map Z --) 7/". A basic result is that small covers and toric manifolds over P" are classified by their characteristic functions (see Propositions 1.7 and 1.8). The algebraic topology of these manifolds is very beautiful. The calculation of their homology and cohomology groups is closely related to some well-known constructions in commutative algebra and the combinatorial theory of convex polytopes. We discuss some of these constructions below. Let f denote the number of/-faces of P" and let h denote the coefficient of "in f(t 1). Then (fo, f,) is called the f-vector and (ho, h,) the h-vector of P". The f-vector and the h-vector obviously determine one another. The Upper Bound Theorem, due to McMullen, asserts that the inequality h < (,-,{-x), holds for all n-dimensional convex polytopes with m faces of codimension one. In 1971 McMullen conjectured simple combinatorial conditions on a sequence (h0, h,) of integers necessary and sufficient for it to be the h-vector of a simple convex polytope. The sufficiency of these conditions was proved by Billera and Lee and necessity by Stanley (see [Bronsted] for more details and references). Research on