Given a convex polytope P, how does the usual affine dimension dimp(P) correlate with dimO(L(P)), the order dimension of the face lattice of P? It will be shown that dimP(P) + 1 ⩽ dimO(P)), that equality holds for some of the standard examples, but that the order dimension of cyclic polytopes C(n, d) can be arbitrarily large for fixed d ⩾ 4. Using the Four Colour Theorem it is easy to show that a simple 3-dimensional convex polytope has order dimension at most 8
AbstractWe introduce the property of convex normality of rational polytopes and give a dimensionally...
In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We ...
Abstract Since at least half of the d edges incident to a vertex u of a simple d-polytope P either a...
<p>Metric dimension is a~generalization of affine dimension to arbitrary metric spaces (provided a r...
AbstractFor P a d-dimensional convex polytope and S = {i1,…, is} ⊂ {0, 1,…, d−1}, let fs(P) be the n...
AbstractWe introduce a notion of dimension of max–min convex sets, following the approach of tropica...
In 1980, Arnold studied the classification problem for convex lattice polygons of given area. Since ...
We introduce a partial order on pictures (matrices), denoted by 7c that extends to two dimensions t...
Abstract. We give a lower bound for the number of vertices of a general d-dimensional polytope with ...
AbstractIf P and Q are partial orders, then the dimension of the cartesian product P × Q does not ex...
For a $d$-dimensional convex lattice polytope $P$, a formula for the boundary volume $\vol{\partial ...
AbstractTo each finite set with at least two elements, there corresponds a partial order polytope. I...
Robertson in 1988 suggested a model for the realization space of a convex d-dimensional polytope and...
AbstractLet P be a d-polytope. For a set of indices S = {1, i2, …, ik}, 0 ⩽ i1 < i2 < … < ik ⩽ d − 1...
International audienceApproximating convex bodies succinctly by convex polytopes is a fundamental pr...
AbstractWe introduce the property of convex normality of rational polytopes and give a dimensionally...
In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We ...
Abstract Since at least half of the d edges incident to a vertex u of a simple d-polytope P either a...
<p>Metric dimension is a~generalization of affine dimension to arbitrary metric spaces (provided a r...
AbstractFor P a d-dimensional convex polytope and S = {i1,…, is} ⊂ {0, 1,…, d−1}, let fs(P) be the n...
AbstractWe introduce a notion of dimension of max–min convex sets, following the approach of tropica...
In 1980, Arnold studied the classification problem for convex lattice polygons of given area. Since ...
We introduce a partial order on pictures (matrices), denoted by 7c that extends to two dimensions t...
Abstract. We give a lower bound for the number of vertices of a general d-dimensional polytope with ...
AbstractIf P and Q are partial orders, then the dimension of the cartesian product P × Q does not ex...
For a $d$-dimensional convex lattice polytope $P$, a formula for the boundary volume $\vol{\partial ...
AbstractTo each finite set with at least two elements, there corresponds a partial order polytope. I...
Robertson in 1988 suggested a model for the realization space of a convex d-dimensional polytope and...
AbstractLet P be a d-polytope. For a set of indices S = {1, i2, …, ik}, 0 ⩽ i1 < i2 < … < ik ⩽ d − 1...
International audienceApproximating convex bodies succinctly by convex polytopes is a fundamental pr...
AbstractWe introduce the property of convex normality of rational polytopes and give a dimensionally...
In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We ...
Abstract Since at least half of the d edges incident to a vertex u of a simple d-polytope P either a...