AbstractA 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
jockusch(a3 mat h.lsa.umich.edu Abstract. We construct a family of cubical polytypes which shows tha...
AbstractThe upper bound inequality[formula](0⩽i⩽d/2) is proved for the torich-vector of a rational c...
AbstractLet P be a d-polytope. For a set of indices S = {1, i2, …, ik}, 0 ⩽ i1 < i2 < … < ik ⩽ d − 1...
AbstractA new definition of an h-vector for cubical polytopes (and complexes) is introduced. It has ...
We construct a family of cubical polytypes which shows that the upper bound on the number of facets ...
AbstractSeveral recent papers have addressed the problem of characterizing the f-vectors of cubical ...
AbstractIt is proved that equality in the Generalized Simplicial Lower Bound Conjecture can always b...
AbstractAs is well known, h-vectors of simplicial convex polytopes are characterized. Those h-vector...
Possibly the most fundamental combinatorial invariant associated to a finite simplicial complex is i...
Thesis (Ph.D.)--University of Washington, 2022A key tool that combinatorialists use to study simplic...
In geometric, algebraic, and topological combinatorics, properties such as symmetry, unimodality, an...
International audiencethis is an extended abstract of the full version. We study n-vertex d-dimensio...
Possibly the most fundamental combinatorial invariant associated to a finite simplicial complex is i...
Abstract. The Upper Bound Conjecture is verified for a class of odd-dimensional simplicial complexes...
AbstractSeveral recent papers have addressed the problem of characterizing the f-vectors of cubical ...
jockusch(a3 mat h.lsa.umich.edu Abstract. We construct a family of cubical polytypes which shows tha...
AbstractThe upper bound inequality[formula](0⩽i⩽d/2) is proved for the torich-vector of a rational c...
AbstractLet P be a d-polytope. For a set of indices S = {1, i2, …, ik}, 0 ⩽ i1 < i2 < … < ik ⩽ d − 1...
AbstractA new definition of an h-vector for cubical polytopes (and complexes) is introduced. It has ...
We construct a family of cubical polytypes which shows that the upper bound on the number of facets ...
AbstractSeveral recent papers have addressed the problem of characterizing the f-vectors of cubical ...
AbstractIt is proved that equality in the Generalized Simplicial Lower Bound Conjecture can always b...
AbstractAs is well known, h-vectors of simplicial convex polytopes are characterized. Those h-vector...
Possibly the most fundamental combinatorial invariant associated to a finite simplicial complex is i...
Thesis (Ph.D.)--University of Washington, 2022A key tool that combinatorialists use to study simplic...
In geometric, algebraic, and topological combinatorics, properties such as symmetry, unimodality, an...
International audiencethis is an extended abstract of the full version. We study n-vertex d-dimensio...
Possibly the most fundamental combinatorial invariant associated to a finite simplicial complex is i...
Abstract. The Upper Bound Conjecture is verified for a class of odd-dimensional simplicial complexes...
AbstractSeveral recent papers have addressed the problem of characterizing the f-vectors of cubical ...
jockusch(a3 mat h.lsa.umich.edu Abstract. We construct a family of cubical polytypes which shows tha...
AbstractThe upper bound inequality[formula](0⩽i⩽d/2) is proved for the torich-vector of a rational c...
AbstractLet P be a d-polytope. For a set of indices S = {1, i2, …, ik}, 0 ⩽ i1 < i2 < … < ik ⩽ d − 1...
DOI
Add to ORKG