Resolutions of p-Modular TQFT's and Representations of Symmetric Groups

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

29 pages

Scientific paper

We construct families of TQFT's over the finite field Z/pZ starting from an integral TQFT obtained by Frohman and Nicas. These TQFT's are likely to describe the constant order contributions of the cyclotomic integer expansions of the Reshetikhin Turaev Ohtsuki theories. Their modular structure is intimately related to the p-modular representation theory of the symmetric groups S_n. We construct resolutions of simple p-modular TQFT's and S_n-modules over Z/pZ using powers of Lefschetz operators. These yield expansions of the irreducible p-modular S_n-characters in terms of the ordianry ones as well as expressions for the Alexander Polynomial of a 3-manifold evaluated at a p-th root of unity in terms of traces in the irreducible modular TQFT's over covering cobordisms. Together with identifications with the constant orders of quantum TQFT's this results, e.g., in non-trivial criteria for a group to be a 3-manifold group.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Resolutions of p-Modular TQFT's and Representations of Symmetric Groups 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 Resolutions of p-Modular TQFT's and Representations of Symmetric Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Resolutions of p-Modular TQFT's and Representations of Symmetric Groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-83094

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.