Note: Combinatorial Alexander Duality - A Short and Elementary Proof

نویسندگان

  • Anders Björner
  • Martin Tancer
چکیده

Let X be a simplicial complex with ground set V . Define its Alexander dual as the simplicial complex X∗ = {σ ⊆ V | V \ σ / ∈ X}. The combinatorial Alexander duality states that the i-th reduced homology group of X is isomorphic to the (|V | − i − 3)-th reduced cohomology group of X∗ (over a given commutative ring R). We give a selfcontained proof from first principles, accessible to the non-expert.

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

ثبت نام

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

منابع مشابه

2 1 O ct 2 00 7 COMBINATORIAL ALEXANDER DUALITY — A SHORT AND ELEMENTARY PROOF

Let X be a simplicial complex with the ground set V . Define its Alexander dual as a simplicial complex X∗ = {σ ⊆ V | V \ σ / ∈ X}. The combinatorial Alexander duality states that the i-th reduced homology group of X is isomorphic to the (|V |−i−3)th reduced cohomology group of X∗ (over a given commutative ring R). We give a selfcontained proof.

متن کامل

5 O ct 2 00 7 COMBINATORIAL ALEXANDER DUALITY — A SHORT AND ELEMENTARY PROOF

Let X be a simplicial complex with the ground set V . Define its Alexander dual as a simplicial complex X∗ = {σ ⊆ V | V \ σ / ∈ X}. The combinatorial Alexander duality states that the i-th reduced homology group of X is isomorphic to the (|V |−i−3)th reduced cohomology group of X∗ (over a given commutative ring R). We give a selfcontained proof.

متن کامل

Combinatorial Alexander Duality — a Short and Elementary Proof

Let X be a simplicial complex with ground set V . Define its Alexander dual as the simplicial complex X∗ = {σ ⊆ V | V \ σ / ∈ X}. The combinatorial Alexander duality states that the i-th reduced homology group of X is isomorphic to the (|V | − i − 3)-th reduced cohomology group of X∗ (over a given commutative ring R). We give a selfcontained proof from first principles, accessible to the non-ex...

متن کامل

Combinatorial Characterizations of K-matrices

We present a number of combinatorial characterizations of Kmatrices. This extends a theorem of Fiedler and Pták on linearalgebraic characterizations of K-matrices to the setting of oriented matroids. Our proof is elementary and simplifies the original proof substantially by exploiting the duality of oriented matroids. As an application, we show that a simple principal pivot method applied to th...

متن کامل

A Short Proof of the Non-Existence of Certain Cryptographic Functions

Several criteria have been proposed as desirable for binary cryptographic functions. Three important ones are balance, correlation-immunity and higher order strict avalanche criterion. Lloyd 7] has shown that there are no balanced, uncorrelated functions which satisfy the strict avalanche criterion of order n ? 2. In this note we give a short proof of this result using elementary combinatorial ...

متن کامل

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


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

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 42  شماره 

صفحات  -

تاریخ انتشار 2009