Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

COMBINATORICS
2002

favoriteEmaildiscussreport

107views more COMBINATORICS 2002»

Combinatorial Laplacian of the Matching Complex

13 years 4 months ago

Combinatorial Laplacian of the Matching Complex

Download www.math.miami.edu

A striking result of Bouc gives the decomposition of the representation of the symmetric group on the homology of the matching complex into irreducibles that are self-conjugate. We show how the combinatorial Laplacian can be used to give an elegant proof of this result. We also show that the spectrum of the Laplacian is integral.

Xun Dong, Michelle L. Wachs

Real-time Traffic

COMBINATORICS 2002 | Elegant Proof | Laplacian | Symmetric Group |

claim paper

Related Content

» Computing Betti Numbers via Combinatorial Laplacians

» Articulated Shape Matching by Robust Alignment of Embedded Representations

» A polynomial time equivalence between DNA sequencing and the exact perfect matching proble...

» Symmetric Trellis Coded Vector Quantization

» Matching Polyhedral Terrains Using Overlays of Envelopes

» A study of graph spectra for comparing graphs and trees

» Simple Effective Decipherment via Combinatorial Optimization

» Approximability of Combinatorial Problems with Multiagent Submodular Cost Functions

» Recursive Teaching Dimension Learning Complexity and Maximum Classes

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2002
Where	COMBINATORICS
Authors	Xun Dong, Michelle L. Wachs

Comments (0)