Combinatorial Stokes formulas via minimal resolutions

Details Combinatorial Stokes formulas via minimal resolutions Combinatorial Stokes formulas via minimal resolutions

2007-09-29

arxiv.org/abs/0710.0050v1

Mathematics

Combinatorics

18 pages

Scientific paper

We describe an explicit chain map from the standard resolution to the minimal resolution for the finite cyclic group Z_k of order k. We then demonstrate how such a chain map induces a "Z_k-combinatorial Stokes theorem", which in turn implies "Dold's theorem" that there is no equivariant map from an n-connected to an n-dimensional free Z_k-complex. Thus we build a combinatorial access road to problems in combinatorics and discrete geometry that have previously been treated with methods from equivariant topology. The special case k=2 for this is classical; it involves Tucker's (1949) combinatorial lemma which implies the Borsuk-Ulam theorem, its proof via chain complexes by Lefschetz (1949), the combinatorial Stokes formula of Fan (1967), and Meunier's work (2006).

Affiliated with

Also associated with

No associations

Rating

Combinatorial Stokes formulas via minimal resolutions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorial Stokes formulas via minimal resolutions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial Stokes formulas via minimal resolutions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-462108