Hard Lefschetz theorem for simple polytopes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hard Lefschetz theorem for simple polytopes

McMullen’s proof of the Hard Lefschetz Theorem for simple polytopes is studied, and a new proof of this theorem that uses conewise polynomial functions on a simplicial fan is provided.

متن کامل

Hard Lefschetz Theorem for Nonrational Polytopes

The Hard Lefschetz theorem is known to hold for the intersection cohomology of the toric variety associated to a rational convex polytope. One can construct the intersection cohomology combinatorially from the polytope, hence it is well defined even for nonrational polytopes when there is no variety associated to it. We prove the Hard Lefschetz theorem for the intersection cohomology of a gener...

متن کامل

An analog of the Hard Lefschetz theorem for convex polytopes simple in edges

Proofs of these relations may be found in [1, 2, 3]. If the polytope ∆ is not simple, then the relations above are not true. A polytope ∆ is said to be integral provided all its vertices belong to the integer lattice. With each integral convex polytope ∆ one associates the toric variety X = X(∆) (see [4, 5, 6, 7]). This is a projective complex algebraic variety, singular in general. It turns ou...

متن کامل

Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property

Techniques from algebraic geometry, in particular the hard Lefschetz theorem, are used to show that certain finite partially ordered sets O x derived from a class of algebraic varieties X have the k-Sperner property for all k. This in effect means that there is a simple description of the cardinality of the largest subset of C) x containing no (k + 1)-element chain. We analyze, in some detail, ...

متن کامل

Lefschetz Properties of Balanced 3-polytopes

In this paper, we study Lefschetz properties of Artinian reductions of Stanley–Reisner rings of balanced simplicial 3-polytopes. A (d − 1)-dimensional simplicial complex is said to be balanced if its graph is d-colorable. If a simplicial complex is balanced, then its Stanley–Reisner ring has a special system of parameters induced by the coloring. We prove that the Artinian reduction of the Stan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebraic Combinatorics

سال: 2009

ISSN: 0925-9899,1572-9192

DOI: 10.1007/s10801-009-0212-1