Search arXivSearch

arXiv · 1010.1922

Moment-angle complexes and polyhedral products for convex polytopes

Abstract

Let P be a convex polytope not simple in general. In the focus of this paper lies a simplicial complex K_P which carries complete information about the combinatorial type of P. In the case when P is simple, K_P is the same as dP*, where P* is a polar dual polytope. Using the canonical embedding of a polytope P into nonnegative orthant, we introduce a moment-angle space Z_P for a polytope P. It is known, that in the case when P is simple the space Z_P is homeomorphic to the polyhedral product (D^2,S^1)^{K_P}. When P is not simple, we prove that the space Z_P is homotopically equivalent to the space (D^2,S^1)^{K_P}. This allows to introduce bigraded Betti numbers for any convex polytope. A Stanley-Reisner ring of a polytope P can be defined as a Stanley-Reisner ring of a simplicial complex K_P. All these considerations lead to a natural question: which simplicial complexes arise as K_P for some polytope P? We have proceeded in this direction by introducing a notion of a polytopic simplicial complex. It has the following property: link of each simplex in a polytopic complex is either contractible, or retractible to a subcomplex, homeomorphic to a sphere. The complex K_P is a polytopic simplicial complex for any polytope P. Links of so called face simplices in a polytopic complex are polytopic complexes as well. This fact is sufficient enough to connect face polynomial of a simplicial complex K_P to the face polynomial of a polytope P, giving a series of inequalities on certain combinatorial characteristics of P. Two of these inequalities are equalities for each P and represent Euler-Poincare formula and one of Bayer-Billera relations for flag f-numbers. In the case when P is simple all inequalities turn out to be classical Dehn-Sommerville relations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A. A. Ayzenberg, V. M. Buchstaber. 2010-11-26. Moment-angle complexes and polyhedral products for convex polytopes. https://arxiv.org/abs/1010.1922

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO