AbstractWe investigate necessary conditions for the existence of projections of polytopes that preserve full k-skeleta. More precisely, given the combinatorics of a polytope and the dimension e of the target space, what are obstructions to the existence of a geometric realization of a polytope with the given combinatorial type such that a linear projection to e-space strictly preserves the k-skeleton. Building on the work of Sanyal (2009), we develop a general framework to calculate obstructions to the existence of such realizations using topological combinatorics. Our obstructions take the form of graph colorings and linear integer programs. We focus on polytopes of product type and calculate the obstructions for products of polygons, prod...
We construct a family of cubical polytypes which shows that the upper bound on the number of facets ...
For 3-dimensional convex polytopes, inscribability is a classical property that is relatively well-u...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
International audienceSimultaneously generalizing both neighborly and neighborly cubical polytopes, ...
Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by ...
Abstract. We introduce PSN polytopes whose k-skeleton is combinatorially equivalent to that of a pro...
AbstractWe address several basic questions that arise in the use of projection in combinatorial opti...
AbstractWe construct a new 2-parameter family Emn, m,n⩾3, of self-dual 2-simple and 2-simplicial 4-p...
International audienceWe study the question of polytopality of graphs: when is a given graph the gra...
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of ...
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means o...
This thesis explores two specific topics of discrete geometry, the multitriangulations and the polyt...
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs...
AbstractWe prove the following theorem: Suppose that m ⩾ 3(n + 1)2 and that ƒ : K → Rm is a PL map o...
The graph of a polytope is the graph whose vertex set is the set of vertices of the polytope, and wh...
We construct a family of cubical polytypes which shows that the upper bound on the number of facets ...
For 3-dimensional convex polytopes, inscribability is a classical property that is relatively well-u...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...
International audienceSimultaneously generalizing both neighborly and neighborly cubical polytopes, ...
Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by ...
Abstract. We introduce PSN polytopes whose k-skeleton is combinatorially equivalent to that of a pro...
AbstractWe address several basic questions that arise in the use of projection in combinatorial opti...
AbstractWe construct a new 2-parameter family Emn, m,n⩾3, of self-dual 2-simple and 2-simplicial 4-p...
International audienceWe study the question of polytopality of graphs: when is a given graph the gra...
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of ...
Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means o...
This thesis explores two specific topics of discrete geometry, the multitriangulations and the polyt...
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs...
AbstractWe prove the following theorem: Suppose that m ⩾ 3(n + 1)2 and that ƒ : K → Rm is a PL map o...
The graph of a polytope is the graph whose vertex set is the set of vertices of the polytope, and wh...
We construct a family of cubical polytypes which shows that the upper bound on the number of facets ...
For 3-dimensional convex polytopes, inscribability is a classical property that is relatively well-u...
When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectili...