Search arXivSearch

arXiv · 1009.6158

Polytopes with Special Simplices

Abstract

For a polytope P a simplex S with vertex set V(S) is called a special simplex if every facet of P contains all but exactly one vertex of S. For such polytopes P with face complex F(P) containing a special simplex the subcomplex F(P) / V(S) of all faces not containing vertices of S is the boundary of a polytope Q - the basis polytope of P. If additionally the dimension of the affine basis space of F(P) / V(S) equals dim(Q), we call P meek; otherwise we call P wild. We give a full combinatorial classification and techniques for geometric construction of the class of meek polytopes with special simplices. We show that every wild polytope P' with special simplex can be constructed out of a particular meek one P by intersecting P with particular hyperplanes. It is non-trivial to find all these hyperplanes for an arbitrary basis polytope; we give an exact description for 2-basis polytopes. Furthermore we show that the f-vector of each wild polytope with special simplex is component wise bounded above by the f-vector of a particular meek one which can be computed explicitly. Finally, we discuss the n-cube as a non-trivial example of a wild polytope with special simplex and prove that its basis polytope is the zonotope given by the Minkowski sum of the (n-1)-cube and the vector (1,...,1). Polytopes with special simplex have applications on Ehrhart theory, toric rings and were just used by Francisco Santos to construct a counter-example disproving the Hirsch conjecture.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Timo de Wolff. 2010-09-30. Polytopes with Special Simplices. https://arxiv.org/abs/1009.6158

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