相关论文: On polytopes simple in edges
We give several new criteria to judge whether a simple convex polytope in a Euclidean space is combinatorially equivalent to a product of simplices. These criteria are mixtures of combinatorial, geometrical and topological conditions that…
Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In the present paper we highlight their connections to the Kuramoto synchronization model in physics -- where they are called adjacency…
Motivated by the problem of bounding the number of iterations of the Simplex algorithm we investigate the possible lengths of monotone paths followed by the Simplex method inside the oriented graphs of polyhedra (oriented by the objective…
There are (at least) two reasons to study random polytopes. The first is to understand the combinatorics and geometry of random polytopes especially as compared to other classes of polytopes, and the second is to analyze average-case…
We determine (non-necessarily convex) polyhedra having simple dense geodesics.
We give a proof of the hard Lefschetz theorem for orbifolds that does not involve intersection homology. This answers a question of Fulton. We use a foliated version of the hard Lefschetz theorem due to El Kacimi.
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…
A simple convex lattice polytope $\Box$ defines a torus-equivariant line bundle $\LB$ over a toric variety $\XB.$ Atiyah and Bott's Lefschetz fixed-point theorem is applied to the torus action on the $d''$-complex of $\LB$ and information…
We introduce the intersection cohomology module of a matroid and prove that it satisfies Poincar\'e duality, the hard Lefschetz theorem, and the Hodge-Riemann relations. As applications, we obtain proofs of Dowling and Wilson's Top-Heavy…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
In the paper we treat Gale diagrams in a combinatorial way. The interpretation allows to describe simplicial complexes which are Alexander dual to boundaries of simplicial polytopes and, more generally, to nerve-complexes of general…
It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…
Given a set $S \subseteq \mathbb{R}^d$, a hollow polytope has vertices in $S$ but contains no other point of $S$ in its interior. We prove upper and lower bounds on the maximum number of vertices of hollow polytopes whose facets are…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…
Stanley showed that monomial complete intersections have the strong Lefschetz property. Extending this result we show that a simple extension of an Artinian Gorenstein algebra with the strong Lefschetz property has again the strong…
We conduct a systematic study of the Ehrhart theory of certain slices of rectangular prisms. Our polytopes are generalizations of the hypersimplex and are contained in the larger class of polypositroids introduced by Lam and Postnikov;…
We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.
We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…